<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>01878326</id>
  <dt>a</dt>
  <an>01878326</an>
  <augroup>
    <au>Howgrave-Graham, Nick</au>
    <au>Dyer, Joan</au>
    <au>Gennaro, Rosario</au>
  </augroup>
  <ti>Pseudo-random number generation on the IBM 4758 secure crypto coprocessor.</ti>
  <so>Ko\c{c}, \c{C}etin K. (ed.) et al., Cryptographic hardware and embedded systems - CHES 2001. 3rd international workshop, Paris, France, May 14-16, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2162, 93-102 (2001).</so>
  <py>2001</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>http://link.springer.de/link/service/series/0558/bibs/2162/21620093.htm</li>
  </ligroup>
  <abgroup>
    <ab>Summary: 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 {\tt SHA-1} compression function. Our results show how the presence of hardware support for modular multiplication and exponentiation affects these algorithms.</ab>
    <rv></rv>
  </abgroup>
</item>