Public key encryption and signature schemes based on polynomials over ℤn

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

Volumn 1070, Issue , 1996, Pages 60-71

  Schwenk, Jörg ^a   Eisfeld, Jörg ^b  

^a DEUTSCHE TELEKOM LABORATORIES   (Germany)

^b JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; POLYNOMIALS; PUBLIC KEY CRYPTOGRAPHY;

PUBLIC-KEY ENCRYPTION; PUBLIC-KEY ENCRYPTION SCHEME; SECURITY FEATURES; SHORT SIGNATURES; SIGNATURE SCHEME;

AUTHENTICATION;

EID: 33746710703     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68339-9_6     Document Type: Conference Paper

References (7)

1. [BO81] M. Ben-Or,Probabilistic Algorithms in Finite Fields. Proc. IEEE FOCS 1981, pp. 394-398.
2. [FN93] A. Fiat and M. Naor,Broadcast Encryption. Pre-Proceedings of CRYPTO'93, 39.1-39.10.
3. [GMR88] S. Goldwasser, S. Micali and R. L. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. Vol. 17 No. 2 (1988), pp. 281-308.
4. [Rab80] M. O. Rabin,Digital Signatures and Public-Key Functions as Intractable as Factorization. MIT/LCS/TR-212, Jan 1979. Cited after B. Schneier.
5. [Rab80a] M. O. Rabin,Probabilistic Algorithms in Finite Fields. SIAM J. Comput. 9(1980), pp. 273-280.
6. [Sha93] A. Shamir,On the Generation of Multivariate Polynomials which are Hard to Factor. Preprint.
7. [Sch93] B. Schneier,Applied Cryptography. Wiley 1993.