29 search results - page 6 / 6 » ches 2007 |
CHES
2007
Springer
13 years 11 months ago
2007
Springer
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
CHES
2007
Springer
13 years 11 months ago
2007
Springer
Replay attacks are often the most costly attacks to thwart when dealing with off-chip memory integrity. With a trusted System-on-Chip, the existing countermeasures against replay r...
CHES
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper discusses the state-of-the-art fast software implementation of block ciphers on Intel’s new microprocessor Core2, particularly concentrating on “bitslice i...
CTRSA
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we present a statistical saturation attack that combines previously introduced cryptanalysis techniques against block ciphers. As the name suggests, the attack is st...