A public key cryptosystem based on non-abelian finite groups

DOI10.1007/s00145-008-9033-yzbMath1168.94005OpenAlexW2148003739MaRDI QIDQ1027976

Wandi Wei, Tran van Trung, Spyros S. Magliveras, Wolfgang Lempken

Publication date: 30 June 2009

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-008-9033-y

zbMATH Keywords

Suzuki 2-grouppublic-key cryptosystemlogarithmic signaturetrapdoor one-way function

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Minimal logarithmic signatures for one type of classical 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 ⋮ A construction of encryption protocols over some semidirect products ⋮ Pseudorandom number generators based on random covers for finite groups ⋮ On the distribution of the elements of a finite group generated by covers ⋮ 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 classical groups ⋮ Minimal logarithmic signatures for finite groups of Lie type ⋮ A note on the security of \(\text{MST} _{3}\) ⋮ 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 ⋮ Signature scheme using the root extraction problem on quaternions

Cites Work

• Unnamed Item
• Suzuki 2-groups
• Algebraic properties of cryptosystem PGM
• New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Endliche Gruppen I

This page was built for publication: A public key cryptosystem based on non-abelian finite groups