N Using RSA with Low Exponent in a Public Key Network

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 218 LNCS, Issue , 1986, Pages 403-408

  Hastad, Johan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; PUBLIC KEY CRYPTOGRAPHY;

LARGE NETWORKS; POLYNOMIAL-TIME; PRIME NUMBER; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC KEYS; SYSTEMS OF EQUATIONS;

CRYPTOGRAPHY;

EID: 85034631664     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39799-X_29     Document Type: Conference Paper

References (9)

1. Alexi W., Chor B., Goldreich O. and Schnorr C. P. “RSA/Rabin Bits are 1/2+1/ poly (logN) Secure”
2. Awerbuch B., Chor B., Goldwasser S. and Micali S. “Provably Secure Coin Flip in a Byzantine Environment”, manuscript in preparation.
3. Blum M. and Goldwaaser S. “An efficient Probabilistic Public Key Encryption Scheme which Hidea all Partial Information” Presented in Crypto 1984
4. Broder A.Z. and Dolev D. “Flipping Coins in Many Pockets”
5. Casaels J.W.S. “Geometry of Numbers” Springer 1959
6. Goldwasser S. and Micali S. “Probabilistic Encryption”
7. Lenstra A.K., Lemtra H. W. and Lavasz L. “Factoring Polynomials with Integer Coefficients” Matematische Annalen 261 (1982) 513-534
8. Riveat R.L., Shamir A. and Adleman L. “A Method for Obtaining Digital Signatures
9. Schnorr C.P. “A Hierarchy of Polynomial Basis Reduction Algorithms”, manuscript