Open Access Open Access  Restricted Access Subscription or Fee Access

Design and Implementation of Efficient Algorithm for Incremental Cryptography

V. Muthu Venkatakrishnan, Prasanth Kumar Thandra, R. Jehadeesan, S. Rajeswari, S.A.V. Satyamurty, P. Swaminathan

Abstract


Incremental Cryptography has gained much attention due to its incremental property, i.e., cryptographic primitives can be speedily computed from the previous output rather than re-computing it from the scratch. Incremental cryptography allows dynamic update of the cipher to reflect changes in the source document. The amount of work done in incremental technique will be proportional to the changes made in the document. The emanating function from this is parallelizable and can be used for hardware implementation. Functions using iterative constructions are inefficient and hence we propose a new approach that uses Pair Chaining & Modular Arithmetic Combining for efficient Cryptographic transformation and conjugate.

 


Keywords


Incrementality, Cryptography, Hash Function, Incremental Cryptography, Incremental Digital Signature

Full Text:

PDF

References


“Incremental cryptography: The case of Hashing and Signing” - M. Bellare, O. Goldreich and S. Goldwasser.

“Incremental cryptography with application to virus protection” - M. Bellare, O. Goldreich and S. Goldwasser.

“Incremental Unforgeable Encryption” - Enrico Buonanno, Jonathan Katz, Moti Yung.

“Handbook of Applied Cryptography" - A. Menezes, P. Van Oorschot and S. Vanstone, CRC Press, 1996.

“A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost” - Bellare, M., Micciancio, D, Advances in Cryptology – Proceedings of Eurocrypt’97.

Bellare M, Guerin R, Rogaway P. XOR MACs: new methods for message authentication using finite pseudorandom functions. In: Advances in cryptology – Crypto ’95. Lecture notes in computer science, vol. 963. Germany: Springer-Verlag; 1995b. p. 15–29.

Bellare M, Goldreich O, Goldwasser S. A new paradigm for collision-free hashing: incrementality at reduced cost. In: Advances in cryptology – Eurocrypt ’97. Lecture notes in computer science, vol. 1233. Germany: Springer-Verlag; 1997. p. 163–92.

Goi B-M, Siddiqi MU, Chuah H-T. An attack strategy for incremental hash function based on pair chaining & XOR combining. In: Proceedings of international conference on applied cryptography and network security (ACNS ’03), Industrial track; 2003a.


Refbacks

  • There are currently no refbacks.