86 search results - page 15 / 18 » A 3-Dimensional Lattice Reduction Algorithm |
FGR
2006
IEEE
14 years 1 months ago
2006
IEEE
We propose an Isometric Self-Organizing Map (ISOSOM) method for nonlinear dimensionality reduction, which integrates a Self-Organizing Map model and an ISOMAP dimension reduction ...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in p...
EUROCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
AAECC
2005
Springer
13 years 7 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
FFA
2006
13 years 7 months ago
2006
We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the deal...