The week's pick
Random Articles
Reseach Article
Three Novel Theorems for Applied Cryptography
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 74 - Number 13 |
| Year of Publication: 2013 |
| Authors: Rahul Yadav, Deepak Chaudhary |
10.5120/12948-0090
|
Rahul Yadav, Deepak Chaudhary . Three Novel Theorems for Applied Cryptography. International Journal of Computer Applications. 74, 13 ( July 2013), 31-37. DOI=10.5120/12948-0090
Abstract
With advancements in computing capabilities public key cryptosystems are going to be more complex yet vulnerable over the modern day's computer networks and associated security mechanism, especially those based on novel approaches of applied mathematics. This paper explores three novel theorems derived while studying and implementing RSA algorithm, one of the strongest public key cryptosystem. The proposed Theorems are best suited and adequate for RSA algorithm yet being applicable to some of other existing algorithms and theorems of applied mathematics. The first theorem deals with concept of ambiguity while calculating multiplicative inverse of encryption key which in some of instances returns undesirable negative numbers not useful as decryption key . Second theorem deals with unconcealed multiplicative inverses, unconcealed are values which remain unchanged after any mathematical transformations. Concept of unconcealed multiplicative inverses is useful in key generation for RSA cryptosystem. Third theorem deals with the concept of unconcealed exponentiation modulo quite useful in finding unconcealed signature and messages to form UM Matrix for RSA.
References
- Miller, Gary L. (1976), "Riemann's Hypothesis and Tests for Primality", Journal of Computer and System Sciences 13 (3): 300–317, http://dx. doi. org/10. 1145%2F800116. 803773, Ret May 2013.
- Stallings, William. Computer Organization and Architecture: Designing for performance, Ninth Edition. ISBN 978-0132936330, New Jersey: Prentice-Hall, Inc. 2012.
- Kasana, H. S. , Complex Variables: Theory And Applications (3rd ed. ), PHI Learning Pvt. Ltd, ISBN 978-8120326415, 2005
- R. L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems"; Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge; 1978.
- Paul Pritchard, "Improved Incremental Prime Number Sieves", Algorithmic Number Theory Symposium, pp. 280–288, 1994.
- Wikipedia, the free encyclopedia; Bézout's identity, Modular multiplicative inverse, extended Euclidean algorithm; @ http://en. wikipedia. org/wiki/; ret. June 2013.
- Riesel, Hans, Prime Numbers and Computer Methods for Factorization (second edition), Boston: Birkhäuser, ISBN 0-8176-3743-5, 1994.
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Third Edition. MIT Press and McGraw-Hill, ISBN 978-0262033848. Greatest common divisor. July 2009.
- Singh, S. The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography. New York: Anchor Books, 1999
- Gauss, Carl Friedrich; Maser, H. (translator into German) (1965), Untersuchungen uber hohere Arithmetik (Disquisitions Arithmetical & other papers on number theory) (Second edition), New York: Chelsea, ISBN 0-8284-0191-8.
- Branchaud, Marc, "A Survey of Public-key Infrastructures", Department of Computer Science, McGill University, Montreal, 1997.
- P. Gabrini; CodeWarrior Principles of Programming, Chapter 3. Algorithm, Metrowerks CodeWarrior, Metrowerks Inc. @info. uqam. ca/Members/gabrini_p/ Principles_of_Programming. pdf, Ret. June 2013.
- Zeliade W. P. ; Model Validation: theory, practice and perspectives. Zeliade White. May, 2011
- John Baez; "The Foundations of Applied Mathematics", Theoretic Foundations of Mathematics Workshop @ math. ucr. edu/home/baez/irvine/irvine. pdf. May 2013.
- Rahul Yadav, Direndra Yadav, Hriday Gupta, "RSA Operations With Performance Tuning"; Proceedings of ICNICT 2011, KIET, Ghaziabad, Sep 2011.
- William Stallings, "Cryptography and Network Security, Principles and Practice", Sixth edition; ISBN 978-0133354690, Prentice Hall, March 2013.
- Lemars; Using Multiplicative Inverses to Solve Equations, Lesson 5. 6 Pg. 247. Nov. 2012. @ lemars. k12. ia. us/webfiles/~/Source/J9B05FAD. pdf.
- Boute, Raymond T, "The Euclidean definition of the functions div and mod". ACM Transactions on Programming Languages and Systems (TOPLAS) (ACM Press (New York, NY, USA)) 14 (2): 127–144. http://dx. doi. org/10. 1145%2F128861. 128862, April 1992.
Index Terms
Keywords