Reusing a one-bit encryption pad — independent controls
Lax755887.ReusedKeyControls · concepts/Lax755887/ReusedKeyControls.lean · lax-755887
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
These statements use only the background axioms. They record the actual behavior or the valid local calculation, independently of the unchecked contract.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax755887.ReusedKey |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Reusing a one-bit encryption pad — independent controls |
| 6 | type: theorem |
| 7 | --- |
| 8 | These statements use only the background axioms. They record the actual behavior or the valid local calculation, independently of the unchecked contract. |
| 9 | -/ |
| 10 | |
| 11 | namespace Lax755887.ReusedKeyControls |
| 12 | |
| 13 | open Lax755887.ReusedKey |
| 14 | |
| 15 | axiom rekey {α : Type} (f : Bool → α) : SameLaw f (fun k => f (!k)) |
| 16 | |
| 17 | axiom complement (event : Bool → Bool) : |
| 18 | probability (fun k => !(event k)) = 1 - probability event |
| 19 | |
| 20 | axiom xor_attack_succeeds : success (fun c => Bool.xor c.1 c.2) = 1 |
| 21 | |
| 22 | end Lax755887.ReusedKeyControls |
| 23 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments