Open AccessDesigning and implementing of improved cryptographic algorithm using modular arithmetic theory
Author(s) -
Mehrnoosh Kamarzarrin,
Seyed Ehsan Hosseini,
Mohammad Hadi Mehdi Zavareh,
Mohammad Kamarzarrin
Publication year - 2015
Publication title -
journal of electrical systems and information technology
Language(s) - English
Resource type - Journals
ISSN - 2314-7172
DOI - 10.1016/j.jesit.2015.03.002
Subject(s) - modular exponentiation , exponentiation , computer science , cryptography , modular arithmetic , public key cryptography , field programmable gate array , key (lock) , vhdl , key size , algorithm , embedded system , power analysis , arithmetic , computer engineering , encryption , theoretical computer science , computer security , mathematics , mathematical analysis
Maintaining the privacy and security of people information are two most important principles of electronic health plan. One of the methods of creating privacy and securing of information is using Public key cryptography system. In this paper, we compare two algorithms, Common And Fast Exponentiation algorithms, for enhancing the efficiency of public key cryptography. We express that a designed system by Fast Exponentiation Algorithm has high speed and performance but low power consumption and space occupied compared with Common Exponentiation algorithm. Although designed systems by Common Exponentiation algorithm have slower speed and lower performance, designing by this algorithm has less complexity, and easier designing compared with Fast Exponentiation algorithm. In this paper, we will try to examine and compare two different methods of exponentiation, also observe performance Impact of these two approaches in the form of hardware with VHDL language on FPGA