Applications of finite non-abelian simple groups to cryptography in the quantum era
From MaRDI portal
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) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) Linear algebraic groups over finite fields (20G40) Data encryption (aspects in computer science) (68P25) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)
Recommendations
- Applications of group theory in cryptography. Post-quantum group-based cryptography
- The hidden subgroup problem and post-quantum group-based cryptography
- Harmonic analysis on finite groups, number theory and efficient quantum cryptographic algorithms.
- scientific article; zbMATH DE number 5982274
- Group theoretic cryptography
Cites work
- A note on the security of \(\text{MST} _{3}\)
- A public key cryptosystem based on non-abelian finite groups
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Algebraic properties of cryptosystem PGM
- An algorithm for solving the factorization problem in permutation groups
- Approximate subgroups of linear groups.
- Babai's conjecture for high-rank classical groups with random generators
- Black box classical groups.
- Communication Complexity in Algebraic Two-Party Protocols
- Compositions of linear functions and applications to hashing
- Constructing elliptic curve isogenies in quantum subexponential time
- Cryptanalysis of the \(MST_{3}\) public key cryptosystem
- Cryptanalysis of the Tillich-Zémor hash function
- Cryptographic hash functions and expander graphs: the end of the story?
- Diameters of Cayley graphs of Chevalley groups
- Effective black-box constructive recognition of classical groups.
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Efficient fully homomorphic encryption from (standard) LWE
- Efficient representation of perm groups
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Full Cryptanalysis of LPS and Morgenstern Hash Functions
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- General impossibility of group homomorphic encryption in the quantum world
- Group-based Cryptography in the Quantum Era
- Growth and generation in \(\text{SL}_2(\mathbb{Z}/p\mathbb{Z})\).
- Growth in finite simple groups of Lie type
- Hash functions and Cayley graphs
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 5485489 (Why is no real title available?)
- scientific article; zbMATH DE number 15472 (Why is no real title available?)
- scientific article; zbMATH DE number 46141 (Why is no real title available?)
- scientific article; zbMATH DE number 177615 (Why is no real title available?)
- scientific article; zbMATH DE number 3500030 (Why is no real title available?)
- scientific article; zbMATH DE number 715350 (Why is no real title available?)
- scientific article; zbMATH DE number 1917729 (Why is no real title available?)
- scientific article; zbMATH DE number 2102392 (Why is no real title available?)
- scientific article; zbMATH DE number 2102393 (Why is no real title available?)
- scientific article; zbMATH DE number 2115087 (Why is no real title available?)
- scientific article; zbMATH DE number 799789 (Why is no real title available?)
- scientific article; zbMATH DE number 1406765 (Why is no real title available?)
- scientific article; zbMATH DE number 1456817 (Why is no real title available?)
- scientific article; zbMATH DE number 3341276 (Why is no real title available?)
- Introduction to Modern Cryptography
- Minimal logarithmic signatures for classical groups
- Minimal logarithmic signatures for finite groups of Lie type
- Navigating in the Cayley graph of \(\mathrm{SL}_2(\mathbb F_p)\) and applications to hashing
- Navigating in the Cayley graphs of \(\text{SL}_N(\mathbb{Z})\) and \(\text{SL}_N(\mathbb{F}_p)\).
- Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
- Normal subgroup reconstruction and quantum computation using group representations
- On Minimal Factorisations of Sporadic Groups
- On Minimal Length Factorizations of Finite Groups
- On Minimal Logarithmic Signatures of Finite Groups
- On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
- On the complexity of diameter and related problems in permutation groups
- On the diameter of permutation groups
- On the diameter of permutation groups.
- On the diameter of the symmetric group: polynomial bounds.
- Preimages for the Tillich-Zémor hash function
- Public key cryptosystem MST\(_{3}\): cryptanalysis and realization
- Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
- Rubik’s for Cryptographers
- Short expressions of permutations as products and cryptanalysis of the algebraic eraser
- Small-diameter Cayley graphs for finite simple groups
- The existence of minimal logarithmic signatures for some finite simple groups
- The existence of minimal logarithmic signatures for some finite simple unitary groups
- The existence of minimal logarithmic signatures for the sporadic Suzuki and simple Suzuki groups
- The Finite Simple Groups
- The hidden subgroup problem and permutation group theory
- The hidden subgroup problem and post-quantum group-based cryptography
- The minimum-length generator sequence problem is NP-hard
- The Symmetric Group Defies Strong Fourier Sampling
- Towards constructing fully homomorphic encryption without ciphertext noise from group theory
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\)
- Weak keys in MST\(_{1}\)
Cited in
(4)- Applications of group theory in cryptography. Post-quantum group-based cryptography
- The group factorization problem in finite groups of Lie type
- Finitely presented groups. With applications in post-quantum cryptography and artificial intelligence
- Oblivious pseudorandom functions in non-commutative groups
This page was built for publication: Applications of finite non-abelian simple groups to cryptography in the quantum era
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564014)
