Design and Implementation of Efficient Algorithm for Incremental Cryptography

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.