64 search results - page 11 / 13 » New Attacks Against Reduced-Round Versions of IDEA |
ICISC
2000
13 years 9 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
MOBISYS
2005
ACM
14 years 7 months ago
2005
ACM
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
ASIACRYPT
2011
Springer
12 years 7 months ago
2011
Springer
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
GECCO
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. Most modern real-time strategy computer games have a sophisticated but fixed ‘AI’ component that controls the computer’s actions. Once the user has learned how suc...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...