Modified DES using Different Keystreams Based On Primitive Pythagorean Triples

Full Text (PDF, 556KB), PP.38-48

Views: 0 Downloads: 0


K.Mani 1 A.Devi 2,*

1. Nehru Memorial College, Puthanampatti, Trichy, TamilNadu, India-621 007

2. Cavalier Animation and Media College, Bangalore, Karnataka, India-560 043

* Corresponding author.


Received: 30 Sep. 2016 / Revised: 5 Nov. 2016 / Accepted: 2 Dec. 2016 / Published: 8 Jan. 2017

Index Terms

Key Generation, Stream Cipher, Primitive Pythagorean Triples, Data Encryption Standard


Symmetric-key encryption is a traditional form of cryptography, in which a single key is used to encrypt and decrypt a message. In symmetric–key algorithm before any encrypted message is being transmitted, the sender and receiver must know the key value in advance. There are several drawbacks in symmetric-key algorithms. In some algorithms, the size of the key should be same as the size of the original plaintext and maintaining and remembering such a key is very difficult. Further, in symmetric-key algorithms, several round has to be performed to produce the ciphertext and perhaps the same key is used in each round which results in subkey generated from the current round is fully depending on the previous round. To avoid these, a novel approach in generating the key from the keystream for any symmetric-key algorithms using the Primitive Pythagorean Triples(PPT) has been proposed in this paper. The main advantage of this method is that the key value generated from the keystream is chosen by both the sender and the receiver. Further, the size of the key sequence is not limited but its size is arbitrary in length. Since, the keystream generated is random, no need to remember such keys by both the sender and the receiver.

Cite This Paper

K.Mani, A.Devi,"Modified DES using Different Keystreams Based On Primitive Pythagorean Triples", International Journal of Mathematical Sciences and Computing(IJMSC), Vol.3, No.1, pp.38-48, 2017.DOI: 10.5815/ijmsc.2017.01.04


[1]DeepthiSathidevi, "Hardware Stream Cipher Based on LFSR and Modular Division Circuit", World Academy of Science Press, vol.2 (10), 2008.

[2]Win Kyaw, "Speech Encryption and Decryption Using LFSR", World Academy of Science, Engineering and Technology Journal, 2008.

[3]Majid Bakhtiari , Mohd Aizaini Maarof , "An Efficient Stream Cipher Algorithm for Data Encryption", IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 1, May 2011 ISSN (Online): 1694-0814

[4]Meier, W. and O. Staffelbach, "Nonlinearity Criteria for Cryptographic Functions, Advances in Cryptology", EUROCRYPT '89, J-J. Quisquater and J. Vandewalle, Editors. 1990, Springer Berlin /Heidelberg, pp: 549-562.

[5]Charles Pfleeger, Shari Lawrence Pfleeger, "Security in computing", Fourth Edition 2007, Prentice Hall of India Pvt Ltd, New Delhi.

[6]Scott Fluhrer, ItsikMantin and Adi Shamir, "weaknesses in the Key Scheduling Algorithm of RC4", (1).Cisco Systems, Inc, 170 West Tasman Drive, SanJose, CA95134.(2).Computer Science department, The WeizemannInstitute, Rehovot 76100, Israel.

[7]O Neugebauer and A sachs, "Mathematical Cuneiform Texts", New Haven, CT., 1945.

[8]Biham E. and Seberry, "Py (Roo): A Fast and Secure Stream Cipher", EUROCRYPT'05 Rump Session, at the Symmetric Key Encryption Workshop (SKEW2005), May 2005, pp: 26-27.

[9]HongGeun Kim, JungKyu Han and SeongjeCho, "An efficient implementation of RC4 cipher for encrypting multimedia files on mobile devices", SAC '07 Proceedings of the ACM symposium on Applied computing, 2007, pp: 1171--1175, NewYork, USA.

[10]Sreelaja.N.K and G.A.VijayalakshmiPai, " Swarm Intelligence based key generation for Text encryption in Cellular Networks", IEEE Proceedings of the Third International Conference on System Software and Middleware and Workshops, 2008, COMSWARE 2008, 6-10 Jan. 2008, pp: 622 – 629.

[11]Minaam, D.S.A.Abdual-Kader, H.M. & Hadhoud M. M. (2010), "Evaluating the Effects of Symmetric Cryptography Algorithms on Power Consumption for Different Data Types", IJ Network Security, Vol.11 (2), 2010.

[12]T.Muthumanickam, "Performance Analysis of Cryptographic VLSI Data", IRACST – International Journal of Computer Networks and Wireless Communications (IJCNWC), ISSN: 2250- 3501 Vol. 2, No. 1, 2012.

[13]Mijanur Rahaman, Md. Masudul Islam, "An Overview on Quantum Computing as a Service (QCaaS): Probability or Possibility", International Journal of Mathematical Sciences and Computing (IJMSC), Vol.2, No.1, pp.16-22, 2016.

[14]Erdem.S.S., Yanik, T., Ko ̧c, C ̧ .K., "Fast Finite Field Multiplication. In: C ̧ .K. Ko ̧c(ed.) Cryptographic Engineering", Chapter 5. Springer (2009).

[15]Longa, P., Miri, A., "New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields. In: PKC 2008", LNCS, vol. 4939, pp. 229-247, Springer, Heidelberg (2008).