scholarly journals SON CONSTRUCTION OF CRYPTOGRAPHIC SYSTEMS OVER UNITS OF GROUP RINGS

2015 ◽  
Vol 7 (3) ◽  
Author(s):  
T. Hanoymak ◽  
O. Kusmus
Keyword(s):  
Group Rings

Commutative nil-clean and $\pi$-Regular Group Rings

2019 ◽  
Vol 2019 (3) ◽  
pp. 33-39
Author(s):  
P.V. Danchev
Keyword(s):  
Group Rings ◽  
Regular Group

A note on Lie nilpotent group rings

1992 ◽  
Vol 45 (3) ◽  
pp. 503-506 ◽  
Author(s):  
R.K. Sharma ◽  
Vikas Bist
Keyword(s):  
Nilpotent Group ◽  
Group Algebra ◽  
Group Rings ◽  
Group Of Units

Let KG be the group algebra of a group G over a field K of characteristic p > 0. It is proved that the following statements are equivalent: KG is Lie nilpotent of class ≤ p, KG is strongly Lie nilpotent of class ≤ p and G′ is a central subgroup of order p. Also, if G is nilpotent and G′ is of order pn then KG is strongly Lie nilpotent of class ≤ pn and both U(KG)/ζ(U(KG)) and U(KG)′ are of exponent pn. Here U(KG) is the group of units of KG. As an application it is shown that for all n ≤ p+ 1, γn(L(KG)) = 0 if and only if γn(KG) = 0.

Subgroups induced by certain ideals of free group rings

1983 ◽  
Vol 11 (22) ◽  
pp. 2519-2525 ◽  
Author(s):  
Chander Kanta Gupta
Keyword(s):  
Free Group ◽  
Group Rings

On *-clean non-commutative group rings

2016 ◽  
Vol 15 (08) ◽  
pp. 1650150 ◽  
Author(s):  
Hongdi Huang ◽  
Yuanlin Li ◽  
Gaohua Tang
Keyword(s):  
Finite Field ◽  
Local Ring ◽  
Group Algebra ◽  
Rational Numbers ◽  
Semisimple Group ◽  
Group Algebras ◽  
Group Rings ◽  
Dihedral Groups ◽  
Commutative Local Ring ◽  
Generalized Quaternion

A ring with involution ∗ is called ∗-clean if each of its elements is the sum of a unit and a projection (∗-invariant idempotent). In this paper, we consider the group algebras of the dihedral groups [Formula: see text], and the generalized quaternion groups [Formula: see text] with standard involution ∗. For the non-semisimple group algebra case, we characterize the ∗-cleanness of [Formula: see text] with a prime [Formula: see text], and [Formula: see text] with [Formula: see text], where [Formula: see text] is a commutative local ring. For the semisimple group algebra case, we investigate when [Formula: see text] is ∗-clean, where [Formula: see text] is the field of rational numbers [Formula: see text] or a finite field [Formula: see text] and [Formula: see text] or [Formula: see text].

scholarly journals A note on zero divisors in group-rings

1972 ◽  
Vol 31 (2) ◽  
pp. 357-357 ◽  
Author(s):  
Jacques Lewin
Keyword(s):  
Group Rings ◽  
Zero Divisors

scholarly journals Gauss Units in Integral Group Rings

1998 ◽  
Vol 204 (2) ◽  
pp. 588-596 ◽  
Author(s):  
Olaf Neisse ◽  
Sudarshan K. Sehgal
Keyword(s):  
Group Rings ◽  
Integral Group ◽  
Integral Group Rings

Semi-Prime Twisted Group Rings

1976 ◽  
Vol s2-12 (4) ◽  
pp. 413-418 ◽  
Author(s):  
A. Reid
Keyword(s):  
Group Rings ◽  
Twisted Group

scholarly journals Improved cryptanalysis of a ElGamal Cryptosystem Based on Matrices Over Group Rings

2020 ◽  
Vol 15 (1) ◽  
pp. 266-279
Author(s):  
Atul Pandey ◽  
Indivar Gupta ◽  
Dhiraj Kumar Singh
Keyword(s):  
Discrete Logarithm ◽  
Public Key Cryptography ◽  
Public Key ◽  
Quantum Computers ◽  
Group Rings ◽  
Diffie Hellman ◽  
Algebra Approach ◽  
Elgamal Cryptosystem ◽  
Diffie Hellman Key Exchange ◽  
Equivalent Keys

AbstractElGamal cryptosystem has emerged as one of the most important construction in Public Key Cryptography (PKC) since Diffie-Hellman key exchange protocol was proposed. However, public key schemes which are based on number theoretic problems such as discrete logarithm problem (DLP) are at risk because of the evolution of quantum computers. As a result, other non-number theoretic alternatives are a dire need of entire cryptographic community.In 2016, Saba Inam and Rashid Ali proposed a ElGamal-like cryptosystem based on matrices over group rings in ‘Neural Computing & Applications’. Using linear algebra approach, Jia et al. provided a cryptanalysis for the cryptosystem in 2019 and claimed that their attack could recover all the equivalent keys. However, this is not the case and we have improved their cryptanalysis approach and derived all equivalent key pairs that can be used to totally break the ElGamal-like cryptosystem proposed by Saba and Rashid. Using the decomposition of matrices over group rings to larger size matrices over rings, we have made the cryptanalysing algorithm more practical and efficient. We have also proved that the ElGamal cryptosystem proposed by Saba and Rashid does not achieve the security of IND-CPA and IND-CCA.

scholarly journals Higher K -theory of group-rings of virtually infinite cyclic groups

2003 ◽  
Vol 325 (4) ◽  
pp. 711-726 ◽  
Author(s):  
Aderemi O. Kuku ◽  
Guoping Tang
Keyword(s):  
Group Rings ◽  
Cyclic Groups ◽  
K Theory
Sign in / Sign up

Export Citation Format

Share Document