Polly cracker, revisited
From MaRDI portal
Publication:285245
DOI10.1007/S10623-015-0048-8zbMATH Open1405.94039OpenAlexW3022480174MaRDI QIDQ285245FDOQ285245
Authors: Martin R. Albrecht, Jean-Charles Faugère, Pooya Farshim, Gottfried Herold, Ludovic Perret 
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
Recommendations
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Multivariable systems, multidimensional control systems (93C35)
Cites Work
- Better bootstrapping in fully homomorphic encryption
- Homomorphic evaluation of the AES circuit
- Implementing Gentry's fully-homomorphic encryption scheme
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- On ideal lattices and learning with errors over rings
- Fully homomorphic encryption over the integers
- Additively homomorphic encryption with \(d\)-operand multiplications
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption over the integers with shorter public keys
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Title not available (Why is that?)
- Multiplying matrices faster than coppersmith-winograd
- Title not available (Why is that?)
- New Algorithms for Learning in Presence of Errors
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Title not available (Why is that?)
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- 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
- 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
- Polly cracker, revisited, revisited
- Multi-instance security and its application to password-based cryptography
- Approximate common divisors via lattices
- Homomorphic encryption: from private-key to public-key
- Better key sizes (and attacks) for LWE-based encryption
- Polly cracker, revisited
- Title not available (Why is that?)
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Gröbner Bases, Coding, and Cryptography
- A Framework for Efficient and Composable Oblivious Transfer
- Lattice-based Cryptography
- A survey on Polly Cracker systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- When Homomorphism Becomes a Liability
- Advances in Cryptology - CRYPTO 2003
- 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
- Lattice polly cracker cryptosystems
- A well-characterized approximation problem
- QUAD: A multivariate stream cipher with provable security
Cited In (5)
Uses Software
This page was built for publication: Polly cracker, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285245)
