SYMMETRIC BILINEAR CRYPTOGRAPHY ON ELLIPTIC CURVE AND LIE ALGEBRA
Abstract
Elliptic Curve Cryptography (ECC) has gained widespread adoption in the field of cryptography due to its efficiency and security properties. Symmetric bilinear pairings on elliptic curves have emerged as a powerful tool in cryptographic protocols, enabling advanced constructions and functionalities. This paper explores the intersection of symmetric bilinear pairings, elliptic curves, and Lie algebras in the context of cryptography. We provide a comprehensive overview of the theoretical foundations, applications, and security considerations of this amalgamation.
Downloads
References
R. Balasubramanian, N.Koblitz, The improbability than an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm, Journal of Cryptology 11(2) 1998, 141- 145.
R. Barua, R. Dutta, P. Sarkar, Extending Jouxs protocol to multi party key agreement, International Conference on Cryptology in India, Springer, Berlin, Heidelberg, 2003.
R. Dutta, R. Barua, P. Sarkar, Pairing based cryptographic protocols: A survey, IACR Cryptol. ePrint Arch. 2004, 64
I.F. Blake, G. Seroussi, N.P. Smart, Advances in elliptic curve cryptography. London Mathematical Society, Lecture Note Series, Cambridge University Press 2005.
D. Boneh, Twenty years of attacks on the RSA cryptosystem, Notices Amer. Math. Soc. 46 1999, 203-213.
D. Boneh, H. Shacham, B. Lynn, Short signatures from theWeil pairing. Journal of Cryptology, 17(4) 2004, 297-319.
D. Boneh, M. K. Franklin, Identity-based encryption from the Weil pairing. SIAM Journal of Computing, 32(3) 2003, 586-617.
J. Boxall, A. Enge, Some security aspects of pairing-based cryptography. Technical report of the ANR Project PACE, 2009, 243-258.
Michael N. John, UdoakaOtobong. G., Boniface O. Nwala, "Elliptic-Curve Groups in Quantum-Era Cryptography”, ISAR Journal of science and technology, Volume 1, Issue 1, pp21-24
S. Chatterjee, P. Sarkar, Identity-Based Encryption, Springer, 2011.
C. Costello, Pairing for beginners, A Note, 2013.
W.A. Graff, Lie algebras: theory and algorithms, Elsevier, 2000.
R. James, The groups of order p6 (p an odd prime), Math. Comput. 34 1980, 613-637. [14] A. Joux, A one round protocol for Diffie-Hellman, Proceedings of the 4th International Symposium on Algorithmic Number Theory, 2000, 385394.
M. Joye, G. Neven, Identity-based cryptography, 2 of Cryptology and Information Security Series, IOS Press, 2009.
MD. Huang, W. Raskind , A multilinear Generalization of the Tate Pairing. Contemporary Mathematics, 2010, 225-263.
B. Huppert, N. Blackbum, Finite Groups II, Springer-Verlag Berlin Heidelberg New York, 1982.
N. Koblitz, Algebraic aspects of cryptography, Algorithms and Computation in Mathematics, Algorithms and Computation in Mathematics, 1998.
S. Lee, A class of descendant p-groups of order p 9 and Higmans PORC conjecture, Journal of Algebra, 468 2016 440-447. Bilinear cryptography using Lie algebras from P-groups 77
Michael N. John, Udoaka O. G., "Computational GroupTheory and Quantum-Era Cryptography",International Journal of Scientific Research in Science,Engineering and Technology (IJSRSET), Online ISSN :2394-4099, Print ISSN : 2395-1990, Volume 10 Issue 6,pp. 01-10, November-December 2023. Available at doi :https://doi.org/10.32628/IJSRSET2310556
A. Mahalanobis, P. Shinde, Bilinear cryptography using groups of nilpotency class 2, IMA International Conference on Cryptography and Coding, 2017, 127-134.
N.E. Mrabet, L. Poinsot,, Pairings from a tensor product point of view, arXiv preprint arXiv:1304.5779, 2013.
A. Menezes, T. Okamoto, S.A. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Transactions on Information Theory 39(5)1993, 163-1646.
N.E. Mrabet, L. Poinsot, Elementary group-theoretic approach to pairings, Liebniz International Proceeding Informatics, 2012, 1-13.
N.E. Mrabet, A. Guillevi, SorinaIonica, Efficient Multiplication in Finite Field Extensions of Degree 5, International Conference on Cryptology in Africa. Springer, Berlin, Heidelberg, 2011.
M.F. Newman, Determination of groups of prime-power order, in Group Theory, Lecture Notes in Mathematics 573, Canberra, 1975, Springer-Verlag, Berlin, Heidelberg, New York, 1977, 7–84.
E.A. O’Brien, The p-group generation algorithm, Journal of symbolic computation, 9(5-6) 1990, 677- 698.
E.A. O’Brien, M.R. Vaughan-Lee, The groups with order p7 for odd prime p, Journal of Algebra 292(1) 2005, 243-258.
T. Okamoto, K. Takashima, Homomorphic encryption and signatures from vector decomposition, International conference on pairing-based cryptography. Springer, Berlin, Heidelberg, 2008.
T. Okamoto, K. Takashima, Hierarchical predicate encryption for inner-products, International Conference on the Theory and Application of Cryptology and Information Security. Springer, Berlin, Heidelberg, 2009.
V.A. Roman kov, Discrete logarithm for nilpotent group and cryptanalysis of polylinear cryptographic system, Prikle. Mat. Suppl, 2019(12) 2019, 154-160.
V.A. Roman kov, Algebraic cryptanalysis and new security enhancements, Moscow Journal of combinatorics and Number Theory, 9(2) 2020, 123-146.
J.H. Silverman, The arithmetic of elliptic curves, Volume 106 of Graduate Texts in Mathematics, Springer, 1986.
P.C. Van Oorschot, M.J. Wiener, Parallel collision search with cryptanalytic applications, Journal of cryptology, 12(1) 1999, 1-28.
M.R. Vaughan-Lee, Groups of order p 8 and exponent p, International Journal of Group Theory, 4(4) 2015, 25-42.
Henri Cohen, Gerhard Frey, Roberto Avanzi, Christophe Doche, Tanja Lange, Kim Nguyen, and Frederik Vercauteren. Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete mathematics and its applications. Chapman & Hall/CRC, Boca Raton, 2006.
ElahehKhamseh. Bilinear cryptography using Lie algebra from p-groups. Mathematics and Computational science, Vol2(1), 2021. DOI: 10.30511/mcs.2021.522222.1015
HirotakaTamanoi. Symmetric Invariant Pairings In Vertex Operator Super Algebras And Gramians. Journal of Pure and Applied Algebra 140 (1999) 149–189
Copyright (c) 2023 Michael N. John, Udoaka Otobong. G. & Alex Musa
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Author(s) and co-author(s) jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere. Author(s) agree to the terms that the GPH Journal will have the full right to remove the published article on any misconduct found in the published article.
