Skip to main content
Conference ProceedingsOPEN ACCESS

Pseudo-random number generation on the IBM 4758 secure crypto coprocessor

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2162 93-102
DOI: 10.1007/3-540-44709-1_9
3Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Howgrave-Graham, N., Dyer, J., & Gennaro, R. (2001). Pseudo-random number generation on the IBM 4758 secure crypto coprocessor. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2162, pp. 93–102). Springer Verlag. https://doi.org/10.1007/3-540-44709-1_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free