Paper 2008/408
The Enigmatique Toolkit
Christopher Billings
Abstract
Abstract: This paper describes a new method of creating systems of poly-alphabetic, symmetric ciphers with a large set of algorithms. The method uses two translation tables containing the code-text character set, one for encryption and the other for decryption. After each character is encrypted or decrypted, these tables are permuted through a series of pseudo random, pairwise swaps. The implementation of alternative swap formulas leads to systems with large sets of encryption/decryption algorithms. Systems that contain more than a googol (1E100) algorithms have been easily implemented. An algorithm set can be easily sub-setted, producing hierarchical systems where a program may contain a single algorithm or a portion of the full set. The strength of these systems has not been determined. However strength can be inferred through the use of a substantial number of numeric keys , pseudo random number generators, algorithm switching, and other features.
Metadata
- Available format(s)
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- chris1752 @ yahoo com
- History
- 2008-10-02: received
- Short URL
- https://ia.cr/2008/408
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2008/408, author = {Christopher Billings}, title = {The Enigmatique Toolkit}, howpublished = {Cryptology {ePrint} Archive, Paper 2008/408}, year = {2008}, url = {https://eprint.iacr.org/2008/408} }