Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor

Authors:
Nick Howgrave-Graham;Joan G. Dyer;Rosario Gennaro
Affiliations:
-;-;-
Venue:
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Year:
2001

Citing 7
Cited 2

How to generate cryptographically strong sequences of pseudo-random bits

SIAM Journal on Computing
A simple unpredictable pseudo random number generator

SIAM Journal on Computing
An Improved Pseudo-random Generator Based on Discrete Log

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
More Flexible Exponentiation with Precomputation

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
A subexponential algorithm for the discrete logarithm problem with applications to cryptography

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Theory and application of trapdoor functions

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
On diffie-hellman key agreement with short exponents

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques

Another look at “provable security”. II

INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Memory encryption: A survey of existing techniques

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

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.