Claus P. Schnorr

Q: What Schools Are Affiliated With Claus P. Schnorr

Claus P. Schnorr is affiliated with the following schools: Goethe University Frankfurt, Saarland University, University of Erlangen–Nuremberg

Claus P. Schnorr's AcademicInfluence.com Rankings

Claus P. Schnorr

Computer Science

#1265

World Rank

#1305

Historical Rank

Software Engineering

#161

World Rank

#162

Historical Rank

Database

#2786

World Rank

#2911

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Claus P. Schnorr Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Claus-Peter Schnorr is a German mathematician and cryptographer. Life He received his Ph.D. from the University of Saarbrücken in 1966, and his habilitation in 1970. Schnorr's contributions to cryptography include his study of Schnorr groups, which are used in the digital signature algorithm bearing his name. Besides this, Schnorr is known for his contributions to algorithmic information theory and for creating an approach to the definition of an algorithmically random sequence which is alternative to the concept of Martin-Löf randomness.

(See a Problem?)

Claus P. Schnorr's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Efficient signature generation by smart cards (2004) (2396)
Efficient Identification and Signatures for Smart Cards (1989) (1638)
Lattice basis reduction: Improved practical algorithms and solving subset sum problems (1991) (1540)
A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms (1987) (674)
RSA and Rabin Functions: Certain Parts are as Hard as the Whole (1988) (346)
Efficient Identification and Signatures for Smart Cards (Abstract) (1990) (325)
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice (1990) (298)
An optimal sorting algorithm for mesh connected computers (1986) (238)
Improved low-density subset sum algorithms (1992) (211)
Testing polynomials which are easy to compute (Extended Abstract) (1980) (205)
A unified approach to the definition of random sequences (1971) (203)
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction (1995) (184)
Lattice Reduction by Random Sampling and Birthday Methods (2003) (182)
Process complexity and effective random tests (1973) (182)
The process complexity and effective random tests. (1972) (172)
Security of Signed ElGamal Encryption (2000) (160)
Geometry of Numbers and Integer Programming (Summary) (1988) (153)
Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers (1989) (133)
A More Efficient Algorithm for Lattice Basis Reduction (1988) (129)
Fast Signature Generation With a Fiat Shamir-Like Scheme (1991) (127)
Security of Blind Discrete Log Signatures against Interactive Attacks (2001) (123)
Stronger Security Proofs for RSA and Rabin Bits (1997) (117)
An Improved Low-Denisty Subset Sum Algorithm (1991) (108)
Optimal Algorithms for Self-Reducible Problems (1976) (106)
Black Box Cryptanalysis of Hash Networks Based on Multipermutations (1994) (100)
Satisfiability Is Quasilinear Complete in NQL (1978) (90)
An efficient signature scheme based on quadratic equations (1984) (88)
Block Reduced Lattice Bases and Successive Minima (1994) (78)
A Monte Carlo factoring algorithm with linear storage (1984) (78)
An efficient solution of the congruence x2+ky2=mpmod{n} (1987) (76)
An Algorithm for Transitive Closure with Linear Expected Time (1978) (66)
A Survey of the Theory of Random Sequences (1977) (65)
Fast LLL-type lattice reduction (2006) (62)
A Lower Bound on the Number of Additions in Monotone Computations (1976) (57)
Segment LLL-Reduction of Lattice Bases (2001) (55)
On the Construction of Random Number Generators and Random Function Generators (1988) (43)
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation (1990) (42)
Bottlenecks and Edge Connectivity in Unsymmetrical Networks (1979) (42)
RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure (1984) (41)
Efficient Signature Schemes Based on Polynomial Equations (1984) (41)
Progress on LLL and Lattice Reduction (2010) (37)
The Generalized Gauss Reduction Algorithm (1996) (35)
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations (1991) (35)
Efficient, Perfect Random Number Generators (1988) (34)
The Multiplicative Complexity of Quadratic Boolean Forms (1992) (33)
The network complexity and the Turing machine complexity of finite functions (1976) (32)
Segment LLL-Reduction with Floating Point Orthogonalization (2001) (32)
Parallel FFT-Hashing (1993) (30)
Efficient, perfect polynomial random number generators (2004) (28)
Improved Lower Bounds on the Number of Multiplications/Divisions which are Necessary of Evaluate Polynomials (1978) (27)
Optimal enumerations and optimal gödel numberings (1974) (26)
Refined Analysis and Improvements on Some Factoring Algorithms (1981) (26)
FFT-Hash II, Efficient Cryptographic Hashing (1992) (26)
A 3n-Lower Bound on the Network Complexity of Boolean Functions (1980) (24)
An O(n3log n) deterministic and an O(n3) Las Vegs isomorphism test for trivalent graphs (1987) (24)
Security of 2^t-Root Identification and Signatures (1996) (24)
Transformational Classes of Grammars (1969) (22)
Efficient Oblivious Proofs of Correct Exponentiation (1999) (22)
On self-transformable combinatorial problems (1981) (21)
Signatures through Approximate Representation by Quadratic Forms (1983) (21)
The Multiplicative Complexity of Boolean Functions (1988) (19)
Approximating Integer Lattices by Lattices with Cyclic Factor Groups (1987) (19)
The Combinational Complexity of Equivalence (1976) (19)
Security of Allmost ALL Discrete Log Bits (1998) (18)
Cryptanalysis of Certain Variants of Rabin's Signature Scheme (1984) (15)
Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract) (1998) (15)
A characterization of complexity sequences (1975) (15)
Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys (2001) (15)
On the Additive Complexity of Polynomials (1980) (15)
An O(n3 log n) deterministic and an O (n 3) probabilistic isomorphism test for trivalent graphs (1982) (15)
Solving Subset Sum Problems of Densioty close to 1 by "randomized" BKZ-reduction (2012) (14)
General random sequences and learnable sequences (1977) (13)
An Extension of Strassen's Degree Bound (1981) (13)
Security of Discrete Log Cryptosystems in the Random Oracle and the Generic Model (2005) (12)
The Black-Box Model for Cryptographic Primitives (1998) (12)
Average Time Fast SVP and CVP Algorithms for Low Density Lattices and the Factorization of Integers (2010) (12)
RSA-Bits are 0.5 + epsilon Secure (1985) (11)
Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems (2001) (10)
Local Randomness in Polynomial Random Number and Random Function Generators (1993) (9)
Enhancing the security of perfect blind DL-signatures (2006) (8)
Accelerated Slide- and LLL-Reduction (2011) (8)
An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension (1996) (7)
Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials (1977) (7)
Factoring Integers by CVP Algorithms (2013) (7)
Does the Computational Speed-up Concern Programming? (1972) (7)
Segment and Strong Segment LLL-Reduction of Lattice Bases (2005) (7)
Public Key Identification Based on the Equivalence of Quadratic Forms (2007) (6)
Optimal Gödel Numberings (1971) (6)
Fast Factoring Integers by SVP Algorithms, corrected (2021) (5)
A Gödel Theorem on Network Complexity Lower Bounds (1986) (5)
Monte-Carlo factoring algorithm with finite storage (1983) (5)
An Optimal, Stable Continued Fraction Algorithm (1996) (5)
Computation of the Boolean Matrix-Vector, AND/OR-Produkt in Average Time O(m + nlnn) (1992) (4)
Accelerated and Improved Slide-and LLL-Reduction (2012) (4)
Identification and signatures based on NP-hard problems of indefinite quadratic forms (2008) (4)
A Stable Integer Relation Algorithm (1994) (4)
Security of DL-encryption and signatures against generic attacks—a survey (2001) (4)
Multiterminal Network Flow and Connectivity in Unsymmetrical Networks (1978) (4)
Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations (1973) (4)
A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract) (1986) (3)
The multiplicative complexity of quadratic Boolean functions (1987) (3)
Computation of highly regular nearby points (1995) (3)
New Practical Algorithms for the Approximate Shortest Lattice Vector (2001) (3)
Fast Factoring Integers by SVP Algorithms (2021) (2)
Perfect, Generic Pseudo-Randomness for Cyclic Groups (1998) (2)
Efficient identification andsignatures for smart cards (1990) (2)
Blockwise Lattice Basis Reduction Revisited (2006) (2)
An algorithm for stransitive closure with linear expected time (1977) (1)
A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors (1977) (1)
Local Randomness in Candidate One-Way Functions (1992) (1)
Almost All Discrete Log Bits Are Simultaneously Secure (1998) (1)
Security of Signed ElGamal Encryption Extended (2000) (1)
Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter (1998) (1)
The multiplicative complexity of Boolean quadratic forms, a survey (1992) (1)
Is the RSA Scheme Safe? (1982) (1)
The Network Complexity and the Breadth of Boolean Functions (1977) (1)
On the Additive Complexity of Polynomials and some New Lower Bounds (1979) (1)
Our signature scheme relies on the interactive protocol of Chaum (0)
Review: Arthur H. Kruse, Some Notions of Random Sequence and their Set-Theoretic Foundations (1973) (0)
Cryptography (Dagstuhl Seminar 02391) (2021) (0)
On Maximal Merging of Information in Boolean Computations (1974) (0)
Visual Cryptography with Polarization (2006) (0)
How Many Polynomials can be Approximated Faster Than They can be Evaluated? (1981) (0)
The network-complexity of equivalence and other applications of the network complexity (1975) (0)
Factoring Integers by CVP and SVP Algorithms (2017) (0)
Errata: "Transformational Classes of Grammars" (1969) (0)

This paper list is powered by the following services:

Other Resources About Claus P. Schnorr

en.wikipedia.org

What Schools Are Affiliated With Claus P. Schnorr?

Claus P. Schnorr is affiliated with the following schools:

Claus P. Schnorr's Academic­Influence.com Rankings

Why Is Claus P. Schnorr Influential?

Claus P. Schnorr's Published Works

Published Works

Other Resources About Claus P. Schnorr

What Schools Are Affiliated With Claus P. Schnorr?

Image Attributions

Claus P. Schnorr's AcademicInfluence.com Rankings