Jump to content

Chaos machine: Difference between revisions

From IdeaWazaWiki
Remove "Theory" section
libchaos implements known machines, should be in external links
Line 1: Line 1:
{{New unreviewed article|source=ArticleWizard|date=October 2016}}
<!-- Write the text of your article below this line. The first sentence should begin with the subject of your article surrounded by three apostrophes (for example: '''Article name''' is...) -->
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 oracle]]. It presents the idea to create a universal scheme with modular design and customizable parameters, that can be applied where [[randomness]] and [[butterfly effect|sensitiveness]] is needed.
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 oracle]]. It presents the idea to create a universal scheme with modular design and customizable parameters, that can be applied where [[randomness]] and [[butterfly effect|sensitiveness]] is needed.


Line 11: Line 8:


== External links ==
== External links ==
* [https://eprint.iacr.org/2016/468.pdf Chaos Machine: Theory]
* [https://github.com/maciejczyzewski/libchaos#chaos-machines-theorypdf Libchaos - implemented chaos machines]
* [http://pastebin.com/raw/1TJcVbYU Randomness tests of NCG]
* [https://eprint.iacr.org/2016/468.pdf Official paper published at IACR]


== References ==
== References ==

Revision as of 17:27, 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 presents the idea to create a universal scheme with modular design and customizable parameters, that can be applied where randomness and sensitiveness is needed.

Theoretical model was published[1] in early 2015 by 16-year-old 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

References

  1. ↑ 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. 

Template:Crypto-stub