Recommendations
Cites work
- scientific article; zbMATH DE number 3857249 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 691465 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 967945 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A Framework for Efficient and Composable Oblivious Transfer
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- A survey on Polly Cracker systems
- A well-characterized approximation problem
- Additively homomorphic encryption with \(d\)-operand multiplications
- Advances in Cryptology - CRYPTO 2003
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Approximate common divisors via lattices
- Better bootstrapping in fully homomorphic encryption
- Better key sizes (and attacks) for LWE-based encryption
- 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
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- De nugis Groebnerialium. II: Applying Macaulay's trick in order to easily write a Gröbner basis
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
- 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
- Gröbner Bases, Coding, and Cryptography
- Homomorphic encryption: from private-key to public-key
- Homomorphic evaluation of the AES circuit
- Implementing Gentry's fully-homomorphic encryption scheme
- Lattice polly cracker cryptosystems
- Lattice-based Cryptography
- Minimal achievable approximation ratio for MAX-MQ in finite fields
- Multi-instance security and its application to password-based cryptography
- Multiplying matrices faster than coppersmith-winograd
- New Algorithms for Learning in Presence of Errors
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the complexity of computing syzygies
- Polly cracker, revisited
- Polly cracker, revisited, revisited
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- QUAD: A multivariate stream cipher with provable security
- Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- The membership problem for unmixed polynomial ideals is solvable in single exponential time
- When Homomorphism Becomes a Liability
- 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
Cited in
(7)- Pollock and Sturgeon on defeaters
- A fully homomorphic cryptosystem with approximate perfect secrecy
- Polly cracker, revisited
- Polly cracker, revisited, revisited
- Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures
- scientific article; zbMATH DE number 7178072 (Why is no real title available?)
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
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)
