The following pages link to Claus Peter Schnorr (Q1126892):
Displaying 50 items.
- (Q757464) (redirect page) (← links)
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice (Q757465) (← links)
- Efficient, perfect polynomial random number generators (Q809536) (← links)
- A hierarchy of polynomial time lattice basis reduction algorithms (Q1101500) (← links)
- The black-box model for cryptographic primitives (Q1126893) (← links)
- A 3n-lower bound on the network complexity of Boolean functions (Q1142030) (← links)
- How many polynomials can be approximated faster than they can be evaluated? (Q1155959) (← links)
- On the additive complexity of polynomials (Q1157163) (← links)
- Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel (Q1172079) (← links)
- Efficient signature generation by smart cards (Q1180508) (← links)
- The multiplicative complexity of quadratic boolean forms (Q1199694) (← links)
- Improved low-density subset sum algorithms (Q1207335) (← links)
- Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen (Q1220384) (← links)
- The combinational complexity of equivalence (Q1228356) (← links)
- The network complexity and the Turing machine complexity of finite functions (Q1230622) (← links)
- A lower bound on the number of additions in monotone computations (Q1232179) (← links)
- A universally hard set of formulae with respect to non-deterministic Turing acceptors (Q1236428) (← links)
- Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials (Q1249939) (← links)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
- Small generic hardcore subsets for the discrete logarithm: short secret DL-keys. (Q1603445) (← links)
- Stronger security proofs for RSA and Rabin bits. (Q1976263) (← links)
- Process complexity and effective random tests (Q2264549) (← links)
- Enhancing the security of perfect blind DL-signatures (Q2489230) (← links)
- Fast LLL-type lattice reduction (Q2490117) (← links)
- Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen (Q2531283) (← links)
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory) (Q2550943) (← links)
- Endliche Automaten und Zufallsfolgen (Q2553152) (← links)
- (Q2707405) (← links)
- (Q2724591) (← links)
- (Q2757225) (← links)
- Security of DL-encryption and signatures against generic attacks -- a survey (Q2765015) (← links)
- Factoring Integers by CVP Algorithms (Q2867248) (← links)
- Polynomial Time Algorithms for Finding Integer Relations among Real Numbers (Q3033848) (← links)
- Local Randomness in Polynomial Random Number and Random Function Generators (Q3137704) (← links)
- Bottlenecks and Edge Connectivity in Unsymmetrical Networks (Q3204982) (← links)
- (Q3204983) (← links)
- (Q3210171) (← links)
- (Q3316588) (← links)
- (Q3343442) (← links)
- (Q3343443) (← links)
- A Monte Carlo Factoring Algorithm With Linear Storage (Q3347945) (← links)
- Security of 2t-Root Identification and Signatures (Q3452348) (← links)
- Public Key Identification Based on the Equivalence of Quadratic Forms (Q3525581) (← links)
- Identification and signatures based on NP-hard problems of indefinite quadratic forms (Q3612243) (← links)
- A Gödel Theorem on Network Complexity Lower Bounds (Q3708019) (← links)
- (Q3719830) (← links)
- (Q3727379) (← links)
- RSA-bits are 0.5 + ε secure (Q3728805) (← links)
- (Q3745271) (← links)
- (Q3770590) (← links)
