Doubly Perfect Nonlinear Boolean Permutations

Details Doubly Perfect Nonlinear Boolean Permutations Doubly Perfect Nonlinear Boolean Permutations

2010-03-25

arxiv.org/abs/1003.4919v1

Journal of Discrete Mathematical Sciences and Cryptography 13, 6 (2010) 571-582

Computer Science

Discrete Mathematics

Scientific paper

Due to implementation constraints the XOR operation is widely used in order to combine plaintext and key bit-strings in secret-key block ciphers. This choice directly induces the classical version of the differential attack by the use of XOR-kind differences. While very natural, there are many alternatives to the XOR. Each of them inducing a new form for its corresponding differential attack (using the appropriate notion of difference) and therefore block-ciphers need to use S-boxes that are resistant against these nonstandard differential cryptanalysis. In this contribution we study the functions that offer the best resistance against a differential attack based on a finite field multiplication. We also show that in some particular cases, there are robust permutations which offers the best resistant against both multiplication and exponentiation base differential attacks. We call them doubly perfect nonlinear permutations.

Affiliated with

Also associated with

No associations

Rating

Doubly Perfect Nonlinear Boolean Permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Doubly Perfect Nonlinear Boolean Permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Doubly Perfect Nonlinear Boolean Permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556534