Algebraic properties of cryptosystem PGM
From MaRDI portal
Publication:1202919
DOI10.1007/BF02451113zbMath0763.94014OpenAlexW2080309018MaRDI QIDQ1202919
Nasir D. Memon, Spyros S. Magliveras
Publication date: 22 April 1993
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02451113
cryptographyfinite permutation groupscryptologylogarithmic signaturesmultiple encryptionpermutation group mappingsprivate-key cryptographic system
Related Items
Minimal logarithmic signatures for one type of classical groups ⋮ Factorizations in the elementary abelian \(p\)-group and their cryptographic significance ⋮ The cryptanalysis of a public-key implementation of finite group mappings ⋮ On Minimal Length Factorizations of Finite Groups ⋮ Discrete logarithms for finite groups ⋮ Construction of strongly aperiodic logarithmic signatures ⋮ The existence of minimal logarithmic signatures for the sporadic Suzuki and simple Suzuki groups ⋮ Minimal logarithmic signatures for the unitary group \(U_n(q)\) ⋮ Cryptanalysis of the MST 3 public key cryptosystem ⋮ LOGARITHMIC SIGNATURES FOR ABELIAN GROUPS AND THEIR FACTORIZATION ⋮ The Existence of Minimal Logarithmic Signatures for Some Finite Simple Groups ⋮ Minimal logarithmic signatures for finite groups of Lie type ⋮ A note on the security of \(\text{MST} _{3}\) ⋮ Weak keys in MST\(_{1}\) ⋮ The round functions of cryptosystem PGM generate the symmetric group ⋮ ON GROUP FACTORIZATIONS USING FREE MAPPINGS ⋮ Public key cryptosystem MST3: cryptanalysis and realization ⋮ All exceptional groups of Lie type have minimal logarithmic signatures ⋮ The existence of minimal logarithmic signatures for some finite simple unitary groups ⋮ Multiple symmetric keys using Banach fixed point theorem ⋮ A public key cryptosystem based on non-abelian finite groups ⋮ Algorithms for matrix groups and the Tits alternative ⋮ A weak cipher that generates the symmetric group
Cites Work
- A Mathematical Theory of Communication
- Key-minimal cryptosystems for unconditional secrecy
- Is the data encryption standard a group? (Results of cycling experiments on DES)
- A new random number generator from permutation groups
- Finite Permutation Groups and Finite Simple Groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item