Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
From Fixed-Length to Arbitrary-Length RSA Padding Schemes
| |
|
From Fixed-Length to Arbitrary-Length RSA Padding Schemes
Jean-Sébastien Coron5  , Francois Koeune6 and David Naccache7
| (5) |
Ecole Normale Supérieure, 45 rue d’Ulm, F-75005 Paris, France |
| (6) |
UCL Crypto Group, Bâtiment Maxwell, place du Levant 3, B-1348 Louvain-la-Neuve, Belgium |
| (7) |
Gemplus Card International, 34 rue Guynemer, F-92447 Issy-les-Moulineaux, France |
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.
Keywords Signature scheme - provable security - padding scheme
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|