Hybrid Algorithms Use Monomials in Encryption
Article Sidebar
Main Article Content
Abstract
In this study we used Diffie-Hellman (D-H) method with algorithms used monomials to get on hybrid algorithms to find a new key which can be used in clear text encryption
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Tikrit Journal of Pure Science is licensed under the Creative Commons Attribution 4.0 International License, which allows users to copy, create extracts, abstracts, and new works from the article, alter and revise the article, and make commercial use of the article (including reuse and/or resale of the article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made, and the licensor is not represented as endorsing the use made of the work. The authors hold the copyright for their published work on the Tikrit J. Pure Sci. website, while Tikrit J. Pure Sci. is responsible for appreciate citation of their work, which is released under CC-BY-4.0, enabling the unrestricted use, distribution, and reproduction of an article in any medium, provided that the original work is properly cited.
References
[1] Blom .R, (Non–Public Key Distribution In: Advances in Cryptology), Chaum, D.(Ed).Plenum press, New York, USA. ISBN:978-1-4757-0604-8,pp:231-236,1983.
[2] Rock .A, ( Pseudorandom Number Generators for Cryptographic Applications) University Salzburg, Austria , Pages: 108, 2005.
[3] Stinson .D.R, (Cryptography: Theory and Practice), CRC press, Boca Raton, Florida, USA, ISBN:9780849385216, Pages:434, 1995.
[4] S.C.COUTINHO, (The Mathematics of Ciphers ; Number Theory and RSA Cryptography), Department of Compute Science Federal University of Riode Janeiro, Brazil, 1997.
[5] Awni M.Gaftan, Akram S.Mohammed and Osama H.Subhi (Cryptography by using Hosoya polynomials for Graphs Groups of Integer Module and Dihedral Groups with Immersion Property), Ibn Al Haitham Jour for Pure and Apple . sci, IHJPAS: VOL. 31 (3) 2018 .
[6] Karl-Heinz. F, (Groups, Rings and Field), Uppsala, 2010.
[7] D. Saba .N.M, (Foundations of Mathematics), College of Ibn Al Haitham Of Science, University of Baghdad, Lectures Notes in Fund, 2010.
[8] Gautam Kumar and Hem raj Saini, (Novel Noncommutative Cryptography Scheme Using Extra Special Group), Security and Communication Networks, University of Information Techndogy Solan, 21 page, India 2017.
[9] Z. Cao, X .Dong and L. Wang, (New public key cryptosystems using polynomials over noncommutative), Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, P.R, China, 2002.
[10] William Stallings,( Cryptography and Network Security Principles and Practices Fourth Edition), Publisher: Prentice Hall, ISBN-10: 0-13-187316-4, 2005.
[11] Sivahagaswathi Kallam, (Diffie-Hellman: Key Exchange and Public Key Cryptosystems),Math and computer Science Department,(MSC. TH.) Indiana state University, Terre Haute, IN, USA, 2015.
[12] Wajdy A. A, (Introduction to Classical Cryptography), Romansy, Sudan Geek, 2007.
[13] Murray Eisenberg,(Hill ciphers and Modular Linear Algebra), Copyright © 1998 by Murray Eisenberg, November 3, 1999.