Concepedia

C. P. Schnorr

CP

40

Publications

7.4K

Citations

25

H-Index

1969

Active since

Affiliations

Goethe University Frankfurt(Current)

Massachusetts Institute of Technology

C. P. Schnorr is an author at Goethe University Frankfurt specializing in engineering, computational complexity, and computer science.

Top concepts

EngineeringComputational ComplexityComputer ScienceDiscrete MathematicsCryptographyApproximation TheoryData SecurityCombinatorial OptimizationMathematical ProgrammingProbability

Publications per year

1969–2005

40

Publications

40

Efficient signature generation by smart cards

C. P. Schnorr · Journal of Cryptology · 1991 · 2.7K citations

Hardware Security, Blockchain, Cryptographic Primitive +10

Lattice basis reduction: Improved practical algorithms and solving subset sum problems

C. P. Schnorr, M. Euchner · Mathematical Programming · 1994 · 1.4K citations

Mathematical Programming, Engineering, Practical Algorithms +12

A hierarchy of polynomial time lattice basis reduction algorithms

C. P. Schnorr · Theoretical Computer Science · 1987 · 631 citations · Full text

Mathematical Programming, Engineering, Computational Number Theory +15

RSA and Rabin Functions: Certain Parts are as Hard as the Whole

Werner Alexi, Benny Chor, Oded Goldreich et al. · SIAM Journal on Computing · 1988 · 340 citations

Cryptographic Primitive, Rabin Functions, Simultaneous Security +12

Process complexity and effective random tests

C. P. Schnorr · Journal of Computer and System Sciences · 1973 · 264 citations

Engineering, Software Testing, Process Complexity +8

Rows per page

1–5 of 40