Computing primitive idempotents in finite commutative rings and applications
DOI10.1016/j.jsc.2023.102294OpenAlexW4389778428MaRDI QIDQ6149152
Mugurel Barcau, Vicentiu Pasol
Publication date: 5 February 2024
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2023.102294
primitive idempotentsquantum computinggeneric ring modelhomomorphic encryption schemesblack-box rings
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quantum computation (81P68) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Quantum cryptography (quantum-theoretic aspects) (81P94) Classical models of computation (Turing machines, etc.) (68Q04)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum computation of discrete logarithms in semigroups
- Group homomorphic encryption: characterizations, impossibility results, and applications
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- On CCA-Secure Somewhat Homomorphic Encryption
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Quantum algorithms for algebraic problems
- Algorithms for Black-Box Fields and their Application to Cryptography
- Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Fully Homomorphic Encryption over the Integers
- The Complexity of Black-Box Ring Problems
- On the Analysis of Cryptographic Assumptions in the Generic Ring Model
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Homomorphic Encryption
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys
- How to Garble Arithmetic Circuits
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Factoring Polynomials Over Large Finite Fields
- On lattices, learning with errors, random linear codes, and cryptography
- Breaking RSA Generically Is Equivalent to Factoring
- Factoring polynomials over finite fields: A survey
This page was built for publication: Computing primitive idempotents in finite commutative rings and applications
