The technique considers a message as binary string on which a Cascaded Recursive Key Rotation and Bitwise Operation (CRKRBOB) is applied. A block of n bits is taken as an input stream, where n varies from 8 to 256, from a continuous stream of bits and the technique operates on it to generate the intermediate encrypted stream. This technique directly involves all the bits of blocks in a binary addition. The same operation is performed repeatedly for different block sizes as per the specification of a session key of a session to generate the final encrypted stream. It is a kind of block cipher and symmetric in nature hence, decoding is done following the same procedure.
[...] of alternate Keys Time required at 1 encryption / µs 232= 4.3 * = 7.2 * 231= 35.8 minutes 255 µs=1142 years milli-seconds 10.01 hours 5.4 *1018 years 2.8 *1024 years 5.1 *1030 years 2 = 3.4 * = 1.7 *10 µs= 5.4 *10 years µs= 2.8 *10 years 30 2168= 3.7 * µs= 5.9 *1036 years DBCORE.CPP DAOCORE.CPP 134431 BOOK.CPP Decryption time (in seconds) Encryption tim e (in seconds) Figure 4.1 The Chi-square test has also been performed using source file and encrypted files for Cascaded Recursive Key Rotation and Bitwise Operation (CRKRBOB) technique and existing RSA and TDES technique. [...]
[...] Shakya Encryption through cascaded recursive key rotation and arithmetic operation of a session key (CRKRAO)” accepted to the Technical publication of the Engineering Association of Nepal, Kathmandu. D. Welsh , “Codes and Cryptography”, Oxford: Claredon Press J. Seberry and J. Pieprzyk , Introduction to Computer Security”, Australia: Prentice Hall of Australia D. Boneh, “Twenty Years of Attacks on RSA Cryptosystem” in notices the American Mathematical Society vol 46,no pp 203-213,1998. B. Schneier, “Applied Cryptography”, Second Edition, John Wiley & Sons Inc C. [...]
[...] Second phase encrypt the output of the first phase by Bitwise Operation on Blocks of a session key The technique considers the encrypted message from the first phase (in this case third block) in the form of blocks of bits with different size like 4 16/ 32/ 64/ 128/ 256. The rules to be followed for generating a cycle are as follows: Let P = s00 s01 s02 s03 s s0n-1 is a block of size n in the plaintext. [...]
[...] First phase encrypt the plaintext using Recursive Key Rotation The total message can be considered as blocks of bits in the first phase with different size like 4 / 16/ 32/ 64/ 128/ 256. The rules to be followed for generating a cycle are as follows: 1. Consider any source stream of a finite number (where N=2n, n to and divide it into two equal parts Consider any key value (key= 2n, where n=1 to depends upon the source stream that is, key value is the half of the source stream) Make the modulo-2 addition with the key value to the first half of the source stream, to get the first intermediate block Make the modulo-2 addition with the key value (but now the key value is reversed) to the last half of the source stream to get the second intermediate block. [...]
[...] For this technique only four bits blocks are taken, and the third intermediate block is considered here as encrypted stream, so the time required to get the encrypted stream is always be larger than that of decryption because only one iteration is required to get the source stream in the decryption part. Since this technique generates a cycle. From the table 4.1 it is seen that overhead Jha, P. K., Mandal.J .K, S. Shakya Encryption through cascaded recursive addition of blocks and key rotation of a session key (CRABKR)” accepted to the Nepalese journal of Engineering (NJOE), Kathmandu, Nepal. Dutta S et al. “Ensuring e-Security using a Private-key Cryptographic System Following Recursive Positional Modulo-2 Substitutions” AACC 2004, LNCS 3285, Springer-Verlag Berlin Heidelberg, pp. [...]
APA Style reference
For your bibliographyOnline reading
with our online readerContent validated
by our reading committee
