Applications of finite non-abelian simple groups to cryptography in the quantum era
From MaRDI portal
Publication:6564014
DOI10.1007/s44007-024-00096-zzbMATH Open1542.94126MaRDI QIDQ6564014
María Isabel González Vasco, Eilidh McKemmie, Delaram Kahrobaei
Publication date: 28 June 2024
Published in: La Matematica (Search for Journal in Brave)
Linear algebraic groups over finite fields (20G40) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite simple groups and their classification (20D05) Simple groups: alternating groups and groups of Lie type (20D06) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compositions of linear functions and applications to hashing
- Short expressions of permutations as products and cryptanalysis of the algebraic eraser
- Effective black-box constructive recognition of classical groups.
- Minimal logarithmic signatures for classical groups
- Approximate subgroups of linear groups.
- Diameters of Cayley graphs of Chevalley groups
- The existence of minimal logarithmic signatures for the sporadic Suzuki and simple Suzuki groups
- Small-diameter Cayley graphs for finite simple groups
- Minimal logarithmic signatures for finite groups of Lie type
- A note on the security of \(\text{MST} _{3}\)
- A public key cryptosystem based on non-abelian finite groups
- Efficient representation of perm groups
- On the diameter of permutation groups
- Algebraic properties of cryptosystem PGM
- An algorithm for solving the factorization problem in permutation groups
- Hash functions and Cayley graphs
- The hidden subgroup problem and post-quantum group-based cryptography
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
- The existence of minimal logarithmic signatures for some finite simple unitary groups
- Babai's conjecture for high-rank classical groups with random generators
- Navigating in the Cayley graph of \(\mathrm{SL}_2(\mathbb F_p)\) and applications to hashing
- Growth and generation in \(\text{SL}_2(\mathbb{Z}/p\mathbb{Z})\).
- Cryptanalysis of the Tillich-Zémor hash function
- On the diameter of permutation groups.
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\)
- Weak keys in MST\(_{1}\)
- Navigating in the Cayley graphs of \(\text{SL}_N(\mathbb{Z})\) and \(\text{SL}_N(\mathbb{F}_p)\).
- Black box classical groups.
- Cryptographic Hash Functions and Expander Graphs: The End of the Story?
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Fully Homomorphic Encryption with Polylog Overhead
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Public key cryptosystem MST3: cryptanalysis and realization
- Preimages for the Tillich-Zémor Hash Function
- Normal subgroup reconstruction and quantum computation using group representations
- Rubik’s for Cryptographers
- Growth in finite simple groups of Lie type
- Full Cryptanalysis of LPS and Morgenstern Hash Functions
- The Symmetric Group Defies Strong Fourier Sampling
- Cryptanalysis of the MST 3 public key cryptosystem
- Communication Complexity in Algebraic Two-Party Protocols
- The Finite Simple Groups
- The minimum-length generator sequence problem is NP-hard
- The Existence of Minimal Logarithmic Signatures for Some Finite Simple Groups
- On Minimal Factorisations of Sporadic Groups
- On Minimal Length Factorizations of Finite Groups
- Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory
- Introduction to Modern Cryptography
- Fully homomorphic encryption using ideal lattices
- Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
- Constructing elliptic curve isogenies in quantum subexponential time
- General Impossibility of Group Homomorphic Encryption in the Quantum World
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- On Minimal Logarithmic Signatures of Finite Groups
- On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols
- Limitations of quantum coset states for graph isomorphism
- Group-based Cryptography in the Quantum Era
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- On the complexity of diameter and related problems in permutation groups
This page was built for publication: Applications of finite non-abelian simple groups to cryptography in the quantum era
