This blog describes a 'pencil and paper' cryptosystem that the author hopes is sufficiently secure to be used in real-world situations where the discovery of encrypted data will lead to loss or harm. The author invites mathematical proof of the key components of the system, either to prove security or the lack thereof. Readers may wish to implement the system in the absence of such proof but obviously do so at their own risk.
Students of cryptography will recognise that aspects of certain schema are loosely based on work that went before, but hopefully will also recognise that the adaptations and enhancements that have been made enable the work, as it stands, to be regarded as novel. The author asserts his right to be regarded as the sole originator of this blog and its contents.
This blog consists of:
Problem, Conjecture, Method, Example, Application
(a method for the simple production of a pseudo-random string of unlimited length)
A schema for digitising alphanumeric data
(a method for translating alpha-numeric data into the shortest possible string of encoded digits)
The encryption and decryption of encoded information
(a methodology for the combination of encoded information with a pseudo-random string)
A schema for managing public and private keys
(a methodology for managing keys)
In search of proof
(graphic depiction of the 10,000 four digit words' (0000 - 9999) distribution through a 1 million character pseudo-random string)
'Proof' graphics
(graphics generated from a variety of keys)
No comments:
Post a Comment