`cryptography_one_statement`

proved

show as: view math explainer →

module: IndisputableMonolith.Cryptography.RSCryptographicBound
domain: Cryptography
line: 100 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Cryptography.RSCryptographicBound on GitHub at line 100.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

open explainer

depends on

formal source

  97/-- **CRYPTOGRAPHY ONE-STATEMENT.** Per-bit J-cost = `log φ > 0`; total
  98recovery cost is additive over bits; doubling key size exactly doubles
  99recovery cost. -/
 100theorem cryptography_one_statement :
 101    0 < perBitCost ∧
 102    (∀ n, totalRecoveryCost (n + 1) = totalRecoveryCost n + perBitCost) ∧
 103    (∀ n, totalRecoveryCost (2 * n) = 2 * totalRecoveryCost n) :=
 104  ⟨perBitCost_pos, totalRecoveryCost_succ, totalRecoveryCost_double⟩
 105
 106end
 107
 108end RSCryptographicBound
 109end Cryptography
 110end IndisputableMonolith

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.