scientific article; zbMATH DE number 1962147
From MaRDI portal
Publication:4418531
zbMath1039.94525MaRDI QIDQ4418531
N. A. Howgrave-Graham, Jeffrey Hoffstein, William Whyte, Joseph H. Silverman, Jill Pipher
Publication date: 10 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2612/26120122.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Authentication, digital signatures and secret sharing (94A62) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)
Related Items (44)
SoK: how (not) to design and implement post-quantum cryptography ⋮ Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ A scalable post-quantum hash-based group signature ⋮ A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme ⋮ \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ A Novel Certificateless Multi-signature Scheme over NTRU Lattices ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ Efficient Nyberg-Rueppel type of NTRU digital signature algorithm ⋮ A novel identity-based multi-signature scheme over NTRU lattices ⋮ Gaussian sampling of lattices for cryptographic applications ⋮ A new offer of <scp>NTRU</scp> cryptosystem with two new key pairs ⋮ A signature scheme from the finite field isomorphism problem ⋮ Characterizing overstretched NTRU attacks ⋮ Fiat-Shamir signatures based on module-NTRU ⋮ A polynomial time algorithm for breaking NTRU encryption with multiple keys ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ On the hardness of the NTRU problem ⋮ Algebraic Cryptanalysis of CTRU Cryptosystem ⋮ Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures ⋮ Lattice-based cryptography: a survey ⋮ Compact lattice gadget and its applications to hash-and-sign signatures ⋮ Fault analysis of the NTRUSign digital signature scheme ⋮ On the geometry of cyclic lattices ⋮ Analysis of Error Terms of Signatures Based on Learning with Errors ⋮ Provably secure NTRUEncrypt over any cyclotomic field ⋮ Security and Trust in Sensor Networks ⋮ Lattice Klepto -- turning post-quantum crypto against itself ⋮ Provably Secure NTRU Instances over Prime Cyclotomic Rings ⋮ Symplectic Lattice Reduction and NTRU ⋮ Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures ⋮ A Digital Signature Scheme Based on CVP ∞ ⋮ Learning strikes again: the case of the DRS signature scheme ⋮ Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures ⋮ Modular lattice signatures, revisited ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices ⋮ NTRUSign ⋮ The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Algorithms for the Generalized NTRU Equations and their Storage Analysis ⋮ Cryptography Based on Quadratic Forms: Complexity Considerations ⋮ Lattice-based revocable certificateless signature ⋮ On removing rejection conditions in practical lattice-based signatures
Uses Software
This page was built for publication:
