From fixed-length to arbitrary-length RSA padding schemes

Coron, JS;Koeune, François;Naccache, D.
(2000) 6th International Conference on the Theory and Application of Cryptology and Informnation Security (ASIACRYPT 2000) — Location: KYOTO(Japan) (3.December.2000)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 135.04 KB
Request a copy

Details

Authors
Abstract
A common practice for signing with RSA is to first apply a hash function or a redundancy function to the message, add some padding and exponentiate the resulting padded message using the decryption exponent. This is the basis of several existing standards. In this paper we show how to build a secure padding scheme for signing arbitrarily long messages with a secure padding scheme for fixed-size messages. This focuses more sharply the question of finding a secure encoding for RSA signatures, by showing that the difficulty is not in handling messages of arbitrary length, but rather in finding a secure redundancy function for short messages, which remains an open problem.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Coron, J., Koeune, F., & Naccache, D. (2000). From fixed-length to arbitrary-length RSA padding schemes. Lecture Notes in Computer Science, 1976, 90-96. https://doi.org/10.1007/3-540-44448-3_8 (Original work published 2000)