Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 31 January 2009

Efficient Reversible Montgomery Multiplier and Its Application to Hardware Cryptography

Noor Muhammed Nayeem, Lafifa Jamal & Hafiz Md. Hasan Babu

Journal of Computer Science, Volume 5, Issue 1, pp. 49–56 · doi.org/10.3844/jcssp.2009.49.56

7,852 accesses5,964 downloads19 citations (Crossref)Metrics
Cite Check for updates

Abstract

Problem Statement: Arithmetic Logic Unit (ALU) of a crypto-processor and microchips leak information through power consumption. Although the cryptographic protocols are secured against mathematical attacks, the attackers can break the encryption by measuring the energy consumption. Approach: To thwart attacks, this study proposed the use of reversible logic for designing the ALU of a crypto-processor. Ideally, reversible circuits do not dissipate any energy. If reversible circuits are used, then the attacker would not be able to analyze the power consumption. In order to design the reversible ALU of a crypto-processor, reversible Carry Save Adder (CSA) using Modified TSG (MTSG) gates and architecture of Montgomery multiplier were proposed. For reversible implementation of Montgomery multiplier, efficient reversible multiplexers and sequential circuits such as reversible registers and shift registers were presented. Results: This study showed that modified designs perform better than the existing ones in terms of number of gates, number of garbage outputs and quantum cost. Lower bounds of the proposed designs were established by providing relevant theorems and lemmas. Conclusion: The application of reversible circuit is suitable to the field of hardware cryptography.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2009 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Nayeem, N. M., Jamal, L. & Babu, H. M. H. (2009). Efficient Reversible Montgomery Multiplier and Its Application to Hardware Cryptography . Journal of Computer Science, 5(1), 49–56. https://doi.org/10.3844/jcssp.2009.49.56

Licence
© Science Publications
Issue
Volume 5, Issue 1
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Efficient Reversible Montgomery Multiplier and Its Application to Hardware CryptographyJournal of Computer Science · Volume 5, Issue 1 · pp. 49–56 · © Science PublicationsDownload