Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Cryptanalysis
Analysis of Braid Based Schemes
References
All Topics
Mathematics
Algebra

Group theory in cryptography

Profile image of carlos cidcarlos cid

2009

Abstract

This paper is a guide for the pure mathematician who would like to know more about cryptography based on group theory. The paper gives a brief overview of the subject, and provides pointers to good textbooks, key research papers and recent survey papers in the area.

Related papers

Towards a Uniform Description of Several Group Based Cryptographic Primitives
Consuelo Martínez

Designs, Codes and Cryptography, 2000

The public key cryptosystems M ST 1 and M ST 2 make use of certain kinds of factorizations of finite groups. We show that generalizing such factorizations to infinite groups allows a uniform description of several proposed cryptographic primitives. In particular, a generalization of M ST 2 can be regarded as a unifying framework for several suggested cryptosystems including the ElGamal public key system, a public key system based on braid groups and the MOR cryptosystem.

View PDFchevron_right
Cryptosystems using Linear Groups
Benjamin Fine

Applicable Algebra in Engineering, Communication and Computing, 2006

Several suggestions are presented for developing cryptosystems, both classical and public key, using a combination of combinatorial group theory and linear groups. In particular, the Reidemeister-Schreier rewriting process is used as a one way function. These suggestions raise further questions concerning both implementation and security that are being explored in the thesis of Xu .

View PDFchevron_right
CRYPTOGRAPHIC APPLICATIONS OF NONABELIAN GROUPS
Thomas Pulickal

2000

Since the development of the RSA cryptographic system by Rivest, Shamir, and Adleman, in 1977, RSA has become a cornerstone of communication security. However, as computers gain in processing speed, it is imperative that stronger cryptographic schemes be implemented in order to withstand attacks using advanced mathematical techniques and cutting edge technology.

View PDFchevron_right
Computational Group Theory and Quantum-Era Cryptography
Michael John

International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), 2023

This paper provides an overview of the significant role of computational group theory in cryptography. Group theory plays a crucial role in various cryptographic applications, such as key exchange, encryption, and digital signatures. This paper examines the fundamental concepts, algorithms, and applications of computational group theory in cryptography, using polycyclic groups with a focus on key findings and recent developments in quantum-era cryptography.

View PDFchevron_right
A Survey of Public-Key Cryptography over Non-Abelian Groups
Kasun Jinasena

International Journal of Computer Science & Network, 2021

Non-abelian group based Cryptography is a field which has become a latest trend in research due to increasing vulnerabilities associated with the abelian group based cryptosystems which are in use at present and the interesting algebraic properties associated that can be thought to provide higher security. When developing cryptographic primitives based on non-abelian groups, the researchers have tried to extend the similar layouts associated with the traditional underlying mathematical problems and assumptions by almost mimicking their operations which is fascinating even to observe. This survey contributes in highlighting the different analogous extensions of traditional assumptions presented by various authors and a set of open problems. Further, suggestions to apply the Hamiltonian Cycle/Path Problem in a similar direction is presented.

View PDFchevron_right
A Method for the Construction of a Cryptographic Group-theoretic Language
Tola John Odule

Advances in Multidisciplinary and Scientific Research Journal, 2017

This paper generalizes the theory of universal hashing in the construction of cryptographic protocols using grouptheoretic language formalisms. This idea is due to Wegman and Carter who gave a construction in 1981 which is extremely useful when the number of authenticators is small compared to the number of possible source states (plaintext messages) in order to accommodate the situation where we would like to authenticate a sequence of messages with the same key. Unlike previous methods for doing this we do not require that each message in the sequence have a "counter" attached to it. We provide necessary definitions and theory and then give a construction which achieves our goals.

View PDFchevron_right
Combinatorial group theory and public key cryptography
gabriel zapata

Computing Research Repository, 2004

