<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>https://ecency.com</link><image><url>https://ecency.com/logo512.png</url><title>RSS Feed</title><link>https://ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Mon, 10 Aug 2026 05:29:19 GMT</lastBuildDate><atom:link href="https://ecency.com/created/hmac/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Hmac-md5]]></title><description><![CDATA[HMAC-MD5 is described as 'The MD5 Message-Digest Algorithm' and basically coding below this The strongest attack known against HMAC is based on the frequency of collisions for the hash function H]]></description><link>https://ecency.com/@tkgcci/hmac-md5</link><guid isPermaLink="true">https://ecency.com/@tkgcci/hmac-md5</guid><category><![CDATA[hmac]]></category><dc:creator><![CDATA[tkgcci]]></dc:creator><pubDate>Tue, 10 Dec 2019 20:58:21 GMT</pubDate><enclosure url="https://i.ecency.com/p/JvFFVmatwWHRfvmtd53nmEJ94xpKydwmbSC5H5svBACH7ymYhY1CYrSsCYqqq6Ec9hkQzo94v8x7UStqwWPhP8t5PruLXRm4DaRnUFm7eBo328DEgBvCdLsrn65udVjsnQgGdP3L1k?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[每天进步一点点：HASH以及HMAC]]></title><description><![CDATA[今天早些时候的帖子提到一个STEEM的菠菜应用Magic Dice，并且我说它解决了透明性和公平性等问题，简单来讲，就是庄家（服务提供者）无法出老千（控制开奖结果）。 (图源 ：pixabay) 在更进一步介绍它如何实现无法出老千这个问题之前，我们先来简单看看和密码学相关的两个概念。因为我不是专家，所以就粗略介绍一下，太深入的讲解就会贻笑大方的。 HASH]]></description><link>https://ecency.com/@oflyhigh/hash-hmac</link><guid isPermaLink="true">https://ecency.com/@oflyhigh/hash-hmac</guid><category><![CDATA[cn]]></category><dc:creator><![CDATA[oflyhigh]]></dc:creator><pubDate>Sun, 16 Dec 2018 10:22:33 GMT</pubDate><enclosure url="https://i.ecency.com/p/2gsjgna1uruvUuS7ndh9YqVwYGPLVszbFLwwpAYXYXi7kiRtPyZ4gHuqkqDfsgzQRughu8TQFKKDJcKS7PYtHRekjgc3eUVG2TM36xajTunHHiToHp?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>