PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials

DOI10.1007/s10623-015-0089-zzbMath1356.94061OpenAlexW605753035WikidataQ56987142 ScholiaQ56987142MaRDI QIDQ887439

Jeffrey 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

zbMATH Keywords

discrete Fourier transformpublic key cryptographylattice-based cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems ⋮ Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem

Uses Software

• NTRU

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sealing the Leak on Classical NTRU Signatures
• Transcript Secure Signatures Based on Modular Lattices
• Trapdoors for hard lattices and new cryptographic constructions
• Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
• Candidate Multilinear Maps from Ideal Lattices
• Practical Signatures from the Partial Fourier Recovery Problem
• Fully homomorphic encryption using ideal lattices
• An Introduction to Mathematical Cryptography
• Topics in Cryptology – CT-RSA 2005

This page was built for publication: PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials