IDEAS home Printed from https://ideas.repec.org/a/igg/jncr00/v9y2020i4p18-33.html
   My bibliography  Save this article

A Power-Efficient and Quantum-Resistant N-Bit Cryptography Algorithm

Author

Listed:
  • Rohini S. Hongal

    (B. V. Bhoomaraddi College of Engineering, India)

  • Rajashekar B. Shettar

    (B. V. Bhoomaraddi College of Engineering, India)

Abstract

With rapid technological advancements and enhanced network growth, security contends to play a crucial role. A powerful network security tends to point out diverse mixture of threats and intimidations and blocks them from creeping and getting circulated into the network to preserve the reliability, confidentiality, integrity, and accessibility of computer networks by annihilating illegitimate admittance and corruption of critical information. Secure hash algorithms (SHA) are cryptographic hash functions used to produce a hash value of fixed output bit sizes. In this paper, an algorithm is proposed to strengthen the cryptographic systems by using reversible logic to generate higher and variable hash values, making it difficult to trace the keys. The proposed scheme is simulated and verified using FPGA Virtex ML505 board, the analysis of power and time of which is carried out using Genus tool, proving it to be efficient in terms of power, gate usage, garbage, and quantum cost.

Suggested Citation

  • Rohini S. Hongal & Rajashekar B. Shettar, 2020. "A Power-Efficient and Quantum-Resistant N-Bit Cryptography Algorithm," International Journal of Natural Computing Research (IJNCR), IGI Global, vol. 9(4), pages 18-33, October.
  • Handle: RePEc:igg:jncr00:v:9:y:2020:i:4:p:18-33
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJNCR.2020100102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jncr00:v:9:y:2020:i:4:p:18-33. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.