A New cryptanalysis model based on random and quantum walks

2023/09/21 by Drissi, Ahmed · 1 citation
#Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)

paper · doi:10.48550/arxiv.2309.11997

Abstract

Randomness plays a key role in the design of attacks on cryptographic systems and cyber security algorithms in general. Random walks and quantum walks are powerful tools for mastering random phenomena. In this article, I propose a probabilistic attack model of a cryptographic system. This model is based on a random or quantum walk with the space of states being a space containing the secret to be revealed. This space can be a subspace of keys, plain texts or cipher texts.

Cited by

• An effcient variational quantum Korkin-Zolotarev algorithm for solving shortest vector problems

Related

• Randomness determines practical security of BB84 quantum key distribution
• Quantum Walk Random Number Generation: Memory-based Models
• Randomness Extraction via Delta-Biased Masking in the Presence of a Quantum Attacker
• Exploiting the randomness of the measurement basis in quantum\n cryptography: Secure Quantum Key Growing without Privacy Amplification
• Explicit Randomness is not Necessary when Modeling Probabilistic Encryption