Referenced Items are not available for this document.
In a recent paper, Jakimoski and Subbalakshmi provided a nice connection between the so-called discrete Lyapunov exponent of a permutation F defined on a finite lattice and its maximal differential probability, a parameter that measures the complexity of a differential cryptanalysis attack on the substitution defined by F. In this brief, we take a second look at their result to find some practical shortcomings. We also discuss more general aspects.
Published in:
Circuits and Systems II: Express Briefs, IEEE Transactions on
(Volume:54
,
Issue:
10
)
Date of Publication: Oct. 2007
- Page(s):
- 882 - 886
- ISSN :
- 1549-7747
- INSPEC Accession Number:
- 9633930
- Digital Object Identifier :
- 10.1109/TCSII.2007.901576
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 15 October 2007
- Issue Date :
- Oct. 2007
- Sponsored by :
- IEEE Circuits and Systems Society
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.
