Computing primitive idempotents in finite commutative rings and applications

DOI10.1016/J.JSC.2023.102294MaRDI QIDQ6149152zbMATH OpenOpenAlexFDO

Authors Mugurel Barcau, Vicenţiu Paşol

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

zbMATH Keywords

quantum computingprimitive idempotentsgeneric ring modelhomomorphic encryption schemesblack-box rings

Mathematics Subject Classification ID

Cryptography (94A60) Quantum computation (81P68) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Quantum cryptography (quantum-theoretic aspects) (81P94) Classical models of computation (Turing machines, etc.) (68Q04)

Recommendations

• The Complexity of Black-Box Ring Problems
• On the IND-CPA security of ring homomorphic encryption schemes over \(\mathbb{F}_2\)
• On Black-Box Ring Extraction and Integer Factorization
• Homomorphic encryption and some black box attacks
• Idempotent computation over finite fields

Cites work

• scientific article; zbMATH DE number 2086711 (Why is no real title available?)
• scientific article; zbMATH DE number 3265895 (Why is no real title available?)
• scientific article; zbMATH DE number 3279238 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Algorithms for black-box fields and their application to cryptography
• Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
• Breaking RSA Generically Is Equivalent to Factoring
• Decomposing finite Abelian groups
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Factoring Polynomials Over Large Finite Fields
• Factoring polynomials over finite fields: A survey
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption over the integers with shorter public keys
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption with relatively small key and ciphertext sizes
• Group homomorphic encryption: characterizations, impossibility results, and applications
• Homomorphic encryption
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• How to garble arithmetic circuits
• On CCA-Secure Somewhat Homomorphic Encryption
• On lattices, learning with errors, random linear codes, and cryptography
• On the analysis of cryptographic assumptions in the generic ring model
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum algorithms for algebraic problems
• Quantum computation of discrete logarithms in semigroups
• The Complexity of Black-Box Ring Problems

This page was built for publication: Computing primitive idempotents in finite commutative rings and applications

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