<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	>
<channel>
	<title>Comments on: Keccak background</title>
	<atom:link href="http://jfxpt.com/2019/keccak-background/feed/" rel="self" type="application/rss+xml" />
	<link>http://jfxpt.com/2019/keccak-background/</link>
	<description>The search for invariants</description>
	<pubDate>Sun, 19 Apr 2026 05:35:51 +0000</pubDate>
	<generator>http://polimedia.us</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: keksum, a Keccak implementation in C as standalone Unix utility: genesis &#171; Fixpoint</title>
		<link>http://jfxpt.com/2019/keccak-background/#comment-86</link>
		<dc:creator>keksum, a Keccak implementation in C as standalone Unix utility: genesis &#171; Fixpoint</dc:creator>
		<pubDate>Wed, 04 Dec 2019 17:37:00 +0000</pubDate>
		<guid isPermaLink="false">http://fixpoint.welshcomputing.com/?p=69#comment-86</guid>
		<description>[...] produced a Keccak implementation in May 2019, through about one week of intensive study and hacking. It builds on [...]</description>
		<content:encoded><![CDATA[<p>[...] produced a Keccak implementation in May 2019, through about one week of intensive study and hacking. It builds on [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Stanislav Datskovskiy</title>
		<link>http://jfxpt.com/2019/keccak-background/#comment-84</link>
		<dc:creator>Stanislav Datskovskiy</dc:creator>
		<pubDate>Tue, 03 Dec 2019 20:27:49 +0000</pubDate>
		<guid isPermaLink="false">http://fixpoint.welshcomputing.com/?p=69#comment-84</guid>
		<description>Re: Ada/GNAT -- as described on Mocky's (RIP) www -- I picked it (and later other folks grudgingly agreed) via a "healthiest horse in glue factory" exhaustive search process, starting from a "pointer arithmetic and type casting Must Die" precept.

It was the one and only prog. language I turned up where: overflowism goes to its long-overdue grave; paper standards exist, going back to 1980s; reasonably-mature compiler for all commonplace irons; no GC or other heavy runtime ball-and-chains.

IMHO it is possible to implement a sane (i.e. less than 50kLoc, say) self-eating compiler for the subset of the language I and others made use of (snip out the OOPisms; microshit, vax, etc. dead platforms support, other superfluous rubbish.)

Re: Keccak -- similar "glue factory" process, but orig. initiated by MP (I found no catastrophic flaw such as to disagree); must note that it suffers from same problem as e.g. Serpent (and all known symmetric ciphers) -- i.e. neither Keccak nor any other known hash algo rests on any number-theoretical conjecture, but instead all were made by the same process as the other "voodoo products" in the &lt;a href="http://btcbase.org/log/2017-03-02#1621201" rel="nofollow"&gt;"hashes-PRNGs-symmciphers triangle"&lt;/a&gt; -- "it appeared to be hard to break for author himself, therefore Must Be strong".</description>
		<content:encoded><![CDATA[<p>Re: Ada/GNAT -- as described on Mocky's (RIP) www -- I picked it (and later other folks grudgingly agreed) via a "healthiest horse in glue factory" exhaustive search process, starting from a "pointer arithmetic and type casting Must Die" precept.</p>
<p>It was the one and only prog. language I turned up where: overflowism goes to its long-overdue grave; paper standards exist, going back to 1980s; reasonably-mature compiler for all commonplace irons; no GC or other heavy runtime ball-and-chains.</p>
<p>IMHO it is possible to implement a sane (i.e. less than 50kLoc, say) self-eating compiler for the subset of the language I and others made use of (snip out the OOPisms; microshit, vax, etc. dead platforms support, other superfluous rubbish.)</p>
<p>Re: Keccak -- similar "glue factory" process, but orig. initiated by MP (I found no catastrophic flaw such as to disagree); must note that it suffers from same problem as e.g. Serpent (and all known symmetric ciphers) -- i.e. neither Keccak nor any other known hash algo rests on any number-theoretical conjecture, but instead all were made by the same process as the other "voodoo products" in the <a href="http://btcbase.org/log/2017-03-02#1621201" rel="nofollow">"hashes-PRNGs-symmciphers triangle"</a> -- "it appeared to be hard to break for author himself, therefore Must Be strong".</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Diana Coman</title>
		<link>http://jfxpt.com/2019/keccak-background/#comment-83</link>
		<dc:creator>Diana Coman</dc:creator>
		<pubDate>Tue, 03 Dec 2019 19:20:36 +0000</pubDate>
		<guid isPermaLink="false">http://fixpoint.welshcomputing.com/?p=69#comment-83</guid>
		<description>I hear you re GNAT. There is however &lt;a href="http://ave1.org/category/ada/" rel="nofollow"&gt;ave1's work&lt;/a&gt; on owning that beast.</description>
		<content:encoded><![CDATA[<p>I hear you re GNAT. There is however <a href="http://ave1.org/category/ada/" rel="nofollow">ave1's work</a> on owning that beast.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