After some excitement generated by recently suggested public key exchange protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al., it is a prevalent opinion now that the conjugacy search problem is unlikely to provide sufficient level of security if a braid group is used as the platform. In this paper we address the following questions: (1) whether choosing a different group, or a class of groups, can remedy the situation; (2) whether some other "hard" problem from combinatorial group theory can be used, instead of the conjugacy search problem, in a public key exchange protocol. Another question that we address here, although somewhat vague, is likely to become a focus of the future research in public key cryptography based on symbolic computation: (3) whether one can efficiently disguise an element of a given group (or a semigroup) by using defining relations.

View PDFchevron_right
A Group Law on the Projective Plane with Applications in Public Key Cryptography
Raúl Durán Díaz

Mathematics

In the context of new threats to Public Key Cryptography arising from a growing computational power both in classic and in quantum worlds, we present a new group law defined on a subset of the projective plane F P 2 over an arbitrary field F , which lends itself to applications in Public Key Cryptography and turns out to be more efficient in terms of computational resources. In particular, we give explicitly the number of base field operations needed to perform the mentioned group law. Based on it, we present a Diffie-Hellman-like key agreement protocol. We analyze the computational difficulty of solving the mathematical problem underlying the proposed Abelian group law and we prove that the security of our proposal is equivalent to the discrete logarithm problem in the multiplicative group of the cubic extension of the finite field considered. We present an experimental setup in order to show real computation times along a comparison with the group operation in the group of points ...

View PDFchevron_right
A New Public Key Cryptosystem Based on Group Ring
kenza guenda

Advances in Mathematics: Scientific Journal

In this paper, we propose a new public key cryptosystem in a non-commutative group over group ring, using a hard problem, Factorization with Discrete Logarithm Problem (FDLP). The security analysis of the proposed scheme is discussed and it is shown that the system is secure.

View PDFchevron_right
A simple generalization of the El-Gamal cryptosystem to non-abelian groups II
Ayan Mahalanobis

Computing Research Repository, 2007

In this paper I study the MOR cryptosystem using the special linear group over finite fields. At our current state of knowledge, I show that the MOR cryptosystem is more secure than the ElGamal cryptosystem over finite fields.

View PDFchevron_right

