IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Simulated Analysis and Enhancement of Blowfish Algorithmiosrjce
This paper represents or analyzes the security of system based on Blowfish. Blowfish mainly focuses
on the encrypt and decrypt techniques and algorithms apply for cryptanalysis. It describe the algorithms for
encryption as well as decryption algorithms and also give the sufficient description of key generation, key
expansion, function and working principle of Blowfish cipher with proper explanations. Taking the current era,
Most of the famous systems which offer security for a network or web or to a data are vulnerability to attacks and
they are broken at some point of time by effective cryptanalysis methods, irrespective of its complex algorithmic
design. In the general, today’s cryptography world is bounded to an interpretive of following any one or multi
encryption scheme and that too for a single iteration on a single file only. This is evident in the maximum of the
encryption-decryption cases. It also describes the comparisons between older blowfish and enhances blowfish. It
also shows enhance Blowfish algorithm for encryption and decryption of data. It is also give the proper simulated
analysis of encryption and decryption time for different file formats using a windows application. It describe
feature of application and its process and efficiency as well as calculation of time and throughput.
Enhancement of DES Algorithm with Multi State LogicIJORCS
The principal goal to design any encryption algorithm must be the security against unauthorized access or attacks. Data Encryption Standard algorithm is a symmetric key algorithm and it is used to secure the data. Enhanced DES algorithm works on increasing the key length or complex S-BOX design or increased the number of states in which the information is to be represented or combination of above criteria. By increasing the key length, the number of combinations for key will increase which is hard for the intruder to do the brute force attack. As the S-BOX design will become the complex there will be a good avalanche effect. As the number of states increases in which the information is represented, it is hard for the intruder to crack the actual information. Proposed algorithm replace the predefined XOR operation applied during the 16 round of the standard algorithm by a new operation called “Hash function” depends on using two keys. One key used in “F” function and another key consists of a combination of 16 states (0,1,2…13,14,15) instead of the ordinary 2 state key (0, 1). This replacement adds a new level of protection strength and more robustness against breaking methods.
hardware implementation of aes encryption and decryption for low area & low p...Kumar Goud
Abstract-An AES algorithm is implemented on FPGA platform to improve the safety of data in transmission. AES algorithms can be implemented on FPGA in order to speed data processing and reduce time for key generating. We achieve higher performance by maintaining standard speed and reliability with low area and power. The 128 bit AES algorithm is implements on a FPGA using VHDL language with help of Xilinx tool.
Hardware implementation of aes encryption and decryption for low area & power...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Design and Implementation A different Architectures of mixcolumn in FPGAVLSICS Design
This paper details Implementation of the Encryption algorithm AES under VHDL language In FPGA by using different architecture of mixcolumn. We then review this research investigates the AES algorithm in FPGA and the Very High Speed Integrated Circuit Hardware Description language (VHDL). Altera Quartus II software is used for simulation and optimization of the synthesizable VHDL code. The set of transformations of both Encryptions and decryption are simulated using an iterative design approach in order to optimize the hardware consumption. Altera Cyclone III Family devices are utilized for hardware evaluation.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Simulated Analysis and Enhancement of Blowfish Algorithmiosrjce
This paper represents or analyzes the security of system based on Blowfish. Blowfish mainly focuses
on the encrypt and decrypt techniques and algorithms apply for cryptanalysis. It describe the algorithms for
encryption as well as decryption algorithms and also give the sufficient description of key generation, key
expansion, function and working principle of Blowfish cipher with proper explanations. Taking the current era,
Most of the famous systems which offer security for a network or web or to a data are vulnerability to attacks and
they are broken at some point of time by effective cryptanalysis methods, irrespective of its complex algorithmic
design. In the general, today’s cryptography world is bounded to an interpretive of following any one or multi
encryption scheme and that too for a single iteration on a single file only. This is evident in the maximum of the
encryption-decryption cases. It also describes the comparisons between older blowfish and enhances blowfish. It
also shows enhance Blowfish algorithm for encryption and decryption of data. It is also give the proper simulated
analysis of encryption and decryption time for different file formats using a windows application. It describe
feature of application and its process and efficiency as well as calculation of time and throughput.
Enhancement of DES Algorithm with Multi State LogicIJORCS
The principal goal to design any encryption algorithm must be the security against unauthorized access or attacks. Data Encryption Standard algorithm is a symmetric key algorithm and it is used to secure the data. Enhanced DES algorithm works on increasing the key length or complex S-BOX design or increased the number of states in which the information is to be represented or combination of above criteria. By increasing the key length, the number of combinations for key will increase which is hard for the intruder to do the brute force attack. As the S-BOX design will become the complex there will be a good avalanche effect. As the number of states increases in which the information is represented, it is hard for the intruder to crack the actual information. Proposed algorithm replace the predefined XOR operation applied during the 16 round of the standard algorithm by a new operation called “Hash function” depends on using two keys. One key used in “F” function and another key consists of a combination of 16 states (0,1,2…13,14,15) instead of the ordinary 2 state key (0, 1). This replacement adds a new level of protection strength and more robustness against breaking methods.
hardware implementation of aes encryption and decryption for low area & low p...Kumar Goud
Abstract-An AES algorithm is implemented on FPGA platform to improve the safety of data in transmission. AES algorithms can be implemented on FPGA in order to speed data processing and reduce time for key generating. We achieve higher performance by maintaining standard speed and reliability with low area and power. The 128 bit AES algorithm is implements on a FPGA using VHDL language with help of Xilinx tool.
Hardware implementation of aes encryption and decryption for low area & power...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Design and Implementation A different Architectures of mixcolumn in FPGAVLSICS Design
This paper details Implementation of the Encryption algorithm AES under VHDL language In FPGA by using different architecture of mixcolumn. We then review this research investigates the AES algorithm in FPGA and the Very High Speed Integrated Circuit Hardware Description language (VHDL). Altera Quartus II software is used for simulation and optimization of the synthesizable VHDL code. The set of transformations of both Encryptions and decryption are simulated using an iterative design approach in order to optimize the hardware consumption. Altera Cyclone III Family devices are utilized for hardware evaluation.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
FPGA Implementation of an Area Optimized Architecture for 128 bit AES AlgorithmIJERA Editor
This paper aims at FPGA Implementation of an Area Optimized Architecture for 128 bit AES Algorithm. The
conventional designs use a separate module for 32 bit byte substitution and 128 bit byte substitution. The 32 bit
byte substitution is used in round key generation and the 128 bit byte substitution is used in the rounds. This
report presents a modified architecture of 128 bit byte substitution module using a single 32 bit byte substitution
module to reduce area.The AES encryption and decryption algorithm were designed using Verilog HDL. The
functionality of the modules were checked using ModelSim. The simulations were carried out in ModelSim and
Quartus II. The algorithm was implemented in FPGA and achieved a 2% reduction in the total logic element
utilization
A General Session Based Bit Level Block Encoding Technique Using Symmetric Ke...ijcseit
In this paper a session based symmetric key cryptographic algorithm has been proposed and it is termed as
Matrix Based Bit Permutation Technique (MBBPT). MBBPT consider the plain text (i.e. the input file) as a
binary bit stream with finite number bits. This input bit stream is divided into manageable-sized blocks with
different length. The bits of the each block fit diagonally upward starting from ( 1 , 1 ) cell in a left to right
trajectory into a square matrix of suitable order n. Then the bits are taken from the square matrix
diagonally upward starting from ( n , n ) cell in a right to left trajectory to form the encrypted binary string
and from this encrypted string cipher text is formed. Combination of the values of block length and the no.
of blocks of a session generates the session key. For decryption the cipher text is considered as a stream of
binary bits. After processing the session key information, this binary string is divided into blocks. The bits
of the each block fit diagonally upward starting from ( n , n ) cell in a right to left trajectory into a square
matrix of suitable order n. Then the bits are taken from the square matrix diagonally upward starting from
( 1 , 1 ) cell in a left to right trajectory to form the decrypted binary string . Plain text is regenerated from
this binary string. Comparison of MBBPT with existing and industrially accepted TDES and AES has been
done.
New modification on feistel DES algorithm based on multi-level keys IJECEIAES
The data encryption standard (DES) is one of the most common symmetric encryption algorithms, but it experiences many problems. For example, it uses only one function (XOR) in the encryption process, and the combination of data is finite because it occurs only twice and operates on bits. This paper presents a new modification of the DES to overcome these problems. This could be done through adding a new level of security by increasing the key space (using three keys) during the 16 rounds of the standard encryption algorithm and by replacing the predefined XOR operation with a new # operation. Our proposed algorithm uses three keys instead of one. The first key is the input key used for encrypting and decrypting operations. The second key is used for determining the number of bits, while the third key is used for determining the table numbers, which are from 0 to 255. Having evaluated the complexity of our proposed algorithm, the results show that it is the most complex compared with the well-known DES and other modified algorithms. Consequently, in our proposed algorithm, the attacker try a number of attempts 2 1173 at minimum to decrypt the message. This means that the proposed DES algorithm will increase the security level of the well-known DES.
The Advanced Encryption Standard (AES) is a specification for the encryption of electronic data also called Rijndael. The algorithm described by AES is a symmetric-key algorithm, meaning the same key is used for both encrypting and decrypting the data. Hardware-based cryptography is used for authentication of users and of software updates and installations. Software implementations can generally not be used for this, as the cryptographic keys are stored in the PC memory during execution, and are vulnerable to malicious codes. Hardware-based encryption products can also vary in the level of protection they provide against brute force rewind attacks, Offline parallel attacks, or other cryptanalysis attacks. The algorithm was implemented in FPGA due to its flexibility and reconfiguration capability. A reconfigurable device is very convenient for a cryptography algorithm since it allows cheap and quick alterations. The implementation of pipelined cryptography hardware was used to improve performance in order to achieve higher throughput and greater parallelism. The AES hardware was implemented in three modules contains of the encryption, the decryption and the key expansion module.
Minor Project- AES Implementation in VerilogHardik Manocha
This presentation described about the Minor project I worked on for partial fulfillment of Bachelors Degree in G B Pant Engineering College. Presentation consisted of Advanced Encryption Standard (AES) and its implementation in Verilog. Different steps of the algorithm are presented.
New Technique Using Multiple Symmetric keys for Multilevel EncryptionIJERA Editor
In a world of accelerating communications, cryptography has become an essential component of the modern
means of communication systems. The emergence of the webas a reliable medium for commerce and
communication has made cryptography an essential component. Many algorithms or ciphers are in use
nowadays. The quality of the cipher is judged byits ability to prevent an unrelated party fromknowingthe
original content of the encrypted message. The proposed “Multilevel Encryption Model” is a cryptosystem that
adopts the basic principles of cryptography. It uses five symmetric keys (multiple)
in floating point numbers, plaintext, substitution techniques and key combinations with unintelligible
sequence to produce the ciphertext. The decryption process is also designed to reproduce the plaintext
SECURITY EVALUATION OF LIGHT-WEIGHT BLOCK CIPHERS BY GPGPUacijjournal
Nowadays, general purpose graphical processing unit (GPGPU) has been used in many ares. We use it for
security evaluation of light-weight block ciphers. Light-weight block cipher is one of key technologies for
small communication devices such as sensor network. To design a light-weight block cipher whose fastness
and security are balanced, so that, its security margin should be evaluated exactly. One of security evaluation
method, we focus on integral attack which exploits integral distinguisher to recover some round keys.
Integral distinguisher is the main factor of integral attack, and it can be obtained by computer experiment.
We use GPGPU to accelerate computer experiment. We propose an algorithm to search for upper bound of
integral distinguisher by GPGPU. There are theoretical and experimental steps. We specify lower order
integral distinguisher from upper bound one in the theoretical step. Such integral distinguisher is tested by
computer experiment in the experimental step. By applying the proposal algorithm to HIGHT, TWINE,
LBlock, PRESENT and RECTANGLE, we obtain more advantageous results.
A New hybrid method in watermarking using DCT and AESIJERD Editor
In this paper I'm trying to make a combination between the encryption by using one of the most
powerful algorithm called Advanced Encryption Standard (AES) to encrypt a secret message another word logo
and then embed it in the digital image in frequency domain by using the Discrete Cosine Transform (DCT) in
low frequency to increase the robustness and then applying some attacks to check it.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
International Journal of Engineering Research and Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
FPGA Implementation of an Area Optimized Architecture for 128 bit AES AlgorithmIJERA Editor
This paper aims at FPGA Implementation of an Area Optimized Architecture for 128 bit AES Algorithm. The
conventional designs use a separate module for 32 bit byte substitution and 128 bit byte substitution. The 32 bit
byte substitution is used in round key generation and the 128 bit byte substitution is used in the rounds. This
report presents a modified architecture of 128 bit byte substitution module using a single 32 bit byte substitution
module to reduce area.The AES encryption and decryption algorithm were designed using Verilog HDL. The
functionality of the modules were checked using ModelSim. The simulations were carried out in ModelSim and
Quartus II. The algorithm was implemented in FPGA and achieved a 2% reduction in the total logic element
utilization
A General Session Based Bit Level Block Encoding Technique Using Symmetric Ke...ijcseit
In this paper a session based symmetric key cryptographic algorithm has been proposed and it is termed as
Matrix Based Bit Permutation Technique (MBBPT). MBBPT consider the plain text (i.e. the input file) as a
binary bit stream with finite number bits. This input bit stream is divided into manageable-sized blocks with
different length. The bits of the each block fit diagonally upward starting from ( 1 , 1 ) cell in a left to right
trajectory into a square matrix of suitable order n. Then the bits are taken from the square matrix
diagonally upward starting from ( n , n ) cell in a right to left trajectory to form the encrypted binary string
and from this encrypted string cipher text is formed. Combination of the values of block length and the no.
of blocks of a session generates the session key. For decryption the cipher text is considered as a stream of
binary bits. After processing the session key information, this binary string is divided into blocks. The bits
of the each block fit diagonally upward starting from ( n , n ) cell in a right to left trajectory into a square
matrix of suitable order n. Then the bits are taken from the square matrix diagonally upward starting from
( 1 , 1 ) cell in a left to right trajectory to form the decrypted binary string . Plain text is regenerated from
this binary string. Comparison of MBBPT with existing and industrially accepted TDES and AES has been
done.
New modification on feistel DES algorithm based on multi-level keys IJECEIAES
The data encryption standard (DES) is one of the most common symmetric encryption algorithms, but it experiences many problems. For example, it uses only one function (XOR) in the encryption process, and the combination of data is finite because it occurs only twice and operates on bits. This paper presents a new modification of the DES to overcome these problems. This could be done through adding a new level of security by increasing the key space (using three keys) during the 16 rounds of the standard encryption algorithm and by replacing the predefined XOR operation with a new # operation. Our proposed algorithm uses three keys instead of one. The first key is the input key used for encrypting and decrypting operations. The second key is used for determining the number of bits, while the third key is used for determining the table numbers, which are from 0 to 255. Having evaluated the complexity of our proposed algorithm, the results show that it is the most complex compared with the well-known DES and other modified algorithms. Consequently, in our proposed algorithm, the attacker try a number of attempts 2 1173 at minimum to decrypt the message. This means that the proposed DES algorithm will increase the security level of the well-known DES.
The Advanced Encryption Standard (AES) is a specification for the encryption of electronic data also called Rijndael. The algorithm described by AES is a symmetric-key algorithm, meaning the same key is used for both encrypting and decrypting the data. Hardware-based cryptography is used for authentication of users and of software updates and installations. Software implementations can generally not be used for this, as the cryptographic keys are stored in the PC memory during execution, and are vulnerable to malicious codes. Hardware-based encryption products can also vary in the level of protection they provide against brute force rewind attacks, Offline parallel attacks, or other cryptanalysis attacks. The algorithm was implemented in FPGA due to its flexibility and reconfiguration capability. A reconfigurable device is very convenient for a cryptography algorithm since it allows cheap and quick alterations. The implementation of pipelined cryptography hardware was used to improve performance in order to achieve higher throughput and greater parallelism. The AES hardware was implemented in three modules contains of the encryption, the decryption and the key expansion module.
Minor Project- AES Implementation in VerilogHardik Manocha
This presentation described about the Minor project I worked on for partial fulfillment of Bachelors Degree in G B Pant Engineering College. Presentation consisted of Advanced Encryption Standard (AES) and its implementation in Verilog. Different steps of the algorithm are presented.
New Technique Using Multiple Symmetric keys for Multilevel EncryptionIJERA Editor
In a world of accelerating communications, cryptography has become an essential component of the modern
means of communication systems. The emergence of the webas a reliable medium for commerce and
communication has made cryptography an essential component. Many algorithms or ciphers are in use
nowadays. The quality of the cipher is judged byits ability to prevent an unrelated party fromknowingthe
original content of the encrypted message. The proposed “Multilevel Encryption Model” is a cryptosystem that
adopts the basic principles of cryptography. It uses five symmetric keys (multiple)
in floating point numbers, plaintext, substitution techniques and key combinations with unintelligible
sequence to produce the ciphertext. The decryption process is also designed to reproduce the plaintext
SECURITY EVALUATION OF LIGHT-WEIGHT BLOCK CIPHERS BY GPGPUacijjournal
Nowadays, general purpose graphical processing unit (GPGPU) has been used in many ares. We use it for
security evaluation of light-weight block ciphers. Light-weight block cipher is one of key technologies for
small communication devices such as sensor network. To design a light-weight block cipher whose fastness
and security are balanced, so that, its security margin should be evaluated exactly. One of security evaluation
method, we focus on integral attack which exploits integral distinguisher to recover some round keys.
Integral distinguisher is the main factor of integral attack, and it can be obtained by computer experiment.
We use GPGPU to accelerate computer experiment. We propose an algorithm to search for upper bound of
integral distinguisher by GPGPU. There are theoretical and experimental steps. We specify lower order
integral distinguisher from upper bound one in the theoretical step. Such integral distinguisher is tested by
computer experiment in the experimental step. By applying the proposal algorithm to HIGHT, TWINE,
LBlock, PRESENT and RECTANGLE, we obtain more advantageous results.
A New hybrid method in watermarking using DCT and AESIJERD Editor
In this paper I'm trying to make a combination between the encryption by using one of the most
powerful algorithm called Advanced Encryption Standard (AES) to encrypt a secret message another word logo
and then embed it in the digital image in frequency domain by using the Discrete Cosine Transform (DCT) in
low frequency to increase the robustness and then applying some attacks to check it.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
With increasing technology development in field of communication and Electronic devices, there is a need for better security service for information transfer in Medical Sectors, Banking, Financial and in other IoT applications etc. Fight against security attacks is of prime importance. Through Cryptographic techniques we can provide Authenticity as well as Confidentiality for the user data. In this paper, hardware implementation has been described for a real-time application of speech data encryption and decryption using AES algorithm along with the speech recognition using cross correlation technique. Verilog programming environment is used for AES cryptography whereas MATLAB is used for Speech recognition. ASIC design on AES core is implemented using Cadence tools. Number of gates, area and power used by AES core design has been drastically reduced by specifying wide range of constraints during front end designing. In Backend designing, layout of AES design, which is the physical geometric representation is also developed.
IMPLEMENTATION OF AES AS A CUSTOM HARDWARE USING NIOS II PROCESSORacijjournal
In this paper Advanced Encryption Standard (AES) algorithm has been designed and implemented as custom hardware. The algorithm is controlled through C-code written in NIOS II IDE. AES as a custom hardware is interfaced with the system designed around NIOS II Processor using SOPC builder tool. AES is written in hardware in VHDL language and the interface is through GPIO (General Purpose Input / Output Port). AES implemented using data size of 128 bits, while the length of the key used is of 128 bits. The key size of AES used is of 128 bits, as it is secure from the different attacks in existence. The FPGA used is CYCLONE II from Altera. AES as a custom hardware increases the speed of encryption and serves as an accelerator and hence improves the performance of the system.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Presently on a daily basis sharing the information over web is becoming a significant issue due to security problems. Thus lots of techniques are needed to protect the shared info in academic degree unsecured channel. The present work target cryptography to secure the data whereas causing inside the network. Encryption has come up as a solution, and plays an awfully necessary role in data security. This security mechanism uses some algorithms to scramble info into unclear text which can be exclusively being decrypted by party those possesses the associated key. This paper is expounded the varied forms of algorithmic rule for encryption & decryption: DES, AES, RSA, and Blowfish. It helps to hunt out the best algorithmic rule.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
An Efficient FPGA Implementation of the Advanced Encryption Standard Algorithmijsrd.com
A proposed FPGA-based implementation of the Advanced Encryption Standard (AES) algorithm is presented in this paper. This implementation is compared with other works to show the efficiency. The design uses an iterative looping approach with block and key size of 128 bits, lookup table implementation of S -box. This gives low complexity architecture and easily achieves low latency as well as high throughput. Simulation results, performance results are presented and compared with previous reported designs.
Design And Implementation Of Tiny Encryption AlgorithmIJERA Editor
Over the recent years, several smart applications like RFID‟s, sensor networks, including industrial systems, critical infrastructures, private and public spaces as well as portable and wearable applications in which highly constrained devices are interconnected, typically communicating wirelessly with one another, working in concert to accomplish some task. Advanced safety and security mechanisms can be very important in all of these areas. Light weight cryptography enables secure and efficient communication between networked smart objects. This proposed system focuses on the FPGA implementation of light weight cryptographic algorithm Tiny Encryption Algorithm TEA to adapt with many real time constraints such as memory, data loss and low cost. The proposed scheme uses Linear Feedback Shift Register to generate the random key making it more secure for sensitive information transfer in many real-time applications. In this study,operation of this cryptosystem is analyzed by implementing the cryptographic algorithm TEA with the key generation unit in FPGA Spartan 3E. We have also compared the results with the IDEA.
Comparison of AES and DES Algorithms Implemented on Virtex-6 FPGA and Microbl...IJECEIAES
Encryption algorithms play a dominant role in preventing unauthorized access to important data. This paper focus on the implementations of Data Encryption Standard (DES) and Advanced Encryption Standard (AES) algorithms on Microblaze soft core Processor and also their implementations on XC6VLX240t FPGA using Verilog Hardware Description language. This paper also gives a comparison of the issues related to the hardware and software implementations of the two cryptographic algorithms.
Hardware Implementations of RS Decoding Algorithm for Multi-Gb/s Communicatio...RSIS International
In this paper, we have designed the VLSI hardware for a novel RS decoding algorithm suitable for Multi-Gb/s Communication Systems. Through this paper we show that the performance benefit of the algorithm is truly witnessed when implemented in hardware thus avoiding the extra processing time of Fetch-Decode-Execute cycle of traditional microprocessor based computing systems. The new algorithm with less time complexity combined with its application specific hardware implementation makes it suitable for high speed real-time systems with hard timing constraints. The design is implemented as a digital hardware using VHDL
Novel Adaptive Hold Logic Circuit for the Multiplier using Add Round Key and ...IJMTST Journal
Digital multipliers are among the most critical arithmetic functional units in many applications, such as the Fourier transform, discrete cosine transforms, and digital filtering. The through put of these applications depends on multipliers, if the multipliers are too slow, the performance of entire circuits will be reduced. The negative bias temperature instability effect occurs when a PMOS transistor is under negative bias (Vgs = −Vdd), increasing the threshold voltage of a PMOS transistor and reducing the multiplier speed. Similarly, positive bias temperature instability occurs when an NMOS transistor is under positive bias. Both effects degrade the speed of the transistor and in the long term, the system may be fail due to timing violations. Therefore, it is required to design reliable high-performance multipliers. In this paper, we implement an aging aware multiplier design with a novel adaptive hold logic (AHL) circuit. The multiplier is able to provide the higher throughput through the variable latency and can adjust the adaptive hold logic (AHL) circuit to lessen performance degradation that is due to the aging effect. The proposed design can be applied to the column bypass multiplier.
Arm recognition encryption by using aes algorithmeSAT Journals
Abstract To provide the security of the Military confidential data we use encryption algorithm which take over reward of superior encryption algorithm. The proposed implementation using encryption algorithm was implemented on ARM 7 to encrypt and decrypt the confidential data on data storage devices such as SD card or Pen drive. The main objective of proposed implementation is to provide protection for storage devices. The ARM and encryption algorithm protect the data accessibility, reliability and privacy successfully. Since (AES) Advanced Encryption Standard algorithm is widely used in an embedded system or fixed organization. These AES algorithms are used for proper designs in defense for security. Keywords: Plain text, Cipher text, Data security, AES, Embedded System.ARM, storage device.
FPGA Implementation of SubByte & Inverse SubByte for AES Algorithmijsrd.com
Advanced encryption standard was accepted as a Federal Information Processing Standard (FIPS) standard. In traditional look up table (LUT) approaches, the unbreakable delay is longer than the total delay of the rest of operations in each round. LUT approach consumes a large area. It is more efficient to apply composite field arithmetic in the SubBytes transformation of the AES algorithm. It not only reduces the complexity but also enables deep sub pipelining such that higher speed can be achieved. Isomorphic mapping can be employed to convert GF(28) to GF(22)2)2) ,so that multiplicative inverse can be easily obtained. SubBytes and InvSubBytes transformations are merged using composite field arithmetic. It is most important responsible for the implementation of low cost and high throughput AES architecture. As compared to the typical ROM based lookup table, the presented implementation is both capable of higher speeds since it can be pipelined and small in terms of area occupancy (137/1290 slices on a Spartan III XCS200-5FPGA).
FPGA Implementation of SubByte & Inverse SubByte for AES Algorithm
Js2517181724
1. M. Lalitha Sowmya, B.Divya, S.Jagadeesh / International Journal of Engineering Research
and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 5, September- October 2012, pp.1718-1724
Design of Custom Instructions in Cryptographic Processor
M. Lalitha Sowmya1, B.Divya2, S.Jagadeesh3
(Assistant Professor, Department of ECE, SSJ Engineering College, JNTU , Gandipet.)
(MTech Student, Department of ECE, SSJ Engineering College, JNTU, Gandipet.)
(Associate Professor and H.O.D, Department of ECE, SSJ Engineering College, JNTU, Gandipet.)
Abstract
In this paper, we are implementing 32 Implementing various symmetric-Key operations in
bit pipelined processor on FPGA and designed a general-purpose Processor (GPP) is flexible but
using verilog. In this Processor , we had requires a lower throughput rate, more clock cycles
performed logical operations and arithmetic for each instruction, more no. of addressing modes
operations like rotate word, modular addition and larger power Consumption.
modular multiplication, matrix multiplication, So we developed processor that the
fixed coefficient multiplier ,mix column instruction set can be hardwired to speed instruction
transform using binary extension field operations execution. No microcode is needed for single cycle
(2^m) for arbitrary irreducible Polynomial. execution. All instructions are one word (fixed bit)
Using our proposed field arithmetic units we in length. This simplifies the instruction fetch
can implement Symmetric Key Cryptography mechanism since the location of instruction
algorithms . Experimental Results Shows that boundaries is not a function of the instruction type.
developed processor working with high Speed , The processor has small number of addressing
low area and low path delay . modes. Only load and store instructions access
memory. There are no computational instructions
Keywords: Cryptographic Processor, Pipeline, that access memory; load/store instructions operate
Finite field arithmetic (FFA), Symmetric Key between memory and a register. Control hardware is
Cryptography algorithms. simplified and the machine cycle time is minimized.
1. Introduction The remainder of this paper is organized as
The explosive growth in data follows. Section 2: Algorithms of Symmetric Key
communications and Internet services have made operations. Section 3: Implementation of
cryptography an important research topic. Operations. Section 4 Proposed Architecture.
Cryptography is used for confidentiality, Section 5: Modules design of ALU, Control unit,
authentication, data integrity, and non-repudiation, Multiplexers and general purpose registers. Section
which can be divided into two families: 6. Results. Section7: Conclusion Section 8:
Asymmetric key cryptography: In public key References.
cryptography, the data that is encrypted with the
public key can only be decrypted with the 2. Cryptographic algorithms for symmetric
corresponding private key. block ciphers.
Symmetric key cryptography: The process of
encryption and decryption of information by using a Advanced Encryption Standard (AES),
single key is known as Symmetric Key RC6, RC5, Data Encryption Standard (DES),
Cryptography. These are based on a mathematical Blowfish, International Data Encryption Algorithm
function to encrypt a plain-text message and to (IDEA).
produce cipher message. [8]
In this Paper we are designing Symmetric Blowfish is a symmetric block cipher that
key mathematical operations in a 32 bit pipelined encrypts data in 8-byte (64-bit) blocks [3]. The
processor. algorithm has two parts, key expansion and data
Implementing Symmetric Key operations encryption. Key expansion consists of
in software seems to not only too slow for fast generating the initial contents of one array
application such as Routers but also vulnerable to Namely, eighteen 32-bit sub-keys, and four arrays
attacks. In contrast, in Hardware implementation, (the S-boxes), each of size 256 by 32 bits, from a
the higher data rate (G bits/second) is made possible key of at most 448 bits (56 bytes). The data
by parallel and/or pipelining processing. Moreover, encryption uses a 16-round Feistel Network .The F
the implementations are physically Function, regarded as the
Secure since tempering by an outside attacker is Primary source of algorithm security [3],
Difficult. With these supporting reasons we are combines two simple functions: Addition modulo
looking at the hardware implementation. two (XOR) and Addition modulo 2^32.
1718 | P a g e
2. M. Lalitha Sowmya, B.Divya, S.Jagadeesh / International Journal of Engineering Research
and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 5, September- October 2012, pp.1718-1724
AES [2] is a block cipher developed in effort to operations in parallel wherever possible. Parallelism
address threatened key size of Data Encryption in operations can be achieved both in software and
Standard (DES).It allows the data length of 128, 192 using hardware.
and 256 bits, and supporting three different key
lengths, 128, 192, and 256 bits. AES can be divided 3. Implementation of Algorithm operations.
into four basic operation blocks where data are
treated at either byte or bit level. The array of bytes 3.1 Modular Addition Two.
organized as a 4×4 matrix is also called "state" and The addition of two elements in a finite
those four basic steps;, Bytes Sub Shift Row or field is achieved by “adding” the coefficients for the
Rotate Word, Matrix Multiplication, Mix corresponding powers in the polynomials for the
Column, and AddRoundKey are also known as two elements. The addition is
layers. These four layer steps describe one round of Performed with the XOR operation (denoted by )
the AES. The number of rounds is depended on the i.e., modulo 2 -so that 1 1 = 0, 1 0 = 1, and 0
key length, i.e., 10, 12 and 14 rounds for the key 0 = 0.
length of 128, 192 and 256 bits respectively.
Require: Binary Polynomials a (z), b (z) with
RC5 is exactly designated as RC5-w/r/b, maximum degree m-1.
where the variable parameters w, r, and b Ensure: c (z) =a (z) + b (z).
respectively denote the Word size (in bits), the 1: for i from 0 to M-1 do
number of rounds, and the length of secret key (in 2: C[i] A[i] B[i].
bytes). The allowable value of w is 16, 32 and 64; 3: end for
the allowable values of r and b range from 0 to 255. 4: Return(c).
The parameter of RC5-32/12/16 is commonly
chosen there are three routines in RC5: key 3.2 .Modular Multiplication 2^8
expansion, encryption, and decryption. These In the polynomial representation,
routines consist of three primitive operations (and multiplication in GF 2^8 (denoted by •) corresponds
their inverse): words addition , bitwise XOR, with the multiplication of polynomials modulo an
and data-dependent left rotation of x by y irreducible polynomial of degree 8. A polynomial
denoted by x <<< y. Note that only the log2(w) is irreducible if its only divisors are one and itself.
low order bits of y affect this rotation. In the For the AES algorithm, this irreducible polynomial
key-expansion routine, the user provided secret key is
is expanded to fill a key table whose size depends m(x) = x8.
on the number of rounds. The key table is then used
in both encryption and decryption. . For Example,{57}.{83}={C1},because
RC6 [7] is a symmetric-key algorithm (x6 + x + x2 +x +1) (x 7 + x + 1) =
which encrypts 128-bit plaintext blocks to 128-bit
cipher text blocks. The encryption process involves x 13 + x11 + x9 + x8 + x7 + x7 + x 5+ x 3 +x 2 + x +
W
four operations: Integer addition modulo 2 , x 6+ x 4+ x 2 + x + 1 =
Bitwise exclusive or of two w-bit words,. Rotation x 13+ x 11+ x 9 + x8 + x 6 + x 5 + x 4 + x 3 + 1.
to the left, and And
W x 13+ x 11+ x 9 + x8 + x 6 + x 5 + x 4 + x 3 + 1 modulo
f(X) = (X(2X + 1)) mod 2 . x 8..
In Prime Field operations modulo means divide it
IDEA [8] algorithm of the encryption requires more time .so in binary field operation it
process, we provide the original (128bits) cipher key requires less time with simple addition.
to the mentioned unit. When necessary, the Key x 13+ x 11+ x 9 + x8 + x 6 + x 5 + x 4 + x 3 + 1 x 8..
Generator Unit produces different sub-keys by 6 5 4
= x + x + x + x + 1. 3
performing circular left shift operation (by 25bits)
{101011011110} {0000010000000} =
on the current key and provides the sub-keys to
{111101}.
other units. The unit named as “Multiplication
modulo 216 + 1”, is used to perform all the
3.3 .Mix Columns () Transformation.
multiplication modulo 2^16+1 operation, when
The Mix column () Transformation
required. The same is for unit
operates on the state column-by-column as a four-
“Addition modulo 2^16” and unit “Bitwise
term polynomial .The columns are considered as
XOR”. or the parallel implementation of IDEA
polynomials over GF(2^8) and multiplied modulo
algorithm, the entire encryption process can be
x^4 + 1 with a fixed polynomial a(x), given by a(x)
performed in several steps and performing 3 2
= {03}x + {01}x + {01}x + {02} .
1719 | P a g e
3. M. Lalitha Sowmya, B.Divya, S.Jagadeesh / International Journal of Engineering Research
and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 5, September- October 2012, pp.1718-1724
3.5. Fixed Coefficients Multiplier.
Let Si, c = B(x) be an element to be multiplied. B(x)
can also be written in the polynomial form as;
B (x ) = b0 + b1x + b 2 x 2 + b 3 x3 + b4 x4
b 5 x 5 + b 6 x 6 + b 7 x7 (Eq 3.5.1)
Where b € (0,1).
Fig 1: Mix Column Transform. Multiplications used in the Mix Column
transformation are {03}.B( x) = ( x+1 )B( x ) and
To derive a suitable Mix Column transform {02}.B( x ) = x.B ( x ).
architecture, the trans formation matrix given in The resulted multiplications are:
Fig can be rewritten as s’(x) =s(x) .a(x)mod(x4 + 1),,
where • denotes finite field polynomial {03}.B (x ) = (b0 b7 ) + (b0 b1)x + (b1 b2) x 2
multiplication i.e., + (b2 b3 )x3 + (b3 b4) x 4 + (b4 b5 ) x 5 +
(b5 b6) x 6 + (b6 b7 ) x 7. (Eq: 3.5.2)
{02}.B(x) = b7 + (b0) x + b 1 x 2 + b 2 x3 + b3 x 4
+ b 4 x 5 + b 5x 6 +b6 x7 (Eq 3.5.3)
Implementations of above equations are
simple since Additions are simply XORs. As an
example the circuit to Compute x.Bi is shown in
As a result of this multiplication, the four bytes in a Fig (3) below. The implementation of (x + 1) Bi
column are replaced by the following. shown in Fig (4). Can be done similarly. According
to terms given in (2), and an architecture shown in
S10,c = ( {02} .So,c) ({03} .S1,c) S2,c S3,c Fig.(4) , the maximum delay time is expected to be
1
S 1,c = So,c ({02} .S1,c) ({03} .S2,c ) S3,c that of the a delay unit of a 2-input XOR gate.
S12,c = .So,c S1,c ({02} . S2,c ) ({03} .S3,c)
S13,c = ({03} .So,c) .S1,c S2,c ({02}.S3,c)
Fig .2 Mix Columns Transform Architecture Fig 3: A×2 Fixed Coefficient Multiplier.
There are many ways to implement a finite
field multiplier. An originally proposed one in the
AES takes the form of XTime ( ) which is
essentially multiplied by x or left-shift with {1B}
feedback. That could imply either a bit-serial or a
bit-parallel architecture. Rudra [3] proposed the
implementation of Rijndael system with composite
field arithmetic. We are considering a fast
multiplier, simple, small area, and support pipeline
architecture (if needed). Notice of the fix-value
multiplications (by {02} or by {03}) leads us to a
fixed-coefficient multiplication in GF (2^8) that
fulfils our requirements. We are investigating this
multiplier... Fig 4: A×3 Fixed Coefficient Multiplier.
1720 | P a g e
4. M. Lalitha Sowmya, B.Divya, S.Jagadeesh / International Journal of Engineering Research
and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 5, September- October 2012, pp.1718-1724
In this processor we are performing various
3.6 Multiplier X (2X + 1) Modulo 2^8. operations of cryptography so we called as
cryptography processor.
Let,
X = b0 + b1x + b 2 x 2 + b 3 x3 + b4 x4
b 5 x 5 + b 6 x 6 + b 7 x7 . (Eq 3.6.1)
Now,
{02}.B(x) + 1 = (b7+ 1) + (b0) x + b 1 x 2 + b 2 x3 +
b3 x4 + b 4 x 5 + b 5x 6 + b6 x7 (Eq 3.6.2)
x. ({02}.x + 1} mod 28 = x. ({02}. {x} +1) x8
(Eq 3.6.3)
Eq (3.6.3), operation requires less time to implement
Rc6 Algorithm.
3.7 Shift Row Transform.
Fig 6. Cryptography Processor Architecture.
In the Shift Rows() transformation, the
bytes in the last three rows of the State are 4.1 Instruction Set.
cyclically shifted over For a complete design, it was necessary to
Different numbers of bytes. create a specific instruction set and its own
assembly code with its proper instruction format.
The Instructions are classified into two groups.
•Data Manipulation (Load and Storage).
• Operations (Arithmetic and Logical).
The Logical operations like Shift Left,
Shift Right, and Rotate Word Which requires only
one Source Register. Shown in Type 3.
The Arithmetic Operations like addition ,modular
functions ,etc to execute these operations we
requires two source registers and to tore result in
destination register. Shown in Type 2.
The Load instructions and store instructions
Requires address from different data sources shown
Fig 5. Shift Rows Architecture.
in Type 1.
Table 1 describes complete Instruction set.
4. Cryptography Processor. Each Instruction having its own Opcode.As the
complete set contains 13 instructions; 4 bits are
The architecture of an 32 bit processor is enough to represent them.
shown in Fig 6. The processor [1] is designed with
Table:1 Instruction Set Of The Developed
load/store architecture. Separate memory for
Processor.
instructions (program) and data Different stages
of the pipeline perform simultaneous Accesses to
memory. This Harvard style of architecture can
Either be used with two completely different
memory Spaces, a single dual-port memory space
with separate data and instruction.. Three stages of
pipelining have been incorporated in the design
which increases the speed of operation.
The processor presented instruction set and uses a
Single Instruction – Single Data (SISD) execution
order. Its main characteristics are:
• Sixteen 32-bit general purpose registers.
•ALU with basic arithmetic and logical operations.
1721 | P a g e
5. M. Lalitha Sowmya, B.Divya, S.Jagadeesh / International Journal of Engineering Research
and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 5, September- October 2012, pp.1718-1724
Type1. 5.2 General Purpose Registers.
General Purpose Registers (GPRs) store
31 29 2524 2019 1615 0 and save operands And results during program
execution. ALU and memories must be able to
write/read those registers, so a set of Sixteen 32-bit
Type2. registers were used, along with multiplexers and
control& decoder which register is read or written.
31 29 2524 2019 1615 0 These two registers are the Operands to ALU which
performs the operation.
Type3.
31 29 2524 2019 1615 0
5. Modules Design of Architecture.
5.1 Control Unit.
The control unit design is based on using
FSM (Finite State Machine) and we designed it in a
way that allows each state to run at one clock cycle,
the first state is the reset which is initializes the CPU
internal registers and variables. The machine goes to Fig 9: Simulated Timing diagram of General
the reset state by enabling the reset signal for a Purpose Registers.
certain number of clocks. Following the reset state
Would be the instruction fetching and decoding 5.3 Instruction Register.
states which will enable the appropriate signals for Instruction registers store the instruction
reading instruction data from the ROM then which read from the program memory, and keep it
decoding the parts of the instruction. The decoding as an output for the decoder, which separates the
state will also select the next state depending on the operation code, Source Registers, Operand address
instruction, since every instruction has its own set of and operands and these values will set to General
states, the control unit will jump to the correct state purpose registers, Multiplexers and ALU to execute
based on the instruction given. After all states of a the command. This is achieved simply using buffers
running instruction are finished, the last one will to translate data to/from the processor.
return to the fetch state which will allow us to
process the next instruction in the program. Fig7:
shows the state diagram for the control unit.
Fig 7. State Diagram of Control Unit.
Fig 10: Simulated Timing diagram of Instruction
Register
5.4 Arithmetic logical unit (ALU).
The Arithmetic-Logic Unit has 12
operations; each one of them was created and
converted into a symbol, then, a multiplexor was
placed in order to obtain a 4 bit selector
The ALU design comprises of 2 units. One unit is
meant for logic operation and the other unit is
Fig 8: Top Block of Control and Decode. meant f or Arithmetic operations shown in Table .1.
1722 | P a g e
6. M. Lalitha Sowmya, B.Divya, S.Jagadeesh / International Journal of Engineering Research
and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 5, September- October 2012, pp.1718-1724
including the Active HDL simulator and synthesized
with the Xilinx 9.2i tool;
After synthesized the Hardware resource
consumption for the complete processor
implemented in a Xilinx Virtex4 XC4VlX15-
12Sf363 FPGA is shown in Table 2, The number of
slice flip flops utilization is minimal due to the
combinational nature of the processor being capable
of executing an instruction in few clock cycles.
Table 2: Hardware Resource Consumed
For complete processor the total
equivalent gate count for the complete processor is
14,518 gates , Maximum combinational path delay
Fig 11: Top Block of ALU is 6.509ns Maximum Frequency : 92.659MHz ,
the area utilized only 13%.
7. Conclusion.
Thus the 32 bit cryptographic Processor
perform mathematical computations used in
Symmetric Key Algorithms has been designed using
verilog the simulations are done with Active HDL
simulator. The design is verified through exhaustive
Fig 12: Simulated Timing diagram of ALU simulations. Thus processor architecture follows
. that one instruction executes in one clock cycle. By
this we increase overall performance of the speed
with low area and low propagation delay. In order to
obtain a more sophisticated architecture is necessary
to add some advanced techniques pipelining this
processor can also perform floating point operations.
And differential equations. Apart from this it can be
used in portable gaming kits, Smart cards, ATMs.
References.
[1] Antonio H. Zavala “RISC Based
Architecture for Computer Hardware
Introduction Edición,, 2011 IEEE.
[2] NIST, "Advanced Encryption Standard
(AES), (FIPPUB 197)", November 26,
2001, http://csrc.nist.gov/publications/.
[3] A. Rudra et. al., "Efficient Implementation
of Rijndael Encryption with Composite
Field Arithmetic", Proc.CHES2001, LNCS
Vol. 2162, pp.175-188, 2001.
[4] Rohit Sharma, Vivek Kumar Sehgal, Nitin
Fig 13: Top Block of 32 Bit Processor. Nitin1, Pranav Bhasker, Ishita Verma,
2009, “Design And Implementation Of 64-
Bit RISC Processor Using Computer
6. Results:
Modeling And Simulation, pp. 568 – 573.
The ISE of the 32 bit processor was
[5] R. Uma / International Journal of
described using the Verilog .The tool chain
Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
1723 | P a g e
7. M. Lalitha Sowmya, B.Divya, S.Jagadeesh / International Journal of Engineering Research
and Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 5, September- October 2012, pp.1718-1724
Vol. 2, Issue 2, Mar-Apr 2012, pp.053-058
Design and Performance Analysis of 8-bit
RISC Processor using Xilinx Tool
[6] IEEE TRANSACTIONS on very large
scale integration (VLSI) systems, vol. 18,
No 8, August 2010 1145 A High-
Performance Unified-Field Reconfigurable
Cryptographic Processor Jun-Hong Chen,
Ming-Der Shieh, Member, IEEE, and Wen-
Ching Lin.
[7] FPGA Implementations of the RC6 Block
Cipher Jean-Luc Beuchat Laboratoire de
l’Informatique du arall´elisme, Ecole
Normale Sup´erieure de Lyon,46, All´ee
d’Italie, F–69364 Lyon Cedex 07,Jean-
Luc.Beuchat@ens-lyon.fr.
[8] Some Guidelines for Implementing
Symmetric-Key Cryptosystems on
Reconfigurable-Hardware Arturo ³az-
P¶erez, Nazar A. Saqib, and Francisco
Rodrguez-Henriquez Computer Science
Section, Electrical Engineering Department
Centro de Investigacion y de Estudios
Avanzados del IPN Av. Instituto
Politecnico Nacional No. 2508, Mexico
D.F.fnabbas@
computacion.cs.cinvestav.mx, adiaz,
Francisco @cs. cinvestav.mxg.
[9] Imyong lee, Dongwook Lee, Kiyoung choi
“ODALRISC: A Small, Low power and
Configurable 32-bit RISC processor”
International SOC design conference 2008.
[10]. Wayne Wolf, FPGA Based System Design ,
Prentice Hall, 2005.
[11] R. Razdan and M.D. Smith, “A High-
Performance Micro architecture with
Hardware-Programmable Functional
Units,”Proc. Micro-27, IEEE Computer
Society, 1994, pp. 172-180.
[12]. Vincen t P. Heuring, and Ha rry F. Jordan,
“Computer Systems Design and
Architecture”, 2n d E dition, 2003.
1724 | P a g e