15 search results - page 3 / 3 » Completion Attacks and Weak Keys of Oleshchuk's Public Key C... |
EUROCRYPT
2001
Springer
13 years 10 months ago
2001
Springer
In this paper we consider the security of block ciphers which contain alternate layers of invertible S-boxes and affine mappings (there are many popular cryptosystems which use thi...
EUROCRYPT
2009
Springer
14 years 6 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
WISEC
2009
ACM
14 years 1 months ago
2009
ACM
In wireless sensor networks, it is critical to restrict the network access only to eligible sensor nodes, while messages from outsiders will not be forwarded in the networks. In t...
CRYPTO
2011
Springer
12 years 6 months ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
IACR
2011
12 years 5 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...