Sciweavers

IACR
2011
85views more  IACR 2011»
12 years 4 months ago
Some Instant- and Practical-Time Related-Key Attacks on KTANTAN32/48/64
The hardware-attractive block cipher family KTANTAN was studied by Bogdanov and Rechberger who identified flaws in the key schedule and gave a meet-in-the-middle attack. We revis...
Martin Ågren
ISPEC
2011
Springer
12 years 8 months ago
Meet-in-the-Middle Attack on 8 Rounds of the AES Block Cipher under 192 Key Bits
The AES block cipher has a 128-bit block length and a user key of 128, 192 or 256 bits, released by NIST for data encryption in the USA; it became an ISO international standard in ...
Yongzhuang Wei, Jiqiang Lu, Yupu Hu
EUROCRYPT
2003
Springer
13 years 10 months ago
New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
Renato Renner, Stefan Wolf
ICNS
2009
IEEE
13 years 11 months ago
Advanced Hash Algorithms with Key Bits Duplication for IP Address Lookup
Hashing technique have been widely adopted for various computer network applications such as IP address lookup and intrusion detection, among which XOR-hashing is one of most popu...
Christopher J. Martinez, Wei-Ming Lin