Referenced Items are not available for this document.
A simple way of creating new and efficient distinguishers for cryptographic primitives such as block ciphers or hash functions is introduced. This technique is then successfully applied over reduced round versions of the block cipher TEA, which is proven to be weak with less than five rounds.
Published in:
Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
(Volume:3
)
Date of Conference: 8-12 Dec. 2003
- Page(s):
- 2189 - 2193 Vol.3
- Print ISBN:
- 0-7803-7804-0
- INSPEC Accession Number:
- 8494849
- Digital Object Identifier :
- 10.1109/CEC.2003.1299943
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
