Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures

No abstract is available for this paper.

• Publication year

  2003

• Venue

  International Conference on the Theory and Application of Cryptographic Techniques

• Publication date

  2003-05-04

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-39200-9_27
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Approximating CVP to Within Almost-Polynomial Factors is NP-Hard

  2003cited by this paper
• Cryptanalysis of the Revised NTRU Signature Scheme

  2002cited by this paper
• Aeìêíëááae Áááìä Ëááaeaeìíêêë Íëáaeae Ìàà Aeìêí Ääììááá Èêêäáåáaeaeê Êêêì ¾ Èêáä ¾¸¾¼¼¾ Ââââêêê Àçççëììáae¸aeááã Àçïêêîî¹¹êêààå¸âáää Èáèààê¸âçëëèà Àº Ëáäîîêååae¸ïáääááå Ïààìì

  2002cited by this paper
• NSS: An NTRU Lattice-Based Signature Scheme

  2001cited by this paper
• Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001

  2001cited by this paper
• Polynomial Rings and Efficient Public Key Authentication II

  2001cited by this paper
• NSS : The NTRU Signature Scheme

  2000cited by this paper
• Lattice Reduction in Cryptology: An Update

  2000cited by this paper
• Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97

  1999cited by this paper
• Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors

  1999cited by this paper
• Approximating SVPinfinity to within almost-polynomial factors is NP-hard

  1998cited by this paper
• On the limits of non-approximability of lattice problems

  1998cited by this paper
• The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)

  1998cited by this paper
• The shortest vector in a lattice is hard to approximate to within some constant

  1998cited by this paper
• NTRU: A Ring-Based Public Key Cryptosystem

  1998cited by this paper
• Public-key cryptography from lattice reduction problems

  1997cited by this paper
• Lattice Attacks on NTRU

  1997cited by this paper
• Public-Key Cryptosystems from Lattice Reduction Problems

  1996cited by this paper
• A course in computational algebraic number theory

  1993cited by this paper
• A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms

  1987cited by this paper
• INTRODUCTION TO CYCLOTOMIC FIELDS(Graduate Texts in Mathematics, 83)

  1983cited by this paper
• Factoring polynomials with rational coefficients

  1982cited by this paper

• A search to distinguish reduction for the isomorphism problem on direct sum lattices

  2025cites this paper
• HAWK: Having Automorphisms Weakens Key

  2025cites this paper
• Exploiting the Symmetry of Zn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {Z}^n$$\end{document}: Randomizat

  2025cites this paper
• Special Genera of Hermitian Lattices and Applications to HAWK

  2025cites this paper
• Cryptanalysis of rank-2 module-LIP in Totally Real Number Fields

  2024cites this paper
• Quantum vs post-quantum security for future networks: Survey

  2024cites this paper
• Cryptanalysis of Rank-2 Module-LIP with Symplectic Automorphisms

  2024cites this paper
• A reduction from Hawk to the principal ideal problem in a quaternion algebra

  2024cites this paper
• Improved Provable Reduction of NTRU and Hypercubic Lattices

  2024cites this paper
• HAWK Specification Document

  2023cites this paper
• Provable lattice reduction of Zn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {Z}^n$$\end{document} with blo

  2023cites this paper
• Lattice Signature can be as Simple as Lattice Encryption

  2022cites this paper
• Hawk: Module LIP makes Lattice Signatures Fast, Compact and Simple

  2022cites this paper
• A practical algorithm for completing half-Hadamard matrices using LLL

  2021cites this paper
• Can Lattice Signature be as Efficient as Lattice Encryption?

  2021cites this paper
• On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography

  2021cites this paper
• A practical algorithm for completing half-Hadamard matrices using LLL

  2021cites this paper
• Just how hard are rotations of Z n ? Algorithms and cryptography with the simplest lattice

  2021cites this paper
• Local and Global Computation on Algebraic Data

  2017cites this paper
• Provably Secure NTRU Instances over Prime Cyclotomic Rings

  2017cites this paper
• Deciding Orthogonality in Construction-A Lattices | SIAM Journal on Discrete Mathematics | Vol. 31, No. 2 | Society for Industrial and Applied Mathematics

  2017cites this paper
• Candidate Multilinear Maps

  2015cites this paper
• NTRU Cryptosystem: Recent developments and emerging mathematical problems in finite polynomial rings

  2014cites this paper
• Gaussian sampling of lattices for cryptographic applications

  2014cites this paper
• On the Lattice Isomorphism Problem

  2013cites this paper
• Candidate Multilinear Maps from Ideal Lattices

  2013cites this paper
• Candidate Multilinear Maps from Ideal Lattices and Applications

  2012cites this paper
• Fault analysis of the NTRUSign digital signature scheme

  2012cites this paper
• Cryptanalysis and Secure Implementation of Modern Cryptographic Algorithms

  2012cites this paper
• On Linear Transmission Systems

  2012cites this paper
• Ååååòò Aeìêííò Blockinöýôø Òò Aeìêíëëëò × Ëë Blockinùöö × Ëøøòòòöö Ïóö×ø¹¹¹×× Èöóóððñ× Óúö Ááááð Ääøøø Blockin Blockin×

  2012cites this paper
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices

  2011cites this paper
• Learning, cryptography, and the average case

  2010cites this paper
• Recovery of a lattice generator matrix from its gram matrix for feedback and precoding in MIMO

  2010cites this paper
• A digital signature scheme based on CV P

  2008cites this paper
• 1 . 2 Lattice-based cryptography

  2008cites this paper
• Efficient lattice-based signature scheme

  2008cites this paper
• A Digital Signature Scheme Based on CV P∞

  2007cites this paper
• A Study on Lattice-Based Public-Key Cryptosystems

  2007cites this paper
• Lattice-Based Cryptography

  2006cites this paper
• Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures

  2006cites this paper
• Authentication in ad-hoc and sensor networks

  2004cites this paper
• about the Internet and Networking : 2010 – 2019

  2003cites this paper
• An Identification Scheme from Lattice Distinguishing Problem

  2003cites this paper
• Computing the M = U Ut Integer Matrix Decomposition

  2003cites this paper
• Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

  2002influential citation
• Rank-2 module-LIP with special matrices

  year unknowncites this paper
• Dimension-Reducing Algorithms for Quaternion Ideal-SVP

  year unknowncites this paper