RSA shortcuts

Authors:
Adi Shamir
Affiliations:
Applied Math Department, The Weizmann Institute of Science, Rehovot, Israel
Venue:
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Year:
2003

Citing 4
Cited 1

A Digital Signature Based on a Conventional Encryption Function

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
On Optimal Hash Tree Traversal for Interval Time-Stamping

ISC '02 Proceedings of the 5th International Conference on Information Security
Secrecy, authentication, and public key systems.

Secrecy, authentication, and public key systems.
Almost optimal hash sequence traversal

FC'02 Proceedings of the 6th international conference on Financial cryptography

Real time hardware crypto cards based on DSP

IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For one choice of parameters, and a total of N leaves, our technique requires a worst-case computational effort of 2 logN / loglog N hash function evaluations per output, and a total storage capacity of less than 1.5 log2N/loglogN hash values. This is a simultaneous improvement both in space and time complexity over any previously published algorithm.