25 search results - page 4 / 5 » Cryptanalysis of Feistel Networks with Secret Round Function... |
CANS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. This paper presents the first independent and systematic linear, differential and impossible-differential (ID) cryptanalyses of MIBS, a lightweight block cipher aimed at ...
CARDIS
1998
Springer
13 years 10 months ago
1998
Springer
Wagner, Goldberg and Briceno have recently published an attack [2] on what they believe to be Comp128, the GSM A3A8 authentication hash function [1]. Provided that the attacker has...
FOCS
2007
IEEE
14 years 3 days ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
ICANN
2010
Springer
13 years 6 months ago
2010
Springer
So-called Physical Unclonable Functions are an emerging, new cryptographic and security primitive. They can potentially replace secret binary keys in vulnerable hardware systems an...
IACR
2011
12 years 5 months ago
2011
We revisit meet-in-the-middle attacks on block ciphers and recent developments in meet-in-the-middle preimage attacks on hash functions. Despite the presence of a secret key in the...