Compressing Rabin Signatures

  • Daniel Bleichenbacher
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2964)


This note presents a method to compress a Rabin signature [Rab78] to about half of its length.


Signature Scheme Compression Algorithm Continue Fraction Expansion Deterministic Format Modular Equation 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ber]
    Bernstein, D.J.: Squeezing Rabin signatures. unpublishedGoogle Scholar
  2. [BR96]
    Bellare, M., Rogaway, P.: The exact security of digital signatures - how to sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399–416. Springer, Heidelberg (1996)Google Scholar
  3. [CN03]
    Coron, J.S., Nacacche, D.: Procédé de réduction de la taille d’une signature RSA ou Rabin. Patent FR28293333 (March 2003)Google Scholar
  4. [Cop96]
    Coppersmith, D.: Finding a small root of a univariate modular equation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 155–165. Springer, Heidelberg (1996)Google Scholar
  5. [Knu81]
    Knuth, D.E.: The art of computer programming, Seminumerical Algorithms, 2nd edn., vol. 2. Addison Wesley, Reading (1981)Google Scholar
  6. [Lan95]
    Lang, S.: Introduction to Diophantine Approximations. Springer, Heidelberg (1995) (new expanded edition)zbMATHGoogle Scholar
  7. [Rab78]
    Rabin, M.O.: Digitalized signatures. Foundation of Secure Computation, 155–169 (1978)Google Scholar
  8. [RSA93]
    Data Security, R.S.A.: Inc. PKCS #1: RSA Encryption Standard. Redwood City, CA, Version 1.5 (November 1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Daniel Bleichenbacher
    • 1
  1. 1.Bell Labs – Lucent Technologies 

Personalised recommendations