Pages that link to "Item:Q2894427"
From MaRDI portal
The following pages link to Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers (Q2894427):
Displaying 17 items.
- Polly cracker, revisited (Q285245) (← links)
- A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
- CRT-based fully homomorphic encryption over the integers (Q1749613) (← links)
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
- Algorithms for CRT-variant of approximate greatest common divisor problem (Q2025331) (← links)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
- Efficient AGCD-based homomorphic encryption for matrix and vector arithmetic (Q2229267) (← links)
- On the greatest common divisor of shifted sets (Q2343172) (← links)
- Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem (Q2632011) (← links)
- Finding roots in with the successive resultants algorithm (Q2878836) (← links)
- Partial Key Exposure Attack on CRT-RSA (Q2945387) (← links)
- Cryptanalysis of a Homomorphic Encryption Scheme Over Integers (Q2980858) (← links)
- New Multilinear Maps Over the Integers (Q3457114) (← links)
- Cryptanalysis of the Co-ACD Assumption (Q3457128) (← links)
- FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime (Q5738759) (← links)