Year-end Sale % OFF 
Abstract
This paper gives a new proposed c ryptosystem (REBC3) that is designed to take advantages of the new generation of 64bits microprocessors whi ch commercially known as x64systems. The old version REBC2 , which was published in Africon 2007. REBC2 was basically developed for the 32bits microp rocessors which is commercially known as x86 systems. REBC3 like REBC2 use the concept of rotor enhanced block cipher which was initially proposed by the author in [NRSC 2002] on the first version of REBC. REBC2 used the same concept from a another point of view, which is using rotors to achieve two basic cryptographic operations; permutation, and substitution. Round key is generated using rotor too, which is used to achieve ciphertext key dependency. To enhance non -linearity and to resist linear cryptanalysis, REBC3 has a variable block, and key lengths. Each round has its own block length which depends on round the key and round key length. Dependency is based upon the previous round generated key. Rotors implemented using successive affine transformation . The 32 bits version was proposed in KAMFEE cipher, then the 64bits version was proposed in KAMFEE -X64 cipher. This achieved memory -less, normalized ciphertext statistics, and small processing speed trend. The strength of this system is compared with the REBC2 and RIJNDAEL (AES) ciphers.REBC3 cipher gives excellent results from security characteristics and statistical point of view of. So authors suggests to use REBC3 in the area of banking and electronic fund transfer.
Highlights
Network Security is becoming more and more crucial as the volume of data being exchanged on the internet is growing
The following section is a comparison between RIJNDAEL and REBC3 from speed, security and memory requirements point of view. 2.2
REBC3 of 64 bits block length consists of ONE basic blocks, REBC3 of 128 bits block length consists of two basic blocks, and 265 bit block consists of four different basic blocks
Summary
Network Security is becoming more and more crucial as the volume of data being exchanged on the internet is growing. Common families include symmetric systems (e.g. AES) and asymmetric systems (e.g. RSA), or may be grouped according to the central algorithm used (e.g. elliptic curve cryptography). As each of these is of a different level of cryptographic complexity, it is usual to have different key sizes for the same level of security, depending upon the algorithm used. The actual degree of security achieved over time varies, as more computational power and more powerful mathematical analytic methods become available For this reason cryptologists tend to look at indicators that an algorithm or key length shows signs of potential vulnerability, to move to longer key sizes or more difficult algorithms. In the presence of 64-bits systems, cryptosystems has to gain advantages if these systems by using 64-bits module operations [2] [3] (instead of 32 bits module operations [1]), and 64-bits basic block (instead of 32 bits basic block [1]) without any effect of cryptosystem processing speed
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Network Security & Its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
