Abstract
In this paper we explore pseudo-random number generation on the IBM 4758 Secure Crypto Coprocessor. In particular we compare several variants of Gennaro’s provably secure generator, proposed at Crypto 2000, with more standard techniques based on the SHA-1 compression function. Our results show how the presence of hardware support for modular multiplication and exponentiation affects these algorithms.
Chapter PDF
Similar content being viewed by others
Keywords
- Modular Multiplication
- Cryptographic Algorithm
- Modular Exponentiation
- Hardware Support
- Secure Coprocessor
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L. Adleman. A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography. IEEE FOCS, pp. 55–60, 1979.
L. Blum and M. Blum and M. Shub A Simple Unpredictable Pseudo-Random Number Generator. SIAM J.Computing, 15(2):364–383, May 1986.
M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J.Computing, 13(4):850–864, November 1984.
W. Diffie and M. Hellman. New Directions in Cryptography. IEEE Trans. Inf. Theory, IT-22:644–654, November 1976.
R. Gennaro. An Improved Pseudo-random Generator Based on Discrete Log. CRYPTO’2000, LNCS 1880, pp. 469–481, 2000. Updated version available at http://www.research.ibm.com/people/r/rosario/prng.ps
D. Knuth. The Art of Computer Programming (vol.3): Sorting and Searching. Addison-Wesley, 1973.
C.H. Lim and P.J. Lee. More Flexible Exponentiation with Precomputation. CRYPTO’ 94, LNCS 839, pp. 95–107.
National Institute of Standards and Technology. FIPS 140-1, Security Requirements for Cryptographic Modules. Available at http://csrc.nist.gov/cryptval/140-1.htm
S.C. Pohlig and M.E. Hellman. An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance. IEEE Trans. Inf. Theory, vol. IT-24, no. 1, p. 106–110, January 1978
J. Pollard. Monte-Carlo Methods for Index Computation (mod p). Mathematics of Computation, 32(143):918–924, 1978.
C. Schnorr Security of Allmost ALL Discrete Log Bits. Electronic Colloquium on Computational Complexity. Report TR98-033. Available at http://www.eccc.uni-trier.de/eccc/.
S. Smith and S. Weingart. Building a High-Performance, Programmable Secure Coprocessor. Special Issue on Computer Network Security, Elsevier, 1990, v. 31, pp 831–860. Also, IBM Research Report RC21102, February 1998.
P.C. van Oorschot and M. Wiener. On Diffie-Hellman Key Agreement with Short Exponents. EUROCRYPT’96, LNCS 1070, pp. 332–343, 1996.
A. Yao. Theory and Applications of Trapdoor Functions. IEEE FOCS, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Howgrave-Graham, N., Dyer, J., Gennaro, R. (2001). Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor. In: Koç, Ç.K., Naccache, D., Paar, C. (eds) Cryptographic Hardware and Embedded Systems — CHES 2001. CHES 2001. Lecture Notes in Computer Science, vol 2162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44709-1_9
Download citation
DOI: https://doi.org/10.1007/3-540-44709-1_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42521-2
Online ISBN: 978-3-540-44709-2
eBook Packages: Springer Book Archive