Peter Gutmann wrote:
http://eprint.iacr.org/2008/058
Physical Cryptanalysis of KeeLoq Code Hopping Applications
Addition (http://www.heise-online.co.uk/security/news/print/110446):
Scientists at the Ruhr-Universität Bochum[1] have defeated the Keeloq[2]
immobiliser and door opener used
http://eprint.iacr.org/2008/058
Physical Cryptanalysis of KeeLoq Code Hopping Applications
Recently, some mathematical weaknesses of the KeeLoq algorithm have been
reported. All of the proposed attacks need at least 2^16 known or chosen
plaintexts. In real-world applications of
