Cryptanalysis I
summary
Three short results: implementation of Simon on IBM-Q16 15‑qubit device up to 7‑dim shows non‑orthogonal measurement mass (tau grows with dimension), proposes permutation and Hamming smoothing techniques and reduces noisy Simon sampling to Learning Parity with Noise, yielding a polynomial quantum‑classical speedup. ABE analysis uses pairing encodings and linear algebra to mount master‑key and complete‑decryption attacks, breaking 11 schemes (9 under the strongest models) and extending to multi‑authority. Zero‑correlation work generalizes masks to plaintext/key/tweak at bit level, uses STP/SAT search and an integral conversion to obtain longer distinguishers for TWINE, LBlock and improved results on SKINNY.
AI-written summary · about
chapters (23)
- 0:00Intro
- 0:19Period Finding is important
- 1:07Simon Period Finding
- 4:12Smoothing
- 4:55Permutation Techniques
- 6:07Hamming Techniques
- 7:14Learning with Noise
- 9:38Relevance of attribute-based encryption (ABE)
- 13:12Security of ABE
- 14:38Implicit security requirements
- 15:06Our attack models
- 16:58Pairing-based ABE
- 17:58Example: DAC-MACS
- 19:51Multi-authority ABE
- 20:08Attacks in the multi-authority setting
- 21:14Conclusion
- 22:20About Zero-Correlation Linear Cryptanalysis
- 22:59Motivation and Contributions
- 23:54Original Zero-correlation cryptanalysis in block cipher
- 25:30Linear mask propagation in block cipher
- 26:37Zero-Correlation Linear Cryptanalysis with Equal Treatment for Plaintexts, Keys, and Tweaks
- 29:37Linear mask propagation on complex key schedule
- 31:47Modeline for linear mask propagation
