A Digital Signature Scheme Based on CVP ∞

DOI10.1007/978-3-540-78440-1_17zbMath1162.94398OpenAlexW2358057278MaRDI QIDQ5445459

Khin Than Win, Thomas Plantard, Willy Susilo

Publication date: 5 March 2008

Published in: Public Key Cryptography – PKC 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78440-1_17

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors ⋮ Learning strikes again: the case of the DRS signature scheme

Cites Work

• Estimating the matrix \(p\)-norm
• On Lovász' lattice reduction and the nearest lattice point problem
• Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
• The spectral radius of large random matrices
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
• Approximating CVP to within almost-polynomial factors is NP-hard
• Fast LLL-type lattice reduction
• Einige abstrakte Begriffe in der numerischen Mathematik (Anwendungen der Halbordnung).(Some abstract notions in the numerical mathematic. (Applications et semiorder))
• Lattice problems and norm embeddings
• A linear space algorithm for computing the hermite normal form
• An Introduction to the Geometry of Numbers
• The Hardness of the Closest Vector Problem With Preprocessing Over$ell_infty$Norm
• Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Closest point search in lattices
• A more efficient algorithm for lattice basis reduction
• A sieve algorithm for the shortest lattice vector problem
• Floating-Point LLL Revisited
• Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
• Selected Areas in Cryptography
• Lattice-Based Cryptography
• Algorithmic Number Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Digital Signature Scheme Based on CVP  ∞