Discrete logarithms for finite groups

DOI10.1007/S00607-009-0032-0MaRDI QIDQ2390938zbMATH OpenOpenAlexFDO

Authors Lee Klingler, Spyros S. Magliveras, Fred Richman, Michal Sramka

Publication date 10 August 2009

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-009-0032-0

zbMATH Keywords

discrete logarithmuniformitypresentationsnon-abelian groupslinear groupsshort relations

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) Linear algebraic groups over finite fields (20G40)

Recommendations

• Weak discrete logarithms in non-abelian groups
• Crypto applications of combinatorial group theory
• A note on cyclic groups, finite fields, and the discrete logarithm problem
• The discrete logarithm problem in the group of non-singular circulant matrices
• The discrete logarithm problem

Cites work

• scientific article; zbMATH DE number 1262447 (Why is no real title available?)
• scientific article; zbMATH DE number 1759785 (Why is no real title available?)
• scientific article; zbMATH DE number 1842507 (Why is no real title available?)
• scientific article; zbMATH DE number 2196515 (Why is no real title available?)
• A Practical Attack on a Braid Group Based Cryptographic Protocol
• A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups
• A public key cryptosystem based on non-abelian finite groups
• Algebraic properties of cryptosystem PGM
• An algebraic method for public-key cryptography
• Chosen ciphertext attacks as common vulnerability of some group- and polynomial-based encryption schemes
• Combinatorial group theory and public key cryptography
• Cryptanalysis of Stickel’s Key Exchange Scheme
• Cryptanalysis of a homomorphic public-key cryptosystem over a finite group
• Discrete logarithms: The past and the future
• Foundations of Cryptography
• New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
• New directions in cryptography
• On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
• On public-key cryptosystems based on combinatorial group theory
• On the security of Stickel's key exchange scheme
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Public key cryptography based on semigroup actions
• The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
• The minimum-length generator sequence problem is NP-hard

Cited in

(14)

• Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
• The One-More Discrete Logarithm Assumption in the Generic Group Model
• Weak discrete logarithms in non-abelian groups
• On the security of DLCSP over \(\mathrm{GL}_n (\mathbb{F}_q [S_r])\)
• On the distribution of the elements of a finite group generated by covers
• Public Key Cryptography - PKC 2005
• A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups
• Crypto applications of combinatorial group theory
• Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
• Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\)
• A note on cyclic groups, finite fields, and the discrete logarithm problem
• The discrete logarithm problem in the group of non-singular circulant matrices
• Discrete logarithms in \(\mathrm{GF}(p)\)
• Slope packings and coverings, and generic algorithms for the discrete logarithm problem

This page was built for publication: Discrete logarithms for finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390938)