On the semidirect discrete logarithm problem in finite groups

DOI10.1007/978-981-96-0944-4_11MaRDI QIDQ6965152zbMATH OpenFDO

Authors Christopher Battarbee, Giacomo Borin, Julian M. A. Brough, Ryann Cartor, Tobias Hemmert, Nadia Heninger, David Jao, Delaram Kahrobaei, Laura Maddison, Edoardo Persichetti, Angela Robinson, Daniel Smith-Tone, Rainer Steinwandt

Publication date 3 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-0944-4_11

zbMATH Keywords

group-based cryptographypost-quantum cryptographysemidirect discrete logarithm problem

Mathematics Subject Classification ID

Linear algebraic groups over finite fields (20G40) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• A fast implementation of the Monster group. The Monster has been tamed
• A linear decomposition attack
• Black box exceptional groups of Lie type.
• Black box exceptional groups of Lie type. II.
• Black box groups isomorphic to \(\mathrm{PGL}(2,2^e)\).
• Composition Factors from the Group Ring and Artin's Theorem on Orders of Simple Groups
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞)
• Cryptanalysis of ``MAKE
• Der reduzierte Rang einer Gruppe.
• Effective black-box constructive recognition of classical groups.
• Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem
• Fast constructive recognition of black box orthogonal groups.
• Fast constructive recognition of black box symplectic groups.
• Fast Constructive Recognition of Black-Box Unitary Groups
• Fast recognition of alternating groups of unknown degree.
• Fast recognition of classical groups over large fields
• scientific article; zbMATH DE number 5976624 (Why is no real title available?)
• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 1284153 (Why is no real title available?)
• scientific article; zbMATH DE number 1111401 (Why is no real title available?)
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• MAKE: a matrix action key exchange
• On constructive recognition of a black box \(\text{PSL}(d,q)\).
• Polynomial-time theory of matrix groups
• Public key exchange using semidirect product of (semi)groups
• Quantum computation of discrete logarithms in semigroups
• Semidirect product key exchange: the state of play
• SPDH-Sign: Towards Efficient, Post-quantum Group-Based Signatures
• The computational matrix group project.
• The Finite Simple Groups
• Tropical cryptography II: Extensions by homomorphisms
• Using Semidirect Product of (Semi)groups in Public Key Cryptography

Cited in

(1)

• On the classical hardness of the semidirect discrete logarithm problem in finite groups

This page was built for publication: On the semidirect discrete logarithm problem in finite groups

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