Skip to main content
Erschienen in: Neural Computing and Applications 11/2018

01.12.2016 | Original Article

A cryptosystem with noncommutative platform groups

verfasst von: Shamsa Kanwal, Rashid Ali

Erschienen in: Neural Computing and Applications | Ausgabe 11/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This paper presents a new public key cryptosystem that uses noncommutative groups as platform group. The underlying hard problem of the proposed cryptosystem is a combination of discrete log problem and conjugacy search problem. Due to use of noncommutative platform groups, it is expected that the presented cryptosystem provides higher levels of security against known attacks. Some important issues regarding the choice of platform and parameters of this cryptosystem are addressed. Further, a brief analysis of security aspects is also presented.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literatur
2.
Zurück zum Zitat Barker E, Roginsky A (2015) Recommendation for transitioning the use of cryptographic algorithms and key lengths Barker E, Roginsky A (2015) Recommendation for transitioning the use of cryptographic algorithms and key lengths
3.
Zurück zum Zitat Charalambos M, Koupparis C (2012) Non-commutative cryptography: Diffie-Hellman and CCA secure cryptosystems using matrices over group rings and digital signatures, ProQuest LLC, Ann Arbor, Thesis (Ph.D.), City University of New York Charalambos M, Koupparis C (2012) Non-commutative cryptography: Diffie-Hellman and CCA secure cryptosystems using matrices over group rings and digital signatures, ProQuest LLC, Ann Arbor, Thesis (Ph.D.), City University of New York
5.
Zurück zum Zitat ElGamal T (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31:469–472MathSciNetCrossRefMATH ElGamal T (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31:469–472MathSciNetCrossRefMATH
6.
Zurück zum Zitat Gu L, Wang L, Ota K, Dong M, Cao Z, Yang Y (2013) New public key cryptosystems based on non-Abelian factorization problems. Secur Commun Netw 6(7):912–922CrossRef Gu L, Wang L, Ota K, Dong M, Cao Z, Yang Y (2013) New public key cryptosystems based on non-Abelian factorization problems. Secur Commun Netw 6(7):912–922CrossRef
7.
Zurück zum Zitat Hofheinz D, Steinwandt R (2003) A practical attack on some braid group based cryptographic primitives, public key cryptography PKC. Springer, BerlinMATH Hofheinz D, Steinwandt R (2003) A practical attack on some braid group based cryptographic primitives, public key cryptography PKC. Springer, BerlinMATH
8.
Zurück zum Zitat Kahrobaei D, Koupparis C, Shpilrain V (2013) Public key exchange using matrices over group rings. Groups Complex Cryptol 5(1):97–115MathSciNetMATH Kahrobaei D, Koupparis C, Shpilrain V (2013) Public key exchange using matrices over group rings. Groups Complex Cryptol 5(1):97–115MathSciNetMATH
9.
Zurück zum Zitat Ko KH, Lee SJ, Cheon JH, Han JH, Kang JS, Park C (2000) New public-key cryptosystems using Braid groups, Advances in Cryptography, In: Proceedings of Crypto 2000, Lecture Notes in Computer Science 1880, 166–183 Ko KH, Lee SJ, Cheon JH, Han JH, Kang JS, Park C (2000) New public-key cryptosystems using Braid groups, Advances in Cryptography, In: Proceedings of Crypto 2000, Lecture Notes in Computer Science 1880, 166–183
10.
Zurück zum Zitat Lee SJ, Lee E (2002) Potential weaknesses of the commutator key agreement protocol based on braid groups. In: Knudsen L (ed) Advances in cryptology EUROCRYPT. Springer, Berlin, pp 14–28 Lee SJ, Lee E (2002) Potential weaknesses of the commutator key agreement protocol based on braid groups. In: Knudsen L (ed) Advances in cryptology EUROCRYPT. Springer, Berlin, pp 14–28
11.
Zurück zum Zitat Magyarik R, Wagner NR (1985) A public key cryptosystem based on the word problem, advances in cryptology–CRYPTO 1984, Lecture Notes in Computer Science 196, 19–36. Springer, Berlin Magyarik R, Wagner NR (1985) A public key cryptosystem based on the word problem, advances in cryptology–CRYPTO 1984, Lecture Notes in Computer Science 196, 19–36. Springer, Berlin
12.
Zurück zum Zitat Menezes A, Wu Y (1997) The discrete logarithm problem in GL(n, q). Ars Combinatorica 47:23–32MathSciNetMATH Menezes A, Wu Y (1997) The discrete logarithm problem in GL(n, q). Ars Combinatorica 47:23–32MathSciNetMATH
13.
Zurück zum Zitat Mullan C (2012) Some Results in Group-Based Cryptography, Thesis submitted to the University of London for the Degree of Doctor of Philosophy Mullan C (2012) Some Results in Group-Based Cryptography, Thesis submitted to the University of London for the Degree of Doctor of Philosophy
14.
Zurück zum Zitat Myasnikov AD, Ushakov A (2009) Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux key agreement protocol. Groups Complex Cryptol 1:63–75MathSciNetMATH Myasnikov AD, Ushakov A (2009) Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux key agreement protocol. Groups Complex Cryptol 1:63–75MathSciNetMATH
15.
Zurück zum Zitat Myasnikov AG, Shpilrain V, Ushakov A (2007) Group-based cryptography, advanced courses in mathematics. CRM Barcelona, Spain Myasnikov AG, Shpilrain V, Ushakov A (2007) Group-based cryptography, advanced courses in mathematics. CRM Barcelona, Spain
16.
Zurück zum Zitat Rivest R, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120–126MathSciNetCrossRefMATH Rivest R, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120–126MathSciNetCrossRefMATH
17.
Zurück zum Zitat Rotman J (1965) The theory of groups. Allyn and Bacon, BostonMATH Rotman J (1965) The theory of groups. Allyn and Bacon, BostonMATH
18.
Zurück zum Zitat Shpilrain V (2008) Cryptanalysis of Stickel’s key exchange scheme. Proc Comput Sci Russia 5010:283–288MATH Shpilrain V (2008) Cryptanalysis of Stickel’s key exchange scheme. Proc Comput Sci Russia 5010:283–288MATH
20.
Zurück zum Zitat Stickel E (2005) A new method for exchanging secret keys. In: Proceedings of the Thirteenth International Conference on Information Technology and Applications, (ICITA 2005) 2:426–430 Stickel E (2005) A new method for exchanging secret keys. In: Proceedings of the Thirteenth International Conference on Information Technology and Applications, (ICITA 2005) 2:426–430
Metadaten
Titel
A cryptosystem with noncommutative platform groups
verfasst von
Shamsa Kanwal
Rashid Ali
Publikationsdatum
01.12.2016
Verlag
Springer London
Erschienen in
Neural Computing and Applications / Ausgabe 11/2018
Print ISSN: 0941-0643
Elektronische ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-016-2723-8

Weitere Artikel der Ausgabe 11/2018

Neural Computing and Applications 11/2018 Zur Ausgabe

Premium Partner