1769 search results - page 108 / 354 » Cryptography |
103
click to vote
EUROCRYPT
2009
Springer
16 years 3 months ago
2009
Springer
We show that a generic ring algorithm for breaking RSA in ZN can be converted into an algorithm for factoring the corresponding RSA-modulus N. Our results imply that any attempt at...
CHES
2009
Springer
16 years 3 months ago
2009
Springer
133
click to vote
PKC
2009
Springer
16 years 3 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...
CHES
2009
Springer
15 years 10 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...
124
Voted
IMA
2009
Springer
15 years 10 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...