A THOUGHT EXPERIMENT FOR CRYPTOGRAPHERS
Imagine away the symmetric key management problem. Imagine that you can have keys of any strength you wish ... a thousand bits, a hundred thousand bits, whatever. Imagine you can encrypt content once, then encrypt that encrypted version again, a different way, then encrypt that again in yet another way ... and so on, as much as you wish.
Question: How would the People's Liberation Army Unit 61398 go about decrypting your content?
End of thought experiment. Back to reality. Below is a link to a book in process, together with Windows C++ source code. It starts at a mere 12,288 bits, and only re-shreds the content 32 times. Toward the end it explains how to scale that up as needed. The symmetric key management problem? Yes, that is gone; see U.S. Patent No. 10,637,837, and/or a proof of concept program, linked below.
A Little Privacy for the Little Guy
to obstruct totalitarian
surveillance of ideas
- Up front glossary
- Problem, solution, source code
- Swap, scatter
- What about keys?
- It's about people
VOLUNTEER WANTED: Proficient cryptanalyst to evaluate methods presented in later chapters of A Little Privacy for the Little Guy.
SECOND VOLUNTEER WANTED: Technical writer to suggest improvements to A Little Privacy for the Little Guy as successive chapters are released. Familiarity with Visual Studio C++ an asset.
Get in touch using the feedback button at the top of this page. Thanks.