Sciweavers

1562 search results - page 137 / 313
» Mathematics, Cryptology, Security
Sort
View
AES
2004
Springer
204views Cryptology» more  AES 2004»
14 years 1 months ago
The Boomerang Attack on 5 and 6-Round Reduced AES
In this note we study security of 128-bit key 10-round AES against the boomerang attack. We show attacks on AES reduced to 5 and 6 rounds, much faster than the exhaustive key searc...
Alex Biryukov
FSE
2003
Springer
135views Cryptology» more  FSE 2003»
14 years 1 months ago
New Attacks against Standardized MACs
In this paper, we revisit the security of several message authentication code (MAC) algorithms based on block ciphers, when instantiated with 64-bit block ciphers such as DES. We e...
Antoine Joux, Guillaume Poupard, Jacques Stern
AMC
2005
124views more  AMC 2005»
13 years 8 months ago
An efficient undeniable group-oriented signature scheme
Three main methods with favorable security and efficiency can be considered in the design of cryptosystems. These methods are integer factorization systems (of which RSA is the be...
Tzer-Shyong Chen, Jen-Yan Huang, Tzer-Long Chen
TCC
2005
Springer
176views Cryptology» more  TCC 2005»
14 years 1 months ago
How to Securely Outsource Cryptographic Computations
We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security definition for securely outsourcing computations from a comp...
Susan Hohenberger, Anna Lysyanskaya
SACRYPT
2004
Springer
105views Cryptology» more  SACRYPT 2004»
14 years 1 months ago
Provably Secure Masking of AES
A general method to secure cryptographic algorithm implementations against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking...
Johannes Blömer, Jorge Guajardo, Volker Krumm...