Abstract
A new computationally difficult problem defined over non-commutative finite groups is proposed as cryptographic primitive. The problem is used to construct public key agreement protocol and algorithms for public and commutative encryption. Finite non-commutative groups of the four-dimension vectors over the ground field are constructed and investigated as primitives for implementing the protocols and algorithms based on the proposed difficult problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
International Standard ISO/IEC 14888-3:2006(E). Information technology – Security techniques – Digital Signatures with appendix – Part 3: Discrete logarithm based mechanisms
Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on quantum computer. SIAM Journal of Computing 26, 1484–1509 (1997)
Anshel, I., Anshel, M., Goldfeld, D.: An Algebraic Method for Public Key Cryptography. Mathematical Research Letters 6, 287–291 (1999)
Ko, K.H., Lee, S.J., Cheon, J.H., Han, J.W., Kang, J.S., Park, C.: New Public-Key Cryptosystems Using Braid Groups. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 166–183. Springer, Heidelberg (2000)
Lee, E., Park, J.H.: Cryptanalysis of the Public Key Encryption Based on Braid Groups. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 477–489. Springer, Heidelberg (2003)
Verma, G.K.: A Proxy Blind Signature Scheme over Braid Groups. International Journal of Network Security 9, 214–217 (2009)
Myasnikov, A., Shpilrain, V., Ushakov, A.: A Practical Attack on a Braid Group Based Cryptographic Protocol. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 86–96. Springer, Heidelberg (2005)
Kargapolov, M.I., Merzlyakov, Y. I.: Group Theory Foundations. Fizmatlit, Moscow (1996) (in Russian)
Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory IT-22, 644–654 (1976)
Moldovyan, N.A., Moldovyanu, P.A.: New Primitives for Digital Signature Algorithms: Vector Finite Fields. Quasigroups and Related Systems 17, 271–282 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moldovyan, D.N., Moldovyan, N.A. (2010). A New Hard Problem over Non-commutative Finite Groups for Cryptographic Protocols. In: Kotenko, I., Skormin, V. (eds) Computer Network Security. MMM-ACNS 2010. Lecture Notes in Computer Science, vol 6258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14706-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-14706-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14705-0
Online ISBN: 978-3-642-14706-7
eBook Packages: Computer ScienceComputer Science (R0)