490 search results - page 4 / 98 » Equivalent Keys of HPC |
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Secret-key agreement between two parties Alice and Bob, connected by an insecure channel, can be realized in an informationtheoretic sense if the parties share many independent pai...
SACRYPT
1999
Springer
13 years 11 months ago
1999
Springer
DEAL is a six- or eight-round Luby-Rackoff cipher that uses DES as its round function, with allowed key lengths of 128, 192, and 256 bits. In this paper, we discuss two new result...
ENTCS
2006
13 years 7 months ago
2006
Public key cryptography has been invented to overcome some key management problems in open networks. Although nearly all aspects of public key cryptography rely on the existence of...
AAAI
2000
13 years 8 months ago
2000
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world problems and constitute a major obstacle to DavisPutnam...
DAC
2009
ACM
13 years 5 months ago
2009
ACM
For hardware security applications, the availability of secret keys is a critical component for secure activation, IC authentication and for other important applications including...