Chaos machine: Difference between revisions
Alter: template type. Removed parameters. | You can use this bot yourself. Report bugs here. | Activated by Zppix | Category:Cryptography stubs | via #UCB_Category |
|||
| Line 20: | Line 20: | ||
{{crypto-stub}} | {{crypto-stub}} | ||
{{chaos-stub}} | |||
Revision as of 14:28, 19 July 2022
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
- ↑ Template:Cite speech
- ↑ Template:Cite report
- ↑ Barker, Elaine (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 on 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 on 2016-12-27.