Towards Optimized DFA Attacks on AES under Multibyte Random Fault Model

Algorithm 1

The process of sorting all 3⁶ paths.

Input: φ: 3⁶ paths of disorder.

Output: φ: ordered 3⁶ paths.

for each j ∈do

initialize ψ_j = Φ

end for

for each p∈φ  do

j← the number of ciphertext pairs p requires

ψ_j = p∪ψ_j

end for

for each j∈do

sort paths in ψ_j in order of occurrence rate from low to high

end for

return  φ←ψ₂ ∥ ψ₃ ∥ ψ₄ ∥ ψ₅ ∥ ψ₆