Recursively Paired Arithmetic Technique (RPAT)
In this chapter a novel and yet simple cipher is proposed, which is fit for track Cryptography and Computer Science and Statistics Journal. Recursively Paired Arithmetic Technique (RPAT), which is an FPGA‐based block cipher simulation and its cryptanalysis, is being done with Pearsonian Chi‐Square t...
Saved in:
Published in | Design and Analysis of Security Protocol for Communication pp. 141 - 154 |
---|---|
Main Authors | , |
Format | Book Chapter |
Language | English |
Published |
Hoboken, NJ, USA
John Wiley & Sons, Inc
30.01.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this chapter a novel and yet simple cipher is proposed, which is fit for track Cryptography and Computer Science and Statistics Journal. Recursively Paired Arithmetic Technique (RPAT), which is an FPGA‐based block cipher simulation and its cryptanalysis, is being done with Pearsonian Chi‐Square test for non‐homogeneity between plaintext with ciphertext and Avalanche ratio test. This cipher is a bit level cryptography where a source stream is considered into a block and RPAT is applied to get the target stream, this cipher has four different types of encryption/decryption processes. So, TB = RPAT (SB, OP), Target Block (TB) is the output of the function Recursively Paired Arithmetic Technique (RPAT) with input parameters, Source Block (SB) and encryption/decryption Options (OP). This cipher has been implemented in IEEE VHDL and simulated for FPGA in Xilinx ISE 8.1i. A good and comparable cryptanalysis result has been found against widely used RSA and TDES. |
---|---|
ISBN: | 9781119555643 1119555647 |
DOI: | 10.1002/9781119555759.ch6 |