updated text

This commit is contained in:
2026-01-19 13:05:03 +01:00
parent 4e56da2c65
commit db6718b5bf

View File

@@ -9,7 +9,7 @@ Consider a toy "QR-encryption" scheme where a message is encoded into
a QR code and then randomized by permuting its tiles with a secret seed.
(a) Under ideal assumptions, explain why this scheme could satisfy
Kerckhoffslibzbar0 principle.
Kerckhoffs' principle.
(b) Now assume an attacker can test permutations against the QR format
(find patterns, error correction, alignment markers). Why does this
reduce the effective security of the scheme?