Uniform Byte Key Generator
Four distinguishable dice values form x = 36·pair₁ + pair₂, uniformly spanning 0–1295. Values 1280–1295 are rejected; accepted values map to x mod 256. Because 1280 is exactly five complete 256-value cycles, this rejection step preserves uniform byte distribution.
Ciphertext
Base64 Transport
Key Sheet
A one-time pad must never be reused. Deliver key material out of band, destroy it after use, and verify transcription. Ciphertext length reveals plaintext length.
Accepted key bytes
Key sheet controls
Security notes
Base-36 Additive Key Generator
Each A/B pair maps to r = 6·(A−1) + (B−1), yielding digits 0–35. Encrypt with C=(P−K) mod 36; decrypt with P=(C+K) mod 36.
Ciphertext
Key Sheet
Base-36 gives one key digit per plaintext character. It provides perfect secrecy only when the key is random, secret, used once, and as long as the message.
Accepted key digits
Alphabetic OTP · Two-Dice Rejection
Ordered pair of distinguishable dice yields index 6·(A−1)+(B−1) (0–35). Accept 0–25 → A–Z; reject 26–35 and re-roll. Accepted letters are uniformly distributed. Encrypt: C=(P+K) mod 26; decrypt: P=(C−K) mod 26.
Ciphertext
Key Sheet
Classic paper OTP. Key must be random, secret, used once, and at least as long as the message. Destroy after use.
Accepted key letters
Method notes
9×9 Go Board Random Canvas
Dice decide the state of each of the 81 intersections: 1–2 black, 3–4 white, 5–6 empty (blank). Stones sit on the line intersections. Read the finished board in row-major order to extract a ternary keystream (black=0, white=1, empty=2), then map to letters. Blank intersections are already part of the system and do not reduce perfect secrecy; they simply form a third equiprobable symbol.
Ciphertext
Extracted Key
Photograph or sketch the finished board and deliver it securely. Both parties read in the same order. Destroy the image and notes after extracting the key. Never reuse.