cato447/mosaic
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

updated text

Browse Source
This commit is contained in:
cato447
2026-01-19 13:05:03 +01:00
parent 4e56da2c65
commit db6718b5bf
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
files/secret_message.txt
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 QR code and then randomized by permuting its tiles with a secret seed.
(a) Under ideal assumptions, explain why this scheme could satisfy (a) Under ideal assumptions, explain why this scheme could satisfy
Kerckhoffs’libzbar0 principle. Kerckhoffs' principle.
(b) Now assume an attacker can test permutations against the QR format (b) Now assume an attacker can test permutations against the QR format
(find patterns, error correction, alignment markers). Why does this (find patterns, error correction, alignment markers). Why does this
reduce the effective security of the scheme? reduce the effective security of the scheme?