On the security of some variants of the RSA signature scheme

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

Volumn 1485, Issue , 1998, Pages 85-96

  Michels, Markus ^a   Stadler, Markus ^a   Sun, Hung Min ^b  

^a Union Bank of Switzerland   (Switzerland)

^b CHAOYANG UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Cryptanalysis; Digital signature schemes; RSA variants

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; SECURITY OF DATA; SECURITY SYSTEMS;

CRYPTANALYSIS; DIGITAL SIGNATURE SCHEMES; RSA SIGNATURE SCHEMES; RSA VARIANTS;

AUTHENTICATION;

EID: 84958774093     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0055857     Document Type: Conference Paper

References (22)

1. D. Bleichenbacher, “On the Security of the KMOV Public Key cryptosystem”, LNCS 1294, Proc. Crypto’97, Springer-Verlag, (1997), pp. 235-248.
2. D. Bleichenbacher, W. Bosma, A. Lenstra, “Some remarks on Lucas-based cryptosystems’, LNCS 963, Proc. Crypto’95, Springer-Verlag, (1997), pp. 386-396.
3. D. Bleichenbacher, M. Joye, J.-J. Quisquater, “A new and optimal chosen-message attack on RSA-type cryptosystems’, LNCS 1334, Proc. Information and Communications Security- ICICS’97, Springer-Verlag, (1997), pp. 302-313.
4. C. Boyd, “Digital Signature and Public Key Cryptosystem in a Prime Order Subgroup of ~”, LNCS 1334, Proc. ICICS’97, Springer-Verlag, (1997).
5. Communicated by Colin Boyd.
6. D. Chaum, “Security without identification: transaction systems to make big brother obsolete”, Communications of the ACM, 28, 10, October, (1985), pp. 1030-1044.
7. G.I. Davida, “Chosen signature cryptoanalysis on the RSA (MIT) public key cryptosystem”, Tech. Rep. TR-CS-82-2, Department of Electrical Engineering and Computer Science, University of Wisconsin, Milwaukee, (1982).
8. J.M. DeLaurentis, “A further weakness in the common modulus protocol for the RSA cryptoalgorithm’, Cryptologia, No.8, Vol. 3, (1984), pp. 253-259.
9. N. Demytko, “A new elliptic curve based analogue of RSA”, LNCS 768, Proc. Eurocrypt’93, Springer Verlag, (1994), pp. 40-49.
10. H. Dobbertin, A. Bosselaers, B. Preneel, “RIPEMD-160, a strengthened version of RIPEMD”, LNCS 1039, Proc. Fast Software Encryption, Springer-Verlag, (1996), pp. 71-82.
11. S. Goldwasser, S. Micali, R. Rivest, “A digital signature scheme secure against adaptive chosen message attacks”, SIAM Journal on Computing, Vol. 17, No. 2,(1988), pp. 281-308.
12. J. Hastad, “On using RSA with low exponent in a public key network”, LNCS 218, Proc. Crypto ‘85, Springer Verlag, (1986), pp. 404-408.
13. W. de Jonge, D. Chaum, “Some Variations on RSA Signatures & their Security”, LNCS 263, Proc. Crypto ‘86, Springer Verlag, (1987), pp. 49-59.
14. n”, LNCS 576, Proc. Crypto’91, Springer Verlag, (1992).
15. A. Lenstra, P. Leyland: LIP - Long Integer Package, 1995.
16. W. Mao, “Cryptanalysis in Prime Order Subgroups in (Formula Presented)”, manuscript, (1998), available at http://grouper.ieee.org/groups/1363/contrib.html.
17. W.B. Miiller, W. NSbauer, “Some remarks on public key cryptosystems”, Studia Sci. Math. Hung., Vol. 16, (1981), pp. 71-76.
18. J. Pollard, “A Monte Carlo Method for Factorization”, BIT, Vol. 15, (1975), pp. 331-334.
19. M.O. Rabin, “Digitalized signatures and public-key functions as intractable as factorization”, MIT/LCS/TR-212, MIT Lab. for Computer Science, Cambridge, Mass., (1979).
20. R.L. Rivest, A. Shamir, L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems’, Communications of the ACM, Vol.21, (1978), pp. 120-126.
21. B. Schoenmakers, “Basic Security of the ecash TM Payment System”, LNCS, Proc. Computer Security and Industrial Cryptography: State of the Art and Evolution, Springer-Verlag, (1997).
22. H.C. Williams, “A modification of the RSA Public-Key Cryptosystem”, IEEE Trans. in Inform. Theory, IT-26, No. 6, (1980), pp. 726-729.