Cslib.Crypto.Protocols.PerfectSecrecy.OTP.eq_xor_iff_xor_eq
theoremverifiedformalizationimported Lean
XOR by a fixed mask is self-inverse on BitVec: c = k ^^^ m ↔ c ^^^ m = k.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in lemma Cslib.Crypto.Protocols.PerfectSecrecy.OTP.eq_xor_iff_xor_eq {l : ℕ} (c m k : BitVec l) : (c = k ^^^ m) ↔ (c ^^^ m = k)
- Formalizes
- CSLib, `Cslib.Crypto.Protocols.PerfectSecrecy.OTP.eq_xor_iff_xor_eq`
- Lean proof
- By Samuel Schlesinger, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Samuel Schlesinger. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.Crypto.Protocols.PerfectSecrecy.OTP.eq_xor_iff_xor_eq← Cslib.Crypto.Protocols.PerfectSecrecy.OTP.eq_xor_iff_xor_eq (Cslib/Crypto/Protocols/PerfectSecrecy/Internal/OneTimePad.lean:29): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- Cslib.Crypto.Protocols.PerfectSecrecy.OTP.otp_ciphertextDist_eq_uniformThe ciphertext distribution of the OTP is uniform, regardless of the message.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true in/-- XOR by a fixed mask is self-inverse on `BitVec`: `c = k ^^^ m ↔ c ^^^ m = k`. -/lemma Cslib.Crypto.Protocols.PerfectSecrecy.OTP.eq_xor_iff_xor_eq {l : ℕ} (c m k : BitVec l) : (c = k ^^^ m) ↔ (c ^^^ m = k) := by grind