PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials
DOI10.1007/S10623-015-0089-ZzbMATH Open1356.94061OpenAlexW605753035WikidataQ56987142 ScholiaQ56987142MaRDI QIDQ887439FDOQ887439
Authors: Jeff Hoffstein, Joseph H. Silverman 
Publication date: 26 October 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0089-z
Recommendations
Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Fully homomorphic encryption using ideal lattices
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2005
- An Introduction to Mathematical Cryptography
- Candidate Multilinear Maps from Ideal Lattices
- Title not available (Why is that?)
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- Sealing the leak on classical NTRU signatures
- Transcript secure signatures based on modular lattices
- Practical signatures from the partial Fourier recovery problem
Cited In (5)
- Title not available (Why is that?)
- 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
Uses Software
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)
