Sciweavers

264 search results - page 41 / 53
» Algebraic Side-Channel Attacks
Sort
View
IPPS
2008
IEEE
14 years 1 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
FUIN
2007
84views more  FUIN 2007»
13 years 7 months ago
Observation Based System Security
A formal model for description of passive and active timing attacks is presented, studied and compared with other security concepts. It is based on a timed process algebra and on a...
Damas P. Gruska
CRYPTO
2011
Springer
237views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Automatic Search of Attacks on Round-Reduced AES and Applications
In this paper, we describe versatile and powerful algorithms for searching guess-and-determine and meet-in-the-middle attacks on byte-oriented symmetric primitives. To demonstrate ...
Charles Bouillaguet, Patrick Derbez, Pierre-Alain ...
WCC
2005
Springer
172views Cryptology» more  WCC 2005»
14 years 29 days ago
Dimension of the Linearization Equations of the Matsumoto-Imai Cryptosystems
Abstract. The Matsumoto-Imai (MI) cryptosystem was the first multivariate public key cryptosystem proposed for practical use. Though MI is now considered insecure due to Patarin...
Adama Diene, Jintai Ding, Jason E. Gower, Timothy ...
FC
1999
Springer
97views Cryptology» more  FC 1999»
13 years 11 months ago
Playing "Hide and Seek" with Stored Keys
In this paper we consider the problem of efficiently locating cryptographic keys hidden in gigabytes of data, such as the complete file system of a typical PC. We describe efficie...
Adi Shamir, Nicko van Someren