The week's pick
Reseach Article
MES – Modern Encryption Standard
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 176 - Number 36 |
| Year of Publication: 2020 |
| Authors: Awnon Bhowmik, Unnikrishnan Menon |
10.5120/ijca2020920479
|
Awnon Bhowmik, Unnikrishnan Menon . MES – Modern Encryption Standard. International Journal of Computer Applications. 176, 36 ( Jul 2020), 21-27. DOI=10.5120/ijca2020920479
Abstract
As mathematical theory has evolved and computing capabilities have improved, what initially seemed to be adequately difficult trapdoor functions, were deemed not to be later. In this paper, a new block-encryption scheme named Modern Encryption Standard (MES) is proposed based on the multiple concepts arising from number theory for a highly secure and fast cryptosystem that can be considered as an alternative to the existing systems. This is a block cipher like AES, but the inherent algorithm is quite different. The security of the proposed MES algorithm stands on the fundamentals of the Chinese Remainder Theorem, Cantor Pairing Function and the Prime Number Theorem for creating an ingenious trapdoor function. Breaking this algorithm proves to be quite a daunting obstacle to overcome for an unwelcome interceptor.
References
- Ariyama, K., & Toyoshima, H. (1995). Hardware implementation of Chinese remainder theorem using redundant binary representation. (pp. 552-561). Sakai, Japan: IEEE. doi:https://doi.org/10.1109/VLSISP.1995.527526
- Chen, J., & Yao, R. (2011). Efficient CRT-based residue-to-binary converter for the arbitrary moduli set. Science China Information Sciences, 54(1), 70-78. doi:https://doi.org/10.1007/s11432-010-4133-3
- Chung-Hsien, W., Jin-Hua, H., & Cheng-Wen, W. (2001). RSA cryptosystem design based on the Chinese remainder theorem. Proceedings of the 2001 Asia and South Pacific Design Automation Conference, (pp. 391--395).
- Corless, R. M., Gonnet, G. H., Hare, D. E., Jeffrey, D. J., & Knuth, D. E. (1996). On the LambertW function. Advances in Computational mathematics, 5(1), 329--359. doi:https://doi.org/10.1007/BF02124750
- Ding, C., Pei, D., & Salomaa, A. (1996). Chinese remainder theorem: Applications in Computing, Coding, Cryptography. World Scientific.
- Douguet, M., & McKeeney, N. M. (2012, October). USA Patent No. 8,280,041.
- Galbraith, S. D. (2012). Towards a rigorous analysis of Pollard rho. In S. D. Galbraith, Mathematics of Public Key Cryptography (pp. 272-273). Cambridge University Press.
- Goldstein, L. J. (1973). A history of the prime number theorem. The American Mathematical Monthly, 80(6), 599--615.
- Grossschadl, J. (2000). The Chinese remainder theorem and its application in a high-speed RSA crypto chip. Proceedings 16th Annual Computer Security Applications Conference (ACSAC'00) (pp. 384--393). New Orleans, LA: IEEE. doi:https://doi.org/10.1109/ACSAC.2000.898851
- Henry, J. (2018, August 3). 3DES is Officially Being Retired. Retrieved from https://www.cryptomathic.com/news-events/blog/3des-is-officially-being-retired
- Lynn, B. (n.d.). The Chinese Remainder Theorem. Retrieved from Applied Crypto Group - Stanford: https://crypto.stanford.edu/pbc/notes/numbertheory/crt.html
- Miszczak, J. A. (2015, October). Shor's factoring algorithm. Quantiki. Retrieved from https://www.quantiki.org/wiki/shors-factoring-algorithm
- Pollard, J. M. (2008, October 24). Theorems on factorization and primality testing. Mathematical Proceedings of the Cambridge Philosophical Society, 76(3), 521-528. doi:https://doi.org/10.1017/S0305004100049252
- Shor, P. W. (1994). Algorithms for quantum computation: discrete logarithms and factoring. Proceedings 35th Annual Symposium on Foundations of Computer Science, (pp. 124-134).
- Szudzik, M. (2006). An Elegant Pairing Function. Washington, DC. Retrieved from http://szudzik.com/ElegantPairing.pdf
- Weisstein, E. W. (2002). Lambert W-function.
Index Terms
Keywords