Cryptanalysis of quantum permutation pad. (arXiv:2304.11081v1 [cs.CR])

Cryptanalysis increases the level of confidence in cryptographic algorithms.
We analyze the security of a symmetric cryptographic algorithm - quantum
permutation pad (QPP) [8]. We found the instances of ciphertext the same as
plaintext even after the action of QPP with the probability 1/N when the entire
set of permutation matrices of dimension N is used and with the probability
1/N^m when an incomplete set of m permutation matrices of dimension N are used.
We visually show such instances in …

action algorithm algorithms cipher ciphertext cryptanalysis plaintext quantum security symmetric