Research Article
Multiple Impossible Differential Attacks for ForkAES
Algorithm 1
Quicksort of plaintext-ciphertext pairs in impossible differential attack (IDQUICKSORT).
| | Inputs: Array ; Value function ; | | | Outputs: Sorted array indexed the value of t byte | | (1) | IDQUICKSORT | | (2) | ifthen | | (3) | IDPARTTION | | (4) | IDQUICKSORT | | (5) | IDQUICKSORT | | (6) | end if | | (7) | IDPARTTION | | (8) | | | (9) | | | (10) | for to do | | (11) | ifthen | | (12) | | | (13) | exchange | | (14) | end if | | (15) | end for | | (16) | return |
|
