Chaos machine: Difference between revisions
Multiple author names found within singular author name parameters replaced with enumerated author parameters in order to clear the resulting CS1 maintenance error. |
Nominate for deletion |
||
| Line 1: | Line 1: | ||
<!-- Please do not remove or change this AfD message until the discussion has been closed. --> | |||
{{Article for deletion/dated|page=Chaos machine|timestamp=20260925174118|year=2026|month=September|day=25|substed=yes}} | |||
<!-- Once discussion is closed, please place on talk page: {{Old AfD multi|page=Chaos machine|date=25 September 2026|result='''keep'''}} --> | |||
<!-- End of AfD message, feel free to edit beyond this point --> | |||
{{Short description|Type of algorithm}} | {{Short description|Type of algorithm}} | ||
In [[mathematics]], a '''chaos machine''' is a class of algorithms constructed on the base of [[chaos theory]] (mainly deterministic chaos) to produce [[random oracle|pseudo-random oracles]]. It represents the idea of creating a universal scheme with modular design and customizable parameters, which can be applied wherever [[randomness]] and [[butterfly effect|sensitiveness]] is needed.<ref>{{cite speech |title=Cryptography using Chaos|first=J M|last=Blackledge|event=Executive Speeches|location=Warsaw University of Technology|date=March 10, 2010|url=http://konwersatorium.pw.edu.pl/wyklady/2010_VLZ7_02_wyklad.pdf}}</ref> | In [[mathematics]], a '''chaos machine''' is a class of algorithms constructed on the base of [[chaos theory]] (mainly deterministic chaos) to produce [[random oracle|pseudo-random oracles]]. It represents the idea of creating a universal scheme with modular design and customizable parameters, which can be applied wherever [[randomness]] and [[butterfly effect|sensitiveness]] is needed.<ref>{{cite speech |title=Cryptography using Chaos|first=J M|last=Blackledge|event=Executive Speeches|location=Warsaw University of Technology|date=March 10, 2010|url=http://konwersatorium.pw.edu.pl/wyklady/2010_VLZ7_02_wyklad.pdf}}</ref> | ||
Revision as of 17:41, 25 September 2026
| This article is being considered for deletion in accordance with Wikipedia's deletion policy. Please share your thoughts on the matter at this article's entry on the Articles for deletion page. Feel free to edit the article, but the article must not be blanked, and this notice must not be removed, until the discussion is closed. For more information, particularly on merging or moving the article during the discussion, read the Guide to deletion. Steps to list an article for deletion:
Unregistered users placing this tag on an article cannot complete the deletion nomination and should leave detailed reasons for deletion on Talk:Chaos machine. If the nomination is not completed and no message is left on the talkpage, this tag may be removed. |
Template:Short description In mathematics, a chaos machine is a class of algorithms constructed on the base of chaos theory (mainly deterministic chaos) to produce pseudo-random oracles. 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 2016 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]
The flexibility of the chaos machine design allows it to be tailored for different applications by adjusting the choice of parameters. For example, the period length of the pseudo-random output can be targeted by selecting the appropriate space parameter. [2]
See also
References
- ↑ Template:Cite speech
- ↑ 2.0 2.1 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; 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.