Chaos machine
From HandWiki
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.[1] Theoretical model was published in early 2015 by Maciej A. Czyzewski.[2] 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.[3][4]
See also
External links
References
- ↑ Blackledge, J M (March 10, 2010). Cryptography using Chaos (PDF) (Speech). Executive Speeches. Warsaw University of Technology.
- ↑ Maciej A. Czyzewski (2016) (in English). Chaos Machine: Different Approach to the Application and Significance of Numbers (Report). Cryptology ePrint Archive, Report 2016/468. https://eprint.iacr.org/2016/468.
- ↑ Barker, Elaine; Barker, William (July 2012). "Recommendation for Key Management". NIST Special Publication 800-57. NIST. http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf. Retrieved 19 August 2013.
- ↑ Kaneko, Kunihiko and Tsuda, Ichiro (2001) (in Japanese). Complex systems : chaos and beyond a constructive approach with applications in life sciences. Physics and astronomy online library. Springer. ISBN 3-540-67202-8. http://opac.inria.fr/record=b1101628. Retrieved 2016-12-27.
 |  |
