Polly cracker, revisited
From MaRDI portal
Publication:285245
DOI10.1007/s10623-015-0048-8zbMath1405.94039OpenAlexW3022480174MaRDI QIDQ285245
Gottfried Herold, Ludovic Perret, Martin R. Albrecht, Jean-Charles Faugère, Pooya Farshim
Publication date: 19 May 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0048-8
Multivariable systems, multidimensional control systems (93C35) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lattice polly cracker cryptosystems
- A well-characterized approximation problem
- QUAD: A multivariate stream cipher with provable security
- Minimal achievable approximation ratio for MAX-MQ in finite fields
- On the complexity of computing syzygies
- The membership problem for unmixed polynomial ideals is solvable in single exponential time
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- De nugis Groebnerialium. II: Applying Macaulay's trick in order to easily write a Gröbner basis
- Why you cannot even hope to use Gröbner bases in public key cryptography: An open letter to a scientist who failed and a challenge to those who have not yet failed
- Comments on the translation of my PhD thesis: ``An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- (Leveled) fully homomorphic encryption without bootstrapping
- Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
- Better Bootstrapping in Fully Homomorphic Encryption
- Polly Cracker, Revisited, Revisited
- Multi-instance Security and Its Application to Password-Based Cryptography
- Homomorphic Evaluation of the AES Circuit
- Approximate common divisors via lattices
- Homomorphic Encryption: From Private-Key to Public-Key
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- New Algorithms for Learning in Presence of Errors
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Polly Cracker, Revisited
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- On Ideal Lattices and Learning with Errors over Rings
- Fully Homomorphic Encryption over the Integers
- Additively Homomorphic Encryption with d-Operand Multiplications
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Gröbner Bases, Coding, and Cryptography
- A Framework for Efficient and Composable Oblivious Transfer
- Lattice-based Cryptography
- A Survey on Polly Cracker Systems
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- When Homomorphism Becomes a Liability
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys
- Multiplying matrices faster than coppersmith-winograd
- Advances in Cryptology - CRYPTO 2003
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- On lattices, learning with errors, random linear codes, and cryptography
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
This page was built for publication: Polly cracker, revisited
