Sciweavers

40 search results - page 5 / 8
» Security Estimates for Quadratic Field Based Cryptosystems
Sort
View
CRYPTO
2006
Springer
108views Cryptology» more  CRYPTO 2006»
13 years 10 months ago
Inverting HFE Is Quasipolynomial
In the last ten years, multivariate cryptography has emerged as a possible alternative to public key cryptosystems based on hard computational problems from number theory. Notably,...
Louis Granboulan, Antoine Joux, Jacques Stern
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
14 years 6 days ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig
ICPR
2010
IEEE
14 years 1 months ago
Estimating Nonrigid Shape Deformation Using Moments
Image moments have been widely used for designing robust shape descriptors that are invariant to rigid transformations. In this work, we address the problem of estimating non-rigid...
Wei Liu, Eraldo Ribeiro
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
11 years 9 months ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...
CTRSA
2011
Springer
243views Cryptology» more  CTRSA 2011»
12 years 10 months ago
Better Key Sizes (and Attacks) for LWE-Based Encryption
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contribution...
Richard Lindner, Chris Peikert