Chaos machine: Difference between revisions
Prepared for moving to correct path. |
m Hennerhubel moved page Draft:Chaos machine to Chaos machine: It's ready for publishing. |
(No difference)
| |
Revision as of 17:45, 27 December 2016
In mathematics, a chaos machine is a class of algorithms constructed on the base of chaos theory (mainly deterministic chaos) to produce pseudo-random oracle. It represents the idea of creating a universal scheme with modular design and customizable parameters, which can be applied wherever randomness and sensitiveness is needed.
Theoretical model was published[1] in early 2015 by Maciej A. Czyzewski. It was designed specifically to combine the benefits of hash function and pseudo-random function. However, it can be used to implement many cryptographic primitives, including cryptographic hashes, message authentication codes and randomness extractors.
See also
External links
References
- ↑ Maciej A. Czyzewski (2016). "Chaos Machine: Different Approach to the Application and Significance of Numbers". Cryptology ePrint Archive, Report 2016/468. https://eprint.iacr.org/2016/468.