References (92)

  1. Iris Anshel, Michael Anshel and Dorian Goldfeld, An algebraic method for public-key cryptography, Math. Res. Lett. 6 (1999), 287-291.
  2. Iris Anshel, Michael Anshel, Dorian Goldfeld and Stephane Lemieux, Key agreement, the Algebraic Eraser TM , and lightweight cryptography, Contemp. Math. 418 (2006) 1-34.
  3. Emil Artin, The theory of braids, Annals of Math. 48 (1947) 101-126.
  4. Daniel J. Bernstein, Johannes Buchmann, Erik Dahmen (Eds.) Post- Quantum Cryptography, Springer-Verlag, Berlin Heidelberg, 2009.
  5. Norman Biggs, The critical group from a cryptographic perspective, Bull. London Math. Soc. 39 (2007) 829-836.
  6. Joan S. Birman, Volker Gebhardt and Juan González-Meneses, Conju- gacy in Garside groups I: cycling, powers and rigidity, Groups Geom. Dynamics 1 (2007), 221-279.
  7. Joan S. Birman, Volker Gebhardt and Juan González-Meneses, Con- jugacy in Garside groups II: structure of the ultra-summit set, Groups Geom. Dynamics 2 (2008), 13-61.
  8. Joan S. Birman, Volker Gebhardt and Juan González-Meneses, Con- jugacy in Garside groups III: periodic braids, J. Algebra 316 (2007), 746-776.
  9. Joan Birman, Ki Hyoung Ko and Sang Jin Lee, A new approach to the word and conjugacy problems in the braid groups, Adv. Math 139 (1998) 322-353.
  10. Simon R. Blackburn, Cryptanalysing the critical group: efficiently solv- ing Biggs's discrete logarithm problem, J. Math. Cryptology, to appear.
  11. Simon R. Blackburn, Carlos Cid, Ciaran Mullan, Cryptanalysis of the M ST 3 cryptosystem, J. Math. Cryptology, to appear.
  12. Simon Blackburn, Sean Murphy and Jacques Stern, The cryptanalysis of a public key implementation of Finite Group Mappings, J. Cryptology 8 (1995), 157-166.
  13. Jens-Matthias Bohli, Rainer Steinwandt, María Isabel González Vasco and Consuelo Martinez, Weak keys in M ST 1 , Designs, Codes and Cryp- tography 37 (2005) 509-524.
  14. Ryan D. Budney, On the image of the Lawrence-Krammer representa- tion, J. Knot Theory and its Ramifications 14 (2005), 1-17.
  15. Keith W. Campbell and Michael J. Wiener, DES is not a group, in Advances in Cryptology -CRYPTO '92 (E.F. Brickell, ed), Lecture Notes in Computer Science 740 (Springer-Verlag, Berlin, 1993) 512- 520.
  16. V. Canda, T. van Trung, S. S. Magliveras and T. Horvath, Symmetric block ciphers based on group bases, in Selected Areas in Cryptography, SAC 2000 (D.R. Stinson and S.E. Tavares, eds.), Lecture Notes in Computer Science 2012 (Springer-Verlag, Berlin, 2001) 89-105.
  17. A Caranti, F. Dalla Volta, The round functions of cryptosystem PGM generate the symmetric group, Designs, Codes and Cryptography, 38 (2006), 147-155.
  18. A. Caranti, Francesca Dalla Volta and M. Sala, An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher, Designs, Codes and Cryptography 52 (2009), 293-301.
  19. A. Caranti, Francesca Dalla Volta and M. Sala, On some block ciphers and imprimitive groups, http://arxiv.org/abs/0806.4135.
  20. CGC Bulletin -Combinatorial Group Theory and Cryptography. http://u.cs.biu.ac.il/ ~tsaban/CGC/cgc.html.
  21. Jae Choon Cha, Ki Hyong Ko, Sang Jin Lee, Jae Woo Han and Jung Hee Cheon, An efficient implementation of braid groups, in Advances in Cryptology -Asiacrypt 2001 (C. Boyd, ed.), Lecture Notes in Computer Science 2248 (Springer, Berlin, 2001) 144-156.
  22. Jung Hee Cheon and Byungheup Jun, A polynomial time algorithm for the braid Diffie-Hellman conjugacy problem, in Advances in Cryptology -CRYPTO 2003 (D. Boneh, ed), Lecture Notes in Computer Science 2729 (Springer, Berlin, 2003) 212-225
  23. D. Coppersmith, The Data Encryption Standard (DES) and its strength against attacks, IBM Research Report RC 18613 (IBM, 1992).
  24. Patrick Dehornoy, Braid-based cryptography, Contemporary Mathe- matics 360 (2004), 5-33.
  25. Whitfield Diffie and Martin E. Hellman, New directions in cryptogra- phy, IEEE Trans. Information Theory 22 (1976) 644-654.
  26. Steven Galbraith and Alfred Menezes, Algebraic curves and cryptogra- phy, Finite Fields and Applications 11 (2005), 544-577.
  27. David Garber, Braid group cryptography, in Braids: Introductory Lec- tures on Braids, Configurations and Their Applications (J. Berrick, F.R. Cohen, E. Hanbury, eds) (World Scientific, Singapore, 2009) http://arxiv.org/abs/0711.3941.
  28. David Garber, Shmuel Kaplan, Mina Teicher, Boaz Tsaban and Uzi Vishne, Probabilistic solutions of equations in the braid group, Adv. Appl. Math. 35 (2005), 323-334.
  29. F.A. Garside, The braid group and other groups, Quart. J. Math. Ox- ford 20 (1969), 235-254.
  30. Robert Gilman, Alex D. Miasnikov, Alexei G. Myasnikov and Alexan- der Ushakov, New developments in commutator key exchange, in Proc. First Int. Conf. on Symbolic Computation and Cryptography (SCC- 2008), Bejing, 2008. http://www.math.stevens.edu/ ~rgilman/.
  31. Oded Goldreich, Shafi Goldwasser, and Shai Halevi, Public-key cryp- tosystems from lattice reduction problems, in Advances in Cryptology - CRYPTO 97 (B.S. Kaliski Jr, ed.), Lecture Notes in Computer Science 1294 (Springer, Berlin, 1997) 112-131.
  32. Oded Goldreich et al., Letters to the editor, Notices of the A.M.S. 54 (2007) 1454-1456.
  33. María Isabel González Vasco, Spyros Magliveras and Rainer Stein- wandt, Group-theoretic cryptography, Chapman & Hall / CRC Press, to appear.
  34. María Isabel Gonzalez Vasco, Martin Rötteler and Rainer Steinwandt, On minimal length factorizations of finite groups, J. Exp. Math. 12 (2003), 1-12.
  35. María Isabel González Vasco and Rainer Steinwandt, A reaction attack on a public key cryptosystem based on the word problem, Applica- ble Algebra in Engineering, Communication and Computing 14 (2004), 335-340.
  36. María Isabel González Vasco and Rainer Steinwandt, Obstacles in two public-key cryptosystems based on group factorizations, Tatra Mt. Math. Pub. 25 (2002) 23-37.
  37. Markus Grassl, Ivana Ilić, Spyros Magliveras and Rainer Steinwandt, Cryptanalysis of the Tillich-Zémor hash function, http://eprint.iacr.org/2009/229
  38. D. Hofheinz and R. Steinwandt, A practical attack on some braid group based cryptographic primitives, in Public Key Cryptography -PKC 2003 (Y.G. Desmedt, ed.), Lecture Notes in Computer Science 2384 (Springer, Berlin, 2002), 176-189.
  39. P. E. Holmes, On minimal factorisations of sporadic groups, J. Exp. Math. 13 (2004) 435-440.
  40. G. Hornauer, W. Stephan, and R. Wernsdorf, Markov ciphers and alter- nating groups, in Advances in Cryptology -EUROCRYPT '93 (T. Helle- seth, ed) Lecture Notes in Computer Science 765 (Springer-Verlag, Berlin, 1994), 453-460.
  41. James Hughes, A linear algebraic attack on the AAFG1 braid group cryptosystem, in Information Security and Privacy (G. Goos, J. Hart- manis and J. van Leeuwen, eds), Lecture Notes in Computer Science 2384 (Springer-Verlag, Berlin, 2002), 176-189.
  42. J. Hughes and A. Tannenbaum, Length-based attacks for certain group based encryption rewriting systems, http://arxiv.org/PS_cache/cs/pdf/0306/0306032v1.pdf.
  43. IACR Calendar of Events in Cryptology, http://www.iacr.org/events/.
  44. IACR Cryptology ePrint Archive, http://eprint.iacr.org/.
  45. David Kahn, The Codebreakers: The Comprehensive History of Secret Communication from Ancient Times to the Internet (2nd Edition, Si- mon & Schuster, London, 1997).
  46. Burton S. Kaliski Jr, Ronald L. Rivest, and Alan T. Sherman, Is the Data Encryption Standard a group? (Results of cycling experiments on DES), J. Cryptology 1 (1988), 3-36.
  47. Arkadius Kalka, Mina Teicher and Boaz Tsaban, 'Cryptanalysis of the Algebraic Eraser and short expressions of permutations as products', preprint. See http://arxiv.org/abs/0804.0629.
  48. Jonathan Katz and Yehuda Lindell, Introduction to Modern Cryptog- raphy (Chapman & Hall / CRC Press, Boca Raton, 2007).
  49. Aviad Kipnis and Adi Shamir, Cryptanalysis of the HFE public key cryptosystem, in Advances in Cryptology -CRYPTO '99 (M. Weiner, ed.), Lecture Notes in Computer Science 1666 (Springer, Berlin, 1999) 19-30.
  50. Ki Hyoung Ko, Sang Jin Lee, Jung Hee Cheon, Jae Woo Han, Ju-sung Kang, and Choonsik Park, New public-key cryptosystem using braid group, in Advances in Cryptology -CRYPTO 2000 (M. Bellare, ed.), Lecture Notes in Computer Science 1880 (Springer, Berlin, 2000) 166- 183.
  51. Neal Koblitz, The uneasy relationship between mathematics and cryp- tography, Notices Amer. Math. Soc. 54 (2007), 972-979.
  52. Sang Jin Lee and Eonkyung Lee, Potential weaknesses of the commu- tator key agreement protocol based on braid groups, in Advances in Cryptology -EUROCRYPT 2002, (L. Knudsen, ed.), Lecture Notes in Comp. Science 2332 (Springer, Berlin, 2002) 14-28.
  53. Wolfgang Lempken and Tran van Trung, On minimal logarithmic sig- natures of finite groups, J. Exp. Math. 14 (2005) 257-269.
  54. Wolfgang Lempken, Tran van Trung, Spyros S. Magliveras and Wandi Wei, A public key cryptosystem based on non-abelian finite groups, J. Cryptology 22 (2009) 62-74.
  55. Françoise Levy-dit-Vehel and Ludovic Perret, On the Wagner-Magyarik cryptosystem, in Coding and Cryptography (Ø. Ytrehus, ed) (Springer, Berlin, 2006), 316-329.
  56. Françoise Levy-dit-Vehel and Ludovic Perret, Security analysis of word problem-based cryptosystems, Designs, Codes and Cryptography 54 (2010), 29-41.
  57. Helger Lipmaa, Multiparty computa- tions, http://research.cyber.ee/~lipmaa/ crypto/link/mpc/.
  58. S. S. Magliveras, A cryptosystem from logarithmic signatures of finite groups, Proceedings of the 29'th Midwest Symposium on Circuits and Systems, Elsevier Publishing Company (1986), 972-975.
  59. S. S. Magliveras, Secret and public-key cryptosystems from group fac- torizations, Tatra Mt. Math. Publ. 25 (2002). 1-12.
  60. Spyros S. Magliveras and Nasir D. Memon, The algebraic properties of cryptosystem PGM, J. Cryptology 5 (1992), 167-183.
  61. S. S. Magliveras, D. R. Stinson and Tran van Trung, New approaches to designing public key cryptosystems using one-way functions and trap- doors in finite groups, J. Cryptology 15 (2002) 167-183.
  62. R.J. McEliece, A public key cryptosystem based on algebraic coding theory, DSN Progress Report 42 -44 (Jet Propulsion Lab, Pasadena, 1978) 114-116.
  63. Alfred J. Menezes and Scott A. Vanstone, A note on cyclic groups, finite fields and the discrete logarithm problem, Applicable Algebra in Engineering, Communication and Computing, 3 (1992), 67-74.
  64. Sean Murphy, Kenneth Paterson, and Peter Wild, A weak cipher that generates the symmetric group, J. Cryptology 7 (1994) 61-65.
  65. Alexei Myasnikov, Vladimir Shpilrain and Alexander Ushakov, Group- based Cryptography, Advanced Courses in Mathematics CRM Barcelona (Birkhäuser, Basel, 2008).
  66. Alex D. Myasnikov and Alexander Ushakov, Length based attack and braid groups: cryptanalysis of Anshel-Anshel-Goldfeld key exchange protocol, in Public Key Cryptography -PKC 2007 (T. Okamoto, X. Wang, eds.), Lecture Notes in Computer Science 4450 (Springer, Berlin, 2007) 76-88.
  67. A.G. Myasnikov and A. Ushakov, Random subgroups and analysis of the length-based and quotient attacks, J. Math. Cryptology 2 (2008) 29-61.
  68. Phong Q. Nguyen, Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosystem from CRYPTO 97', in Advances in Cryptology - CRYPTO '99 (M. Weiner, ed.), Lecture Notes in Computer Science 1666 (Springer, Berlin, 1999) 288-304,
  69. National Bureau of Standards, The Data Encryption Standard, Federal Information Processing Standards Publication (FIPS) 46, 1977.
  70. National Institute of Standards and Technology, Secure Hash Standard, Federal Information Processing Standards Publication (FIPS) 180-1, 1995.
  71. National Institute of Standards and Technology, Secure Hash Standard, Federal Information Processing Standards Publication (FIPS) 180-2 with Change Notice, 2002.
  72. National Institute of Standards and Technology, The Advanced Encryp- tion Standard, Federal Information Processing Standards Publication (FIPS) 197, 2001.
  73. Jacques Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of Asymmetric Algorithms' in: Ad- vances in Cryptology -Eurocrypt'96 (U. Maurer, ed.), Lecture Notes in Computer Science 1440 (Springer, Berlin, 1999) 33-48.
  74. Kenneth G. Paterson, Imprimitive permutation groups and trapdoors in iterated block ciphers, in Fast Software Encryption (L.R. Knudsen, ed), Lecture Notes in Computer Science 1636 (Springer-Verlag, Berlin, 1999), 201-214.
  75. Mingua Qu and Scott Vanstone, New public-key cryptosystems based on factorizations of finite groups, AUSCRYPT '92 Preproceedings.
  76. Dima Ruinskiy, Adi Shamir and Boaz Tsaban, Length-based crypt- analysis: The case of Thompson's Group, J. Mathematical Cryptology, 1 (2007), 359-372.
  77. C.E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal 28 (1949), 656-715.
  78. Peter W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Computing 26 (1997) 1484-1509.
  79. Vladimir Shpilrain, Cryptanalysis of Stickel's key exchange scheme, in Computer Science -Theory and Applications (E.A. Hirsch, A.A. Razborov, A. Semenov, A, Slissenko, eds.), Lecture Notes in Computer Science 5010 (Springer, Berlin, 2008) 283-288.
  80. Nigel Smart, Cryptography: An Introduction, Third Edition. Available online: http://www.cs.bris.ac.uk/ ~nigel/Crypto_Book/
  81. Rüdiger Sparr and Ralph Wernsdorf, Group theoretic properties of RIJNDAEL-like ciphers, Discrete Appl. Math. 156 (2008), 3139-3149.
  82. Rainer Steinwandt, Markus Grassl, Willi Geiselmann and Thomas Beth, Weaknesses in the SL 2 (F 2 n ) hashing scheme, in Advances in Cryp- tology -CRYPTO 2000 (M. Bellare, ed), Lecture Notes in Computer Science 1880 (Springer, Berlin, 2000), 287-299.
  83. Eberhard Stickel, A new method for exchanging secret keys, in Proc. Third International Conference on Information Technology and Appli- cations (ICITA '05) (IEEE Computer Society, Piscataway, 2005), 426- 430.
  84. Douglas R. Stinson, Cryptography: Theory and Practice, Third Edition (Chapman & Hall, Boca Raton, 2005).
  85. The Hash Function Zoo, http://ehash.iaik.tugraz.at/wiki/The_Hash_Function_Zoo.
  86. Jean-Pierre Tillich and Gilles Zémor, Hashing with SL 2 , in Advances in Cryptology -CRYPTO '94 (Y. Desmedt, ed.), Lecture Notes in Computer Science, 839 (Springer, 1994), 40-49.
  87. Jean-Pierre Tillich and Gilles Zémor, Collisions for the LPS expander graph hash function, in Advances in Cryptology -EUROCRYPT 2008 (N. Smart, ed.), Lecture Notes in Computer Science, 4965 (Springer, 2008), 254-269.
  88. Neal R. Wagner and Marianne R. Magyarik, A public key cryptosystem based on the word problem, in Advances in Cryptology -CRYPTO '84 (G.R. Blakley and David Chaum, eds.) Lecture Notes in Computer Science 196 (Springer, Berlin, 1985), 19-36.
  89. Laurence C. Washington, Elliptic Curves: Number Theory and Cryp- tography, Second Edition (CRC Press, Boca Raton, 2008).
  90. Ralph Wernsdorf, The one-round functions of the DES generate the alternating group, in Advances in Cryptology -EUROCRYPT 1992 (R.A. Rueppel, ed.), Lecture Notes in Computer Science 658 (Springer- Verlag, Berlin, 1993), 99-112.
  91. Ralph Wernsdorf, The round functions of RIJNDAEL generate the al- ternating group, in Fast Software Encryption (J. Daemen and V. Rij- men, eds.), Lecture Notes in Computer Science 2365, (Springer-Verlag, Berlin, 2002), 143-148.
  92. Gilles Zémor, Hash functions and Cayley graphs, Designs, Codes and Cryptography 4 (1994), 381-394.

Related papers

On the Group Based Cryptography
mehmet kalkan

Journal of Mathematics and System Science 4 (2014) 710-714, 2014

There are quite more applications of group theory. The recent application of group theory is public key (asymmetric) cryptography. All cryptographic algorithms have some weaknesses. To avoid its weakness, some special groups and methods can applied on. We will touch on group based public key cryptography and will give some suggestions in this area.

View PDFchevron_right
Some aspects of group based cryptography
Sot Mathematician

This article was presented in Cryptography Conference 2012 of the Hellenic Military Academy. The article consists of two parts. In the first part is presented a short overview of group-based cryptography. In the second part the notions of group-based cryptography are used to present a secret sharing scheme.

View PDFchevron_right
Group Theory in Lattice-Based Cryptography
Michael John, Otobong Udoaka

International Journal of Mathematics And its Applications, 2023

Group theory plays a fundamental role in lattice-based cryptography, providing a rich mathematical framework for the design and analysis of cryptographic protocols. This paper explores the application of group theory concepts within lattice-based cryptographic systems, focusing on the algebraic structures formed by lattices and their subgroups. The utilization of group theory in lattice-based cryptography enhances the security and efficiency of key exchange, encryption, and digital signatures. Through a mathematical lens, we investigate the foundational principles, theorems, and cryptographic constructions that leverage group theory, shedding light on the symbiotic relationship between group theory and lattice-based cryptography. The paper also proposes cryptographic scheme based on group theory in lattice-based.

View PDFchevron_right
Aspects of Nonabelian Group Based Cryptography: A Survey and Open Problems
Benjamin Fine

Computing Research Repository, 2011

Most common public key cryptosystems and public key exchange protocols presently in use, such as the RSA algorithm, Diffie-Hellman, and elliptic curve methods are number theory based and hence depend on the structure of abelian groups. The strength of computing machinery has made these techniques theoretically susceptible to attack and hence recently there has been an active line of research

View PDFchevron_right
Aspects of Non-Abelian Group-Based Cryptography: A New Approach to Modern Cryptography
Benjamin Fine

math.gc.cuny.edu

Most common public key cryptosystems and public key exchange protocols presently in use, such as the RSA algorithm, Diffie-Hellman, and elliptic curve methods are number theory based and hence depend on the structure of abelian groups. The strength of computing machinery has made these techniques theoretically susceptible to attack and hence recently there has been an active line of research to develop cryptosystems and key exchange protocols using noncommutative cryptographic platforms. This line of investigation has been given the broad title of noncommutative algebraic cryptography. This was initiated by two public key protocols that used the braid groups, one by Ko, Lee et.al.and one by Anshel, Anshel and Goldfeld. The study of these protocols and the group theory surrounding them has had a large effect on research

View PDFchevron_right

Related topics

  • Group Theory
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved