Chaos machine - Revision history

Idea: Idea moved page Archive:Chaos machine to Chaos machine

2026-09-29T18:45:50Z

Idea moved page Archive:Chaos machine to Chaos machine

← Older revision	Revision as of 18:45, 29 September 2026
(No difference)

Idea at 18:45, 29 September 2026

2026-09-29T18:45:24Z

← Older revision		Revision as of 18:45, 29 September 2026
Line 1:		Line 1:

	~~{{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>

Waza: Remove deletion notice

2026-09-29T06:41:15Z

Remove deletion notice

← Older revision		Revision as of 06:41, 29 September 2026
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}}

Waza: 24 revisions imported: Import with full history

2026-09-29T06:38:43Z

24 revisions imported: Import with full history

← Older revision	Revision as of 06:38, 29 September 2026
(No difference)

wikipedia>Atoponce: Nominate for deletion

2026-09-25T17:41:22Z

Nominate for deletion

← Older revision		Revision as of 17:41, 25 September 2026
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>

wikipedia>Spintendo: Multiple author names found within singular author name parameters replaced with enumerated author parameters in order to clear the resulting CS1 maintenance error.

2024-11-09T11:18:36Z

Multiple author names found within singular author name parameters replaced with enumerated author parameters in order to clear the resulting CS1 maintenance error.

← Older revision		Revision as of 11:18, 9 November 2024
Line 2:		Line 2:
	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>

	Theoretical model was published in early 2016 by Maciej A. Czyzewski.<ref name=":0">{{cite report \|url=https://eprint.iacr.org/2016/468 \|title=Chaos Machine: Different Approach to the Application and Significance of Numbers \|publisher=Cryptology ePrint Archive, Report 2016/468 \|author=Maciej A. Czyzewski\|language=English \|year=2016}}</ref> 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 hash]]es, [[message authentication codes]] and [[randomness extractor]]s.<ref>{{cite web\|last=Barker\|first=Elaine\|title=Recommendation for Key Management\|url=http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf\|work=[[NIST]] Special Publication 800-57\|publisher=[[NIST]]\|accessdate=19 August 2013\|author2=Barker, William \|author3=Burr, William \|author4=Polk, William \|author5= Smid, Miles \|date=July 2012}}</ref><ref>{{cite book \|url=http://opac.inria.fr/record=b1101628 \|title=Complex systems : chaos and beyond a constructive approach with applications in life sciences \|publisher=Springer \|isbn=3-540-67202-8 \|series=Physics and astronomy online library \|language=Japanese \|~~author~~=Kaneko, Kunihiko ~~and~~ Tsuda, Ichiro \|year=2001 \|access-date=2016-12-27 \|archive-url=https://web.archive.org/web/20161228124156/http://opac.inria.fr/record=b1101628 \|archive-date=2016-12-28 \|url-status=dead }}</ref>		Theoretical model was published in early 2016 by Maciej A. Czyzewski.<ref name=":0">{{cite report \|url=https://eprint.iacr.org/2016/468 \|title=Chaos Machine: Different Approach to the Application and Significance of Numbers \|publisher=Cryptology ePrint Archive, Report 2016/468 \|author=Maciej A. Czyzewski\|language=English \|year=2016}}</ref> 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 hash]]es, [[message authentication codes]] and [[randomness extractor]]s.<ref>{{cite web\|last=Barker\|first=Elaine\|title=Recommendation for Key Management\|url=http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf\|work=[[NIST]] Special Publication 800-57\|publisher=[[NIST]]\|accessdate=19 August 2013\|author2=Barker, William \|author3=Burr, William \|author4=Polk, William \|author5= Smid, Miles \|date=July 2012}}</ref><ref>{{cite book \|url=http://opac.inria.fr/record=b1101628 \|title=Complex systems : chaos and beyond a constructive approach with applications in life sciences \|publisher=Springer \|isbn=3-540-67202-8 \|series=Physics and astronomy online library \|language=Japanese \|last1=Kaneko\|first1= Kunihiko\|last2= Tsuda\|first2= Ichiro \|year=2001 \|access-date=2016-12-27 \|archive-url=https://web.archive.org/web/20161228124156/http://opac.inria.fr/record=b1101628 \|archive-date=2016-12-28 \|url-status=dead }}</ref>

	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. <ref name=":0" />		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. <ref name=":0" />

wikipedia>LucasBrown: /* top */Fixed typo

2024-10-31T03:22:03Z

top: Fixed typo

← Older revision		Revision as of 03:22, 31 October 2024
Line 1:		Line 1:
	{{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 ~~oracle~~]]. 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>

	Theoretical model was published in early 2016 by Maciej A. Czyzewski.<ref name=":0">{{cite report \|url=https://eprint.iacr.org/2016/468 \|title=Chaos Machine: Different Approach to the Application and Significance of Numbers \|publisher=Cryptology ePrint Archive, Report 2016/468 \|author=Maciej A. Czyzewski\|language=English \|year=2016}}</ref> 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 hash]]es, [[message authentication codes]] and [[randomness extractor]]s.<ref>{{cite web\|last=Barker\|first=Elaine\|title=Recommendation for Key Management\|url=http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf\|work=[[NIST]] Special Publication 800-57\|publisher=[[NIST]]\|accessdate=19 August 2013\|author2=Barker, William \|author3=Burr, William \|author4=Polk, William \|author5= Smid, Miles \|date=July 2012}}</ref><ref>{{cite book \|url=http://opac.inria.fr/record=b1101628 \|title=Complex systems : chaos and beyond a constructive approach with applications in life sciences \|publisher=Springer \|isbn=3-540-67202-8 \|series=Physics and astronomy online library \|language=Japanese \|author=Kaneko, Kunihiko and Tsuda, Ichiro \|year=2001 \|access-date=2016-12-27 \|archive-url=https://web.archive.org/web/20161228124156/http://opac.inria.fr/record=b1101628 \|archive-date=2016-12-28 \|url-status=dead }}</ref>		Theoretical model was published in early 2016 by Maciej A. Czyzewski.<ref name=":0">{{cite report \|url=https://eprint.iacr.org/2016/468 \|title=Chaos Machine: Different Approach to the Application and Significance of Numbers \|publisher=Cryptology ePrint Archive, Report 2016/468 \|author=Maciej A. Czyzewski\|language=English \|year=2016}}</ref> 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 hash]]es, [[message authentication codes]] and [[randomness extractor]]s.<ref>{{cite web\|last=Barker\|first=Elaine\|title=Recommendation for Key Management\|url=http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf\|work=[[NIST]] Special Publication 800-57\|publisher=[[NIST]]\|accessdate=19 August 2013\|author2=Barker, William \|author3=Burr, William \|author4=Polk, William \|author5= Smid, Miles \|date=July 2012}}</ref><ref>{{cite book \|url=http://opac.inria.fr/record=b1101628 \|title=Complex systems : chaos and beyond a constructive approach with applications in life sciences \|publisher=Springer \|isbn=3-540-67202-8 \|series=Physics and astronomy online library \|language=Japanese \|author=Kaneko, Kunihiko and Tsuda, Ichiro \|year=2001 \|access-date=2016-12-27 \|archive-url=https://web.archive.org/web/20161228124156/http://opac.inria.fr/record=b1101628 \|archive-date=2016-12-28 \|url-status=dead }}</ref>

wikipedia>LucasBrown: Added short description

2024-10-28T01:35:09Z

Added short description

← Older revision		Revision as of 01:35, 28 October 2024
Line 1:		Line 1:
			{{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 oracle]]. 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 oracle]]. 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>

wikipedia>Rectech enthusiast: Corrected a year that was mentioned and expanded with a bit more info

2024-07-17T07:57:14Z

Corrected a year that was mentioned and expanded with a bit more info

← Older revision		Revision as of 07:57, 17 July 2024
Line 1:		Line 1:
	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 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 oracle]]. 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>

	Theoretical model was published in early ~~2015~~ by Maciej A. Czyzewski.<ref>{{cite report \|url=https://eprint.iacr.org/2016/468 \|title=Chaos Machine: Different Approach to the Application and Significance of Numbers \|publisher=Cryptology ePrint Archive, Report 2016/468 \|author=Maciej A. Czyzewski\|language=English \|year=2016}}</ref> 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 hash]]es, [[message authentication codes]] and [[randomness extractor]]s.<ref>{{cite web\|last=Barker\|first=Elaine\|title=Recommendation for Key Management\|url=http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf\|work=[[NIST]] Special Publication 800-57\|publisher=[[NIST]]\|accessdate=19 August 2013\|author2=Barker, William \|author3=Burr, William \|author4=Polk, William \|author5= Smid, Miles \|date=July 2012}}</ref><ref>{{cite book \|url=http://opac.inria.fr/record=b1101628 \|title=Complex systems : chaos and beyond a constructive approach with applications in life sciences \|publisher=Springer \|isbn=3-540-67202-8 \|series=Physics and astronomy online library \|language=Japanese \|author=Kaneko, Kunihiko and Tsuda, Ichiro \|year=2001 \|access-date=2016-12-27 \|archive-url=https://web.archive.org/web/20161228124156/http://opac.inria.fr/record=b1101628 \|archive-date=2016-12-28 \|url-status=dead }}</ref>		Theoretical model was published in early 2016 by Maciej A. Czyzewski.<ref name=":0">{{cite report \|url=https://eprint.iacr.org/2016/468 \|title=Chaos Machine: Different Approach to the Application and Significance of Numbers \|publisher=Cryptology ePrint Archive, Report 2016/468 \|author=Maciej A. Czyzewski\|language=English \|year=2016}}</ref> 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 hash]]es, [[message authentication codes]] and [[randomness extractor]]s.<ref>{{cite web\|last=Barker\|first=Elaine\|title=Recommendation for Key Management\|url=http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf\|work=[[NIST]] Special Publication 800-57\|publisher=[[NIST]]\|accessdate=19 August 2013\|author2=Barker, William \|author3=Burr, William \|author4=Polk, William \|author5= Smid, Miles \|date=July 2012}}</ref><ref>{{cite book \|url=http://opac.inria.fr/record=b1101628 \|title=Complex systems : chaos and beyond a constructive approach with applications in life sciences \|publisher=Springer \|isbn=3-540-67202-8 \|series=Physics and astronomy online library \|language=Japanese \|author=Kaneko, Kunihiko and Tsuda, Ichiro \|year=2001 \|access-date=2016-12-27 \|archive-url=https://web.archive.org/web/20161228124156/http://opac.inria.fr/record=b1101628 \|archive-date=2016-12-28 \|url-status=dead }}</ref>

			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. <ref name=":0" />

	== See also ==		== See also ==

wikipedia>Jlwoodwa: MOS:ORDER

2024-04-29T18:08:12Z

MOS:ORDER

← Older revision		Revision as of 18:08, 29 April 2024
Line 6:		Line 6:
	* [[Merkle–Damgård construction]]		* [[Merkle–Damgård construction]]
	* [[Sponge function]]		* [[Sponge function]]

			== References ==
			{{reflist}}

	== External links ==		== External links ==
	* [https://github.com/maciejczyzewski/libchaos#chaos-machines-theorypdf Libchaos - implemented chaos machines]		* [https://github.com/maciejczyzewski/libchaos#chaos-machines-theorypdf Libchaos - implemented chaos machines]
	* [https://eprint.iacr.org/2016/468.pdf Official paper published at IACR]		* [https://eprint.iacr.org/2016/468.pdf Official paper published at IACR]

	~~== References ==~~

	~~{{reflist}}~~

	[[Category:Theory of cryptography]]		[[Category:Theory of cryptography]]

← Older revision		Revision as of 03:22, 31 October 2024
Line 1:		Line 1:
	{{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 ~~oracle~~]]. 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>

	Theoretical model was published in early 2016 by Maciej A. Czyzewski.<ref name=":0">{{cite report \|url=https://eprint.iacr.org/2016/468 \|title=Chaos Machine: Different Approach to the Application and Significance of Numbers \|publisher=Cryptology ePrint Archive, Report 2016/468 \|author=Maciej A. Czyzewski\|language=English \|year=2016}}</ref> 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 hash]]es, [[message authentication codes]] and [[randomness extractor]]s.<ref>{{cite web\|last=Barker\|first=Elaine\|title=Recommendation for Key Management\|url=http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf\|work=[[NIST]] Special Publication 800-57\|publisher=[[NIST]]\|accessdate=19 August 2013\|author2=Barker, William \|author3=Burr, William \|author4=Polk, William \|author5= Smid, Miles \|date=July 2012}}</ref><ref>{{cite book \|url=http://opac.inria.fr/record=b1101628 \|title=Complex systems : chaos and beyond a constructive approach with applications in life sciences \|publisher=Springer \|isbn=3-540-67202-8 \|series=Physics and astronomy online library \|language=Japanese \|author=Kaneko, Kunihiko and Tsuda, Ichiro \|year=2001 \|access-date=2016-12-27 \|archive-url=https://web.archive.org/web/20161228124156/http://opac.inria.fr/record=b1101628 \|archive-date=2016-12-28 \|url-status=dead }}</ref>		Theoretical model was published in early 2016 by Maciej A. Czyzewski.<ref name=":0">{{cite report \|url=https://eprint.iacr.org/2016/468 \|title=Chaos Machine: Different Approach to the Application and Significance of Numbers \|publisher=Cryptology ePrint Archive, Report 2016/468 \|author=Maciej A. Czyzewski\|language=English \|year=2016}}</ref> 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 hash]]es, [[message authentication codes]] and [[randomness extractor]]s.<ref>{{cite web\|last=Barker\|first=Elaine\|title=Recommendation for Key Management\|url=http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf\|work=[[NIST]] Special Publication 800-57\|publisher=[[NIST]]\|accessdate=19 August 2013\|author2=Barker, William \|author3=Burr, William \|author4=Polk, William \|author5= Smid, Miles \|date=July 2012}}</ref><ref>{{cite book \|url=http://opac.inria.fr/record=b1101628 \|title=Complex systems : chaos and beyond a constructive approach with applications in life sciences \|publisher=Springer \|isbn=3-540-67202-8 \|series=Physics and astronomy online library \|language=Japanese \|author=Kaneko, Kunihiko and Tsuda, Ichiro \|year=2001 \|access-date=2016-12-27 \|archive-url=https://web.archive.org/web/20161228124156/http://opac.inria.fr/record=b1101628 \|archive-date=2016-12-28 \|url-status=dead }}</ref>