PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1588480 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1088230 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1852140 (Why is no real title available?)
- An Introduction to Mathematical Cryptography
- Candidate Multilinear Maps from Ideal Lattices
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- Fully homomorphic encryption using ideal lattices
- Practical signatures from the partial Fourier recovery problem
- Sealing the leak on classical NTRU signatures
- Topics in Cryptology – CT-RSA 2005
- Transcript secure signatures based on modular lattices
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(5)- scientific article; zbMATH DE number 1612518 (Why is no real title available?)
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Key recovery attack on the partial Vandermonde knapsack problem
- Practical signatures from the partial Fourier recovery problem
- Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
This page was built for publication: PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q887439)