FAST RSA SIGNATURE VERIFICATION

An RSA message signature can be verified by verifying that se mod n=F(m, n). If a value K, defined as K=se div n is computed in advance and provided as an input to the computing device verifying the signature, the signature verification can be significantly faster. To avoid transmission of, and math...

Full description

Saved in:
Bibliographic Details
Main Author FERGUSON, NIELS
Format Patent
LanguageEnglish
French
German
Published 18.11.2009
Subjects
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
Online AccessGet full text

Cover

More Information
Summary:An RSA message signature can be verified by verifying that se mod n=F(m, n). If a value K, defined as K=se div n is computed in advance and provided as an input to the computing device verifying the signature, the signature verification can be significantly faster. To avoid transmission of, and mathematical operations on, large values of K, which can themselves be inefficient, the RSA public exponent e can be selected to be relatively small, such as e=2 or e=3. K is based on publicly available information and can be calculated by the computing device signing the message, or by an intermediate computing device, and transmitted to the device verifying the signature without impacting security.
Bibliography:Application Number: EP20070873642