![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
Design and Implementation of Efficient Algorithm for Incremental Cryptography
Subscribe/Renew Journal
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.
User
Subscription
Login to verify subscription
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 196
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 5