scholarly journals A New Encryption Scheme Based on Groupring

2021 ◽  
Author(s):  
Saba Inam ◽  
Shamsa Kanwal ◽  
Rashid Ali
Keyword(s):  
Good Choice ◽  
Public Key ◽  
General Linear ◽  
Linear Groups ◽  
Search Problem ◽  
Public Key Encryption ◽  
General Linear Groups ◽  
Encryption Schemes ◽  
Conjugacy Search Problem ◽  
Conjugacy Search

Security of some present day public key cryptosystem (PKC) is based on general linear groups as it is a good choice for developing such types of cryptosystems. This study presents various public key encryption schemes based on general linear groups. Different techniques including automorphisms in connection with conjugacy search problem and its generalization are used to develop these schemes. Further, the grouprings are chosen as a platform to enhance the security and efficiency. Numerous aspects related to our new proposal are also elaborated.

scholarly journals Cryptanalysis of matrix conjugation schemes

2014 ◽  
Vol 8 (2) ◽  
Author(s):  
Alex D. Myasnikov ◽  
Alexander Ushakov
Keyword(s):  
Heuristic Algorithm ◽  
Authentication Protocol ◽  
Public Key ◽  
Search Problem ◽  
Public Key Cryptosystem ◽  
Conjugacy Search Problem ◽  
Parameter Values ◽  
Conjugacy Search

Abstract.In this paper we cryptanalyze two protocols: the Grigoriev–Shpilrain authentication protocol and a public key cryptosystem due to Wang, Wang, Cao, Okamoto and Shao. Both of these protocols use the computational hardness of some variations of the conjugacy search problem in a class of noncommutative monoids. We devise a practical heuristic algorithm solving those problems. As a conclusion we claim that these protocols are insecure for the proposed parameter values.

Public-Key Encryption

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Elliptic Curve ◽  
Public Key Cryptography ◽  
Public Key ◽  
Public Key Encryption ◽  
Hybrid Encryption ◽  
Public Key Cryptosystems ◽  
Encryption And Decryption ◽  
Encryption Schemes ◽  
Hard Problems ◽  
Set Up

In this chapter, we introduce public-key encryption. We first consider the motivation behind the concept of public-key cryptography and introduce the hard problems on which popular public-key encryption schemes are based. We then discuss two of the best-known public-key cryptosystems, RSA and ElGamal. For each of these public-key cryptosystems, we discuss how to set up key pairs and perform basic encryption and decryption. We also identify the basis for security for each of these cryptosystems. We then compare RSA, ElGamal, and elliptic-curve variants of ElGamal from the perspectives of performance and security. Finally, we look at how public-key encryption is used in practice, focusing on the popular use of hybrid encryption.

scholarly journals general linear groups

1997 ◽  
Vol 90 (3) ◽  
pp. 549-576 ◽  
Author(s):  
Avner Ash ◽  
Mark McConnell
Keyword(s):  
General Linear ◽  
Linear Groups ◽  
General Linear Groups
Sign in / Sign up

Export Citation Format

Share Document