1450 search results - page 89 / 290 » On the Complexity of Hardness Amplification |
JCSS
2007
13 years 9 months ago
2007
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...
IJNS
2000
13 years 9 months ago
2000
Currently, fuzzy controllers are the most popular choice for hardware implementation of complex control surfaces because they are easy to design. Neural controllers are more compl...
PKC
2011
Springer
12 years 12 months ago
2011
Springer
At TCC 2005, Groth underlined the usefulness of working in small RSA subgroups of hidden order. In assessing the security of the relevant hard problems, however, the best attack co...
FPGA
2003
ACM
14 years 2 months ago
2003
ACM
As integrated circuits become more and more complex, the ability to make post-fabrication changes will become more and more attractive. This ability can be realized using programm...
ASIACRYPT
2010
Springer
13 years 7 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...