<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=MASH-1</id>
	<title>MASH-1 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=MASH-1"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=MASH-1&amp;action=history"/>
	<updated>2026-05-15T12:15:11Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.32.0</generator>
	<entry>
		<id>http://en.zaoniao.it/index.php?title=MASH-1&amp;diff=2440&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;'''MASH-1''' ('''Modular Arithmetic Secure Hash''') is a hash function based on modular arithmetic.  == History == Despite many proposals, few hash functions based on...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=MASH-1&amp;diff=2440&amp;oldid=prev"/>
		<updated>2019-03-22T03:47:56Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;MASH-1&amp;#039;&amp;#039;&amp;#039; (&amp;#039;&amp;#039;&amp;#039;Modular Arithmetic Secure Hash&amp;#039;&amp;#039;&amp;#039;) is a &lt;a href=&quot;/Hash_function&quot; class=&quot;mw-redirect&quot; title=&quot;Hash function&quot;&gt;hash function&lt;/a&gt; based on &lt;a href=&quot;/index.php?title=Modular_arithmetic&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Modular arithmetic (page does not exist)&quot;&gt;modular arithmetic&lt;/a&gt;.  == History == Despite many proposals, few hash functions based on...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''MASH-1''' ('''Modular Arithmetic Secure Hash''') is a [[hash function]] based on [[modular arithmetic]].&lt;br /&gt;
&lt;br /&gt;
== History ==&lt;br /&gt;
Despite many proposals, few hash functions based on modular arithmetic have withstood attack, and most that have tend to be relatively inefficient. MASH-1 evolved from a long line of related proposals successively broken and repaired.&lt;br /&gt;
&lt;br /&gt;
== Standard ==&lt;br /&gt;
Committee Draft ISO/IEC 10118-4 (Nov 95)&lt;br /&gt;
&lt;br /&gt;
== Description ==&lt;br /&gt;
MASH-1 involves use of an [[RSA (algorithm)|RSA]]-like modulus M, whose bitlength affects the security. M should be difficult to [[factorization|factor]], and for M of unknown factorization, the security is based in part on the difficulty of extracting modular roots. M also determines the block size for processing messages.&lt;br /&gt;
&lt;br /&gt;
== MASH-2 ==&lt;br /&gt;
There is a new version of the algorithm called MASH-2 with a different exponent. The original &amp;amp;lt;math&amp;amp;gt;e=2&amp;amp;lt;/math&amp;amp;gt; is replaced by &amp;amp;lt;math&amp;amp;gt;e=2^8+1&amp;amp;lt;/math&amp;amp;gt;.&lt;br /&gt;
&lt;br /&gt;
==Source==&lt;br /&gt;
&lt;br /&gt;
[http://wikipedia.org/ http://wikipedia.org/]&lt;br /&gt;
[[Category:Cryptography]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>