A hybrid RSA-DH cipher for Signed Encrypted Messages

Although brute-force attacks on the modulus component of the RSA algorithm are possible, increasing the key size frustrates perpetrators more. However large keys increase CPU and Memory usage. Key handling would also be a challenge. Alternative approaches for strengthening the RSA algorithm are required. In addition, verification of message sources is not a feature of the RSA algorithm. Message senders cannot be tracked. If the RSA algorithm is to be used commercially, sender verification is necessary. The two drawbacks to commercial use of the RSA algorithm are, therefore, possibilities of attacks and lack of sender verification. The DH algorithm allows secure transmission of codes over insecure public channels. Can RSA encrypted messages be “signed” using DH generated codes? Can concatenation of DH codes and RSA encrypted messages detour brute force attacks while, at the same time, allowing message verification? We propose the design of a hybrid RSA-DH algorithm which signed encrypted messages are shared. The hybrid version satisfies most properties of good cryptosystems: confidentiality, integrity, availability, authenticity, and accountability. The results reported (CPU and memory usage) show negligible differences in the relative performance of the hybrid and ordinary versions, even when the hybrid version combines the processes of two algorithms.

[1]  P. V. Oorschot.  Overview of Cryptography , .

[2]  B. B. Zaidan,et al.  New Comparative Study Between DES, 3DES and AES within Nine Factors , 2010, ArXiv.

[3]  D. Anitha,et al.  A Review on Software Testing Framework in Cloud Computing , 2014 .

[4]  Moe Moe Myint,et al.  A Study of RSA Algorithm in Cryptography , 2019 .

[5]  A new highly secure directed signature scheme , 2013 .

[6]  Richard H. Baker,et al.  The computer security handbook , 1985 .

[7]  Zoran Hercigonja.  Comparative Analysis of Cryptographic Algorithms , 2017 .

[8]  Sin Ban Ho,et al.  A Comparison Study on Key Exchange-Authentication protocol , 2010 .

[9]  C. Allen,et al.  Stanford Encyclopedia of Philosophy , 2011 .

[10]  Jennifer Seberry,et al.  Public Key Cryptography , 2000, Lecture Notes in Computer Science.

[11]  Hugo Krawczyk,et al.  SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols , 2003, CRYPTO.

[12]  Alan R. Hevner,et al.  The Three Cycle View of Design Science , 2007, Scand. J. Inf. Syst..

[13]  Jacques Patarin,et al.  Increasing Block Sizes Using Feistel Networks: The Example of the AES , 2012, Cryptography and Security.

[14]  Markus Helfert,et al.  Action design research: a comparison with canonical action research and design science , 2015 .

[15]  Ian F. Blake,et al.  An Overview of Cryptography , 2013 .

[16]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[17]  Shishupal Kumar,et al.  Modified trial division algorithm using KNJ-factorization method to factorize RSA public key encryption , 2014, 2014 International Conference on Contemporary Computing and Informatics (IC3I).

[18]  Alfred Menezes,et al.  The State of Elliptic Curve Cryptography , 2000, Des. Codes Cryptogr..

[19]  A. Messiah.  Quantum Mechanics , 1961 .

[20]  Alexander Maximov,et al.  Some Words on Cryptanalysis of Stream Ciphers , 2006 .

[21]  Monica Chiarini Tremblay,et al.  At the Vanguard of Design Science: First Impressions and Early Findings from Ongoing Research , 2015 .

[22]  D. Salgado,et al.  Quantum Mechanics, is it magic? , 2008, 0804.4216.

[23]  Sarjon Defit,et al.  A New Image Encryption Technique Combining Hill Cipher Method, Morse Code and Least Significant Bit Algorithm , 2018 .

[24]  Israt Jahan,et al.  Improved RSA cryptosystem based on the study of number theory and public key cryptosystems , 2015 .

[25]  Jaya Sharma,et al.  A hybrid encryption algorithm based on RSA and Diffie-Hellman , 2012, 2012 IEEE International Conference on Computational Intelligence and Computing Research.

[26]  Prakash Kuppuswamy,et al.  Hybrid encryption/decryption technique using new public key and symmetric key algorithm , 2014, Int. J. Inf. Comput. Secur..

[27]  Tony M Damico.  A Brief History of Cryptography , 2009 .

[28]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[29]  Alex X. Liu,et al.  PAP: A privacy and authentication protocol for passive RFID tags , 2009, Comput. Commun..

[30]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[31]  Samir Chatterjee,et al.  A Design Science Research Methodology for Information Systems Research , 2008 .

[32]  Rawya Rizk,et al.  Two-phase hybrid cryptography algorithm for wireless sensor networks , 2015 .

[33]  Lars Mathiassen,et al.  Collaborative Practice Research , 2000, Scand. J. Inf. Syst..

[34]  Ilya Mironov,et al.  Collision-Resistant No More: Hash-and-Sign Paradigm Revisited , 2006, Public Key Cryptography.

[35]  Amritpal Singh,et al.  COMPARATIVE ANALYSIS OF CRYPTOGRAPHIC ALGORITHMS , 2013 .

[36]  William Hugh Murray,et al.  Modern Cryptography , 1995, Information Security Journal.

[37]  M.I. Aziz,et al.  Introduction to Cryptography , 2002, 2005 International Conference on Microelectronics.

[38]  Nitin Gupta,et al.  Security Aspects of the Extended Playfair Cipher , 2011, 2011 International Conference on Communication Systems and Network Technologies.

[40]  Jing Zhang,et al.  Analysis and Research of the RSA Algorithm , 2013 .

[41]  Liljana Babinkostova,et al.  A Simplified and Generalized Treatment of DES-Related Ciphers , 2012, Cryptologia.

[42]  Shyam Deshmukh,et al.  Hybrid cryptography technique using modified Diffie-Hellman and RSA , 2014 .

[43]  J. Linnett,et al.  Quantum mechanics , 1975, Nature.

[44]  Prakash Kuppuswamy,et al.  A New Efficient Digital Signature Scheme Algorithm based on Block cipher , 2012 .

[45]  Vijay K. Vaishnavi,et al.  Extending Prior Research with Design Science Research: Two Patterns for DSRIS Project Generation , 2011, DESRIST.

[46]  Justin Wyss-Gallifent.  The ElGamal Cryptosystem , 2012 .

[47]  Devesh C. Jinwala,et al.  Comparative Evaluation of Elliptic Curve Cryptography Based Homomorphic Encryption Schemes for a Novel Secure Multiparty Computation , 2014 .

[48]  Dmitri Maslov,et al.  Experimental comparison of two quantum computing architectures , 2017, Proceedings of the National Academy of Sciences.