Fast RSA-Type cryptosystems using N-Adic expansion

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

Volumn 1294, Issue , 1997, Pages 372-384

  Takagi, Tsuyoshi ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MULTI BLOCKS; PLAINTEXT; PUBLIC KEYS; RSA CRYPTOSYSTEMS; SECRET KEY CRYPTOSYSTEM;

CRYPTOGRAPHY;

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

References (22)

1. W. Alexi, B. Chor, O. Goldreich, C. P. Schnorr; "Rsa and Rabin functions: certain parts are as hard as the whole," SIAM Journal of Computing, 17, (1988), pp.194-209.
2. G. R. Blakley and I. Borosh, "Rivest-Shamir-Adelman public key cryptosystems do not always conceal messages," Comput. & Maths, with Appls., 5, (1979), pp.169-178.
3. D. Coppersmith, M. Franklin, J. Patarin and M. Reiter, "Low-exponent RSA with related messages," Advances in Cryptology - EUROCRYPT '96, LNCS 1070, (1996), pp.1-9.
4. D. Coppersmith, "Finding a small root of a univariate modular equation," Advances in Cryptology - EUROCRYPT '96, LNCS 1070, (1996), pp.155-165.
5. N. Demytko, "A new elliptic curves based analogue of RSA," Advances in Cryptology - EUROCRYPT '93, LNCS 765, (1994), pp.40-49.
6. S. Goldwasser, S. Micali, and P. Tong, "Why and how to establish a private code on a public network," Proc. of FOCS, (1982), pp.134-144.
7. J. Hast ad, "Solving simultaneous modular equations of low degree," SIAM Journal of Computing, 17, (1988), pp.336-341.
8. B. S. Kaliski Jr., "A chosen message attack on Demytko's elliptic curve cryptosystem," Journal of Cryptology, 10, (1997), pp.71-72.
9. B. S. Kaliski Jr. and M. Robshaw, "Secure use of RSA," CRYPTOBYTES, 1 (3), (1995), pp.7-13.
10. E. Kaltofen and V. Shoup, "Subquadratic-time factoring of polynomials over finite fields", Proc. of STOC, (1995), pp.398-406.
11. K. Koyama, U. M. Maurer, T. Okamoto and S. A. Vanstone, "New public-key schemes based on elliptic curves over the ring Zn," Advances in Cryptology -CRYPTO '91, LNCS 576, (1991), pp.252-266.
12. K. Koyama; "Fast RSA-type schemes based on singular cubic curves," Advances in Cryptology - EUROCRYPT '95, LNCS 921, (1995), pp.329-340.
13. J. H. Loxton, D. S. P. Khoo, G. J. Bird and J. Seberry, "A cubic RSA code equivalent to factorization," Journal of Cryptology, 5, (1992), pp.139-150.
14. A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, "Handbook of applied cryptography," CRC Press, (1996).
15. B. Meyer and V. Miiller, "A public key cryptosystem based on elliptic curves over Z/nZ equivalent to factoring," Advances in Cryptology - EUROCRYPT '96, LNCS 1070 (1996), pp.49-59.
16. M. O. Rabin, "Digitalized signatures and public-key functions as intractable as factorization", Technical Report No.212, MIT, Laboratory of Computer Science, Cambridge (1979), pp.1-16.
17. R. Rivest, A. Shamir and L. M. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Communications of the ACM, 21(2), (1978), pp.120-126.
18. RSA Laboratories, "Frequently asked questions about today's cryptography (Version 3.0)," http://wHW.rsa.com/rsalabs/, (1996).
19. J. Schwenk and J. Eisfeld, "Public key encryption and signature schemes based on polynomials over Z„," Advances in Cryptology - EUROCRYPT '96, LNCS 1070, (1996), pp.60-71.
20. T. Takagi and S. Naito, "The multi-variable modular polynomial and its applications to cryptography," Proc. of ISAAC'96, LNCS 1178, (1996), pp.386-396.
21. M. J. Wiener, "Cryptanalysis of short RSA secret exponents," IEEE Transactions on Information Theory, IT-36, (1990), pp.553-558.
22. H. C. Williams and B. Schmid, "Some remarks concerning the M.I.T. public-key cryptosystem," BIT 19, (1979), pp.525-538.