scholarly journals A counterexample to the unit conjecture for group rings

2021 ◽  
Vol 194 (3) ◽  
pp. 967-979
Author(s):  
Giles Gardam
Keyword(s):  
2019 ◽  
Vol 2019 (3) ◽  
pp. 33-39
Author(s):  
P.V. Danchev
Keyword(s):  

1992 ◽  
Vol 45 (3) ◽  
pp. 503-506 ◽  
Author(s):  
R.K. Sharma ◽  
Vikas Bist

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.


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

2016 ◽  
Vol 15 (08) ◽  
pp. 1650150 ◽  
Author(s):  
Hongdi Huang ◽  
Yuanlin Li ◽  
Gaohua Tang

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].


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

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

2020 ◽  
Vol 15 (1) ◽  
pp. 266-279
Author(s):  
Atul Pandey ◽  
Indivar Gupta ◽  
Dhiraj Kumar Singh

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.


2003 ◽  
Vol 325 (4) ◽  
pp. 711-726 ◽  
Author(s):  
Aderemi O. Kuku ◽  
Guoping Tang
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document