Common modulus and chosen-message attacks on public-key schemes with linear recurrence relations

Information Processing Letters

Volumn 70, Issue 3, 1999, Pages 153-156

  Tzeng, Wen Guey ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR EQUATIONS;

CHOSEN-MESSAGE ATTACK; COMMON MODULUS ATTACK; CRYPTANALYSIS; LINEAR RECURRENCE RELATION;

CRYPTOGRAPHY;

EID: 0344718652     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00055-1     Document Type: Article

References (17)

1. D. Bleichenbacher, On the security of the KMOV public key cryptosystem, in: Proceedings of Advances in Cryptology-Crypto 97, Springer, Berlin, 1997, pp. 235-248.
2. D. Bleichenbacher, W. Bosma, A.K. Lenstra, Some remarks on Lucas-based cryptosystems, in: Proceedings of Advances in Cryptology-Crypto 95, Springer, Berlin, 1995, pp. 386-396.
3. G.I. Davida, Chosen signature cryptanalysis of the RSA (MIT) public key cryptosystem, Technical Report TR-CS-82-2, Department of Electrical Engineering and Computer Science, University of Wisconsin, Milwaukee, 1982.
4. J.M. DeLaurentis, A further weakness in the common modulus protocol for the RSA cryptoalgorithm, Cryptologia 8 (1984) 253-259.
5. D.E. Denning, Digital signatures with RSA and other public-key cryptosystems, Comm. ACM 27 (4) (1984) 388-392.
6. Y. Desmedt, A.M. Odlyzko, A chosen text attack on the RSA cryptosystem and some discrete logarithm problems, in: Proceedings of Advances in Cryptology-Crypto 85, Springer, Berlin, 1986, pp. 516-522.
7. B. Kaliski, A chosen message attack on Demytko's elliptic curve crytosystem, J. Cryptology 10 (1997) 71-72.
8. D. Kravitz, I. Reed, Extension of RSA cryptostructure: a Galois approach, Electron. Lett. 18 (6) (1982) 255-256.
9. C.-S. Laih, F.-K. Tu, W.-C. Tai, On the security of the Lucas function, Inform. Process. Lett. 53 (1995) 243-247.
10. R. Lidl, W.B. Muller, Permutation polynomials in RSA-cryptosystems, in: Proceedings of Advances in Cryptology-Crypto 83, Plenum Press, 1984, pp. 293-301.
11. W.B. Muller, W. Nobauer, Some remarks on public-key cryptosystem, Studia Sci. Math. Hungar. 16 (1981) 71-76.
12. W.B. Muller, W. Nobauer, Cryptanalysis of the Dickson scheme, in: Proceedings of Advances in Cryptology-Eurocrypt 85, Springer, Berlin, 1986, pp. 50-61.
13. R. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM 21 (2) (1978) 120-126.
14. G.J. Simmons, A "weak" privacy protocol using the RSA crypto algorithm, Cryptologia 7 (1983) 180-182.
15. P. Smith, LUC public-key encryption, Dr. Dobb's J. 18 (1) (1993) 44-49.
16. P. Smith, M.J. Lennon, LUC: a new public key system, in: Proc. 9th IFIP International Conference on Computer Security, North-Holland, Amsterdam, 1993, pp. 103-117.
17. P. Smith, C. Skinner, A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms, in: Proceedings of Advances in Cryptology-Asiacrypt 94, Springer, Berlin, 1995, pp. 357-364.