scientific article

Jill Pipher, Jeffrey Hoffstein, Joseph H. Silverman

Publication date: 5 November 1998

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1423/14230267.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items (only showing first 100 items - show all)

Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients ⋮ Matrix Lie group as an algebraic structure for NTRU like cryptosystem ⋮ Meta-heuristic approaches to solve shortest lattice vector problem ⋮ RLWE/PLWE equivalence for totally real cyclotomic subextensions via quasi-Vandermonde matrices ⋮ Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions ⋮ Homomorphic Encryption Standard ⋮ A new perturbation algorithm and enhancing security of SFLASH signature scheme ⋮ NTRU Algorithm: Nth Degree Truncated Polynomial Ring Units ⋮ Low-Cost Cryptography for Privacy in RFID Systems ⋮ Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory ⋮ Multi-key FHE from LWE, Revisited ⋮ On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes ⋮ A Novel Certificateless Multi-signature Scheme over NTRU Lattices ⋮ Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes ⋮ A Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMs ⋮ Efficient Nyberg-Rueppel type of NTRU digital signature algorithm ⋮ NTRU Fatigue: How Stretched is Overstretched? ⋮ Revisiting algebraic attacks on MinRank and on the rank decoding problem ⋮ Randomized half-ideal cipher on groups with applications to UC (a)PAKE ⋮ On the hardness of the finite field isomorphism problem ⋮ A new offer of <scp>NTRU</scp> cryptosystem with two new key pairs ⋮ Fast first-order masked NTTRU ⋮ An algebraic approach to symmetric linear layers in cryptographic primitives ⋮ A thorough treatment of highly-efficient NTRU instantiations ⋮ Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem ⋮ Hybrid dual and meet-LWE attack ⋮ Fiat-Shamir signatures based on module-NTRU ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ LRPC codes with multiple syndromes: near ideal-size KEMs without ideals ⋮ Homomorphic encryption: a mathematical survey ⋮ A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors ⋮ Exploiting ROLLO's constant-time implementations with a single-trace analysis ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ Subfield attacks on HSVP in ideal lattices ⋮ On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices ⋮ Identity-based interactive aggregate signatures from lattices ⋮ Preimage sampling in the higher-bit approximate setting with a non-spherical Gaussian sampler ⋮ Higher-order masked Saber ⋮ On module unique-SVP and NTRU ⋮ Roadmap of post-quantum cryptography standardization: side-channel attacks and countermeasures ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ On the hardness of the NTRU problem ⋮ A sharper lower bound on Rankin's constant ⋮ Algebraic Cryptanalysis of CTRU Cryptosystem ⋮ 2F -- a new method for constructing efficient multivariate encryption schemes ⋮ Efficiently masking polynomial inversion at arbitrary order ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Quantum rewinding for many-round protocols ⋮ Entropic hardness of Module-LWE from module-NTRU ⋮ A one-time single-bit fault leaks all previous NTRU-HRSS session keys to a chosen-ciphertext attack ⋮ An efficient key recovery attack against NTRUReEncrypt from AsiaCCS 2015 ⋮ Lattice-based public key cryptosystems invoking linear mapping mask ⋮ A performance evaluation of IPsec with post-quantum cryptography ⋮ Lattice-based cryptography: a survey ⋮ Reductions from module lattices to free module lattices, and application to dequantizing module-LLL ⋮ Private AI: Machine Learning on Encrypted Data ⋮ Subfield algorithms for ideal- and module-SVP based on the decomposition group ⋮ Choosing Parameters for NTRUEncrypt ⋮ Explicit Hard Instances of the Shortest Vector Problem ⋮ BI-NTRU Encryption Schemes: Two New Secure Variants of NTRU ⋮ Security and Trust in Sensor Networks ⋮ A Lattice Attack on Homomorphic NTRU with Non-invertible Public Keys ⋮ Integer Reconstruction Public-Key Encryption ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ Key exchange protocols over noncommutative rings. The case of ⋮ Provably Secure NTRU Instances over Prime Cyclotomic Rings ⋮ Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ Short Generators Without Quantum Computers: The Case of Multiquadratics ⋮ Computing Generator in Cyclotomic Integer Rings ⋮ One-Shot Verifiable Encryption from Lattices ⋮ Short Stickelberger Class Relations and Application to Ideal-SVP ⋮ Symplectic Lattice Reduction and NTRU ⋮ Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ Rigorous and Efficient Short Lattice Vectors Enumeration ⋮ The Hidden Root Problem ⋮ Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE ⋮ A Digital Signature Scheme Based on CVP ∞ ⋮ Predicting Lattice Reduction ⋮ Better Key Sizes (and Attacks) for LWE-Based Encryption ⋮ A New Operator for Multi-addition Calculations ⋮ Integer Version of Ring-LWE and Its Applications ⋮ Reducing Key Length of the McEliece Cryptosystem ⋮ Benchmark Problems for Phase Retrieval ⋮ Algorithms for the Generalized NTRU Equations and their Storage Analysis ⋮ Cryptography Based on Quadratic Forms: Complexity Considerations ⋮ A new NTRU cryptosystem outperforms three highly secured NTRU-analog systems through an innovational algebraic structure ⋮ The Complexity of Public-Key Cryptography ⋮ Homomorphic Encryption ⋮ Cryptanalysis of ITRU ⋮ On random nonsingular Hermite normal form ⋮ SoK: how (not) to design and implement post-quantum cryptography ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ How to meet ternary LWE keys ⋮ A trace map attack against special ring-LWE samples ⋮ Homomorphic AES evaluation using the modified LTV scheme ⋮ An efficient lattice reduction using reuse technique blockwisely on NTRU ⋮ An extension of Kannan's embedding for solving ring-based LWE problems ⋮ How to find ternary LWE keys using locality sensitive hashing ⋮ On the higher-bit version of approximate inhomogeneous short integer solution problem

This page was built for publication: