2967 search results - page 290 / 594 » Cryptology |
182
Voted
PKC
2009
Springer
16 years 7 months ago
2009
Springer
We address the problem of polynomial time factoring RSA moduli N1 = p1q1 with the help of an oracle. As opposed to other approaches that require an oracle that explicitly outputs b...
141
click to vote
CHES
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we show a very efficient side channel attack against HMAC. Our attack assumes the presence of a side channel that reveals the Hamming distance of some registers. Aft...
169
click to vote
IMA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adver...
149
click to vote
IMA
2009
Springer
16 years 1 months ago
2009
Springer
Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to ...