AFTD Auto-Formalizing Theoretical Domains

Cslib.Crypto.Protocols.PerfectSecrecy.otp

defimported Lean

The one-time pad over l-bit strings. Encryption and decryption are XOR ([KatzLindell2020], Construction 2.9).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
noncomputable def Cslib.Crypto.Protocols.PerfectSecrecy.otp (l : ℕ) :
    EncScheme (BitVec l) (BitVec l) (BitVec l)
Defined in
CSLib, `Cslib.Crypto.Protocols.PerfectSecrecy.otp`
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.
Verified
08 Oct 2026
Axioms
none listed
Built on 3
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- The one-time pad over `l`-bit strings. Encryption and decryption are XOR ([KatzLindell2020], Construction 2.9). -/
noncomputable def Cslib.Crypto.Protocols.PerfectSecrecy.otp (l : ℕ) :
    EncScheme (BitVec l) (BitVec l) (BitVec l) :=
  .ofPure (PMF.uniformOfFintype _) (· ^^^ ·) (· ^^^ ·) fun k m => by
    simp [← BitVec.xor_assoc]
See it in the graphDiscuss this resultChallenge it