Abstract
We propose two RSA-type cryptosystems using n-adic expansion, where n is the public key. These cryptosystems can have more than one block as a plaintext space, and the decrypting process is faster than any other multi-block RSA-type cryptosystem ever reported. Deciphering the entire plaintext of this system is as intractable as breaking the RSA cryptosystem or factoring. Even if a message is several times longer than a public key n, we can encrypt the message fast without repeatedly using the secret key cryptosystem.
Chapter PDF
References
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.
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.
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.
D. Coppersmith, “Finding a small root of a univariate modular equation,” Advances in Cryptology — EUROCRYPT '96, LNCS 1070, (1996), pp.155–165.
N. Demytko, “A new elliptic curves based analogue of RSA,” Advances in Cryptology — EUROCRYPT '93, LNCS 765, (1994), pp.40–49.
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.
J. Håstad, “Solving simultaneous modular equations of low degree,” SIAM Journal of Computing, 17, (1988), pp.336–341.
B. S. Kaliski Jr., “A chosen message attack on Demytko's elliptic curve cryptosystem,” Journal of Cryptology, 10, (1997), pp.71–72.
B. S. Kaliski Jr. and M. Robshaw, “Secure use of RSA,” CRYPTOBYTES, 1 (3), (1995), pp.7–13.
E. Kaltofen and V. Shoup, “Subquadratic-time factoring of polynomials over finite fields”, Proc. of STOC, (1995), pp.398–406.
K. Koyama, U. M. Maurer, T. Okamoto and S. A. Vanstone, “New public-key schemes based on elliptic curves over the ring Z n,” Advances in Cryptology — CRYPTO '91, LNCS 576, (1991), pp.252–266.
K. Koyama; “Fast RSA-type schemes based on singular cubic curves,” Advances in Cryptology — EUROCRYPT '95, LNCS 921, (1995), pp.329–340.
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.
A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, “Handbook of applied cryptography,” CRC Press, (1996).
B. Meyer and V. Müller, “A public key cryptosystem based on elliptic curves over Z/n Z equivalent to factoring,” Advances in Cryptology — EUROCRYPT '96, LNCS 1070 (1996), pp.49–59.
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.
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.
RSA Laboratories, “Frequently asked questions about today's cryptography (Version 3.0),” http://www.rsa.com/rsalabs/, (1996).
J. Schwenk and J. Eisfeld, “Public key encryption and signature schemes based on polynomials over Z n,” Advances in Cryptology — EUROCRYPT '96, LNCS 1070, (1996), pp.60–71.
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.
M. J. Wiener, “Cryptanalysis of short RSA secret exponents,” IEEE Transactions on Information Theory, IT-36, (1990), pp.553–558.
H. C. Williams and B. Schmid, “Some remarks concerning the M.I.T. public-key cryptosystem,” BIT 19, (1979), pp.525–538.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Takagi, T. (1997). Fast RSA-type cryptosystems using n-adic expansion. In: Kaliski, B.S. (eds) Advances in Cryptology — CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, vol 1294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052249
Download citation
DOI: https://doi.org/10.1007/BFb0052249
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63384-6
Online ISBN: 978-3-540-69528-8
eBook Packages: Springer Book Archive