Abstract
We present a new method for achieving high speed encryption and decryption using large-block cryptosystems. The method applies to both private and public key cryptosystems. The method amplifies the encrypting speed of any cryptosystem, and it is provably reducible to the latter.
Simultaneous security of bits is a subtle concept. We choose not to discuss it at length here as it would distract the reader from the main topic of this paper. For a definition see [13]
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alexi, W., Chor, B., Goldreich, O., Schnorr, C.: RSA and /Rabin functions: certain parts are as hard as the whole. Siam Journal on Computing 17 (1988) 194–209.
Coppersmith, D., Franklin, M., Patarin, J., Reiter, M.: Low-exponent RSA with related messages. In Advances in Cryptology-Proceedings of EUROCRYPT 96 (1996) vol. 1070 of Lecture Notes in Computer Science, Springer-Verlag pp. 1–9.
Davio, M., Desmedt, Y., Goubert, J., Hoornaert, F., Quisquater, J.-J.: Efficient hardware and software implementations for the DES. In Advances in Cryptology — Proceedings of CRYPTO 84 (1985) Springer-Verlag pp. 144–146.
Everle, H.: A high-speed DES implementation for network applications. In Advances in Cryptology — Proceedings of CRYPTO 92 (1993) vol. 740 of Lecture Notes in Computer Science, pp. 521–539.
Hastad, J.: Solving simultaneous modular equations of low degree. SIAM Journal on Computing 17 (1988) 336–341.
Karatsuba, Ofman: Multiplication of multidigit numbers on automata (in russian). Doklady Akademii Nauk SSSR 145 (1962) 293–294.
Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation 48 (1987) 203–209.
Koyama, K., Maurer, U. M., Okamoto, T., Vanstone, S. A.: New public-key schemes based on elliptic curves over the ring z n. In Advances in Cryptology — Proceedings of CRYPTO 91 (1992) vol. 576 of Lecture Notes in Computer Science, pp. 252–266.
Maurer, U.: Factoring with an oracle. In Advances in Cryptology — Proceedings of EUROCRYPT 92 (1993) vol. 658 of Lecture Notes in Computer Science, Springer-Verlag pp. 429–436.
Menezes, A. J.: Elliptic curve public key cryptosystems. Kluwer Academic Publishers 1993.
Miller, V. S.: Use of elliptic curves in cryptography. In Advances in Cryptology — Proceedings of CRYPTO 85 (1986) vol. 218 of Lecture Notes in Computer Science, Springer-Verlag pp. 417–426.
Patarin, J.: Some serious protocol failures for RSA with exponent e of less than ≅ 32 bits. Cryptography conference, CIRM, Luminy, France 1995.
Peralta, R.: Simultaneous security of bits in the discrete log. In Advances in Cryptology — Proceedings of EUROCRYPT 85 (1986) Lecture Notes in Computer Science, Springer-Verlag pp. 62–72.
Verbauwhede, I., Hoornaeert, F., Vandewalle, J., Man, H. D.: Security and performance optimization of a new DES data encryption chip. IEEE journal of solid-state circuits 23 (1988) 647–656.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Davida, G., Peralta, R. (1998). High-speed cryptography. In: Okamoto, E., Davida, G., Mambo, M. (eds) Information Security. ISW 1997. Lecture Notes in Computer Science, vol 1396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030414
Download citation
DOI: https://doi.org/10.1007/BFb0030414
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64382-1
Online ISBN: 978-3-540-69767-1
eBook Packages: Springer Book Archive