Reversible circuit design for GCD computation in cryptography algorithms

Summary The implementation of cryptography algorithms is constantly observing threat from multiple techniques in breaking secure system. The current trend in breaking the secure system of cryptography is by power analysis technique. In order to break the secure key, the energy consumed in the digita...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of circuit theory and applications Ročník 45; číslo 2; s. 242 - 259
Hlavní autoři: Jayashree, H. V., Kotethota, Skanda, Agrawal, V. K.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Chichester, UK John Wiley & Sons, Ltd 01.02.2017
Wiley Subscription Services, Inc
Témata:
Algorithms
Architecture
Breaking
Circuit design
Computation
Cryptography
Design analysis
Design engineering
Fredkin
GCD
reversible
Toffoli
ISSN:0098-9886, 1097-007X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Summary The implementation of cryptography algorithms is constantly observing threat from multiple techniques in breaking secure system. The current trend in breaking the secure system of cryptography is by power analysis technique. In order to break the secure key, the energy consumed in the digital circuit during computation is measured. This technique is commonly known as differential power analysis, explored by the hackers to break the secure systems. To circumvent these type of attacks, it is necessary to explore different designs, which dissipate less energy. Ideally, reversible circuits dissipate zero energy. We present a new reversible architecture for greatest common divisor (GCD) computation using modified Binary GCD algorithm. We present the generalized design methodology of reversible GCD computation unit. We compare the proposed GCD computation design with the existing design. The proposed reversible GCD architecture takes less number of iterations compared with the existing GCD architecture in the literature. The proposed design outperforms the existing GCD design in terms of Quantum Cost, Gate Count, and Ancilla Inputs. Copyright © 2016 John Wiley & Sons, Ltd. We present a new generalized reversible architecture for GCD computation using modified Binary GCD algorithm. The proposed reversible GCD architecture takes less number of iterations and outperforms the existing GCD design in terms of Quantum Cost, Gate count, and Ancilla Inputs. Because the proposed design is optimized in terms of Gate count and reversible circuits are energy efficient, it is best suited to mitigate power analysis attack in cryptography hardware.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0098-9886
1097-007X
DOI:10.1002/cta.2293