Discrete logarithms for finite groups

DOI10.1007/S00607-009-0032-0zbMATH Open1173.94007OpenAlexW1979595178MaRDI QIDQ2390938FDOQ2390938

Spyros S. Magliveras, Fred Richman, Lee Klingler, 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

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

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)

Cites Work

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

Cited In (9)

• Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
• A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups
• On the distribution of the elements of a finite group generated by covers
• The One-More Discrete Logarithm Assumption in the Generic Group Model
• A note on cyclic groups, finite fields, and the discrete logarithm problem
• Public Key Cryptography - PKC 2005
• Slope packings and coverings, and generic algorithms for the discrete logarithm problem
• Discrete logarithms in \(\mathrm{GF}(p)\)
• On the security of DLCSP over \(\mathrm{GL}_n (\mathbb{F}_q [S_r])\)

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)