PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials
From MaRDI portal
Recommendations
- Cryptanalysis of polynomial authentication and signature scheme
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Coding and Cryptography
- A public key encryption scheme based on the polynomial reconstruction problem
- Practical signatures from the partial Fourier recovery problem
Cites work
- An Introduction to Mathematical Cryptography
- Candidate Multilinear Maps from Ideal Lattices
- Choosing parameter sets for NTRUEncrypt with NAEP and SVES-3
- Dimension reduction methods for convolution modular lattices
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- Fully homomorphic encryption using ideal lattices
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- NTRU: A ring-based public key cryptosystem
- Polynomial rings and efficient public key authentication. II
- Practical signatures from the partial Fourier recovery problem
- Public-key cryptosystems from lattice reduction problems
- Sealing the leak on classical NTRU signatures
- Transcript secure signatures based on modular lattices
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(5)- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Cryptanalysis of polynomial authentication and signature scheme
- Practical signatures from the partial Fourier recovery problem
- Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
- Key recovery attack 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)