<?xml version="1.0" encoding="windows-1252"?>
<node id="874083" title="Re^2: Password Generation and Module Multiplication" created="2010-11-28 03:11:24" updated="2010-11-28 03:11:24">
<type id="11">
note</type>
<author id="299049">
ysth</author>
<data>
<field name="doctext">
&lt;p&gt;Brute force attacks against a single password, granted.
&lt;/p&gt;
&lt;p&gt;But without complexity rules, a letter-only brute force attack or rainbow table attack against a list of hashed passwords will too easily pick off the lazy users.  I'd assume the complexity rules are really designed to protect against this case.
&lt;/p&gt;

&lt;!-- Node text goes above. Div tags should contain sig only --&gt;
&lt;div class="pmsig"&gt;&lt;div class="pmsig-299049"&gt;
&lt;small&gt;-- &lt;br /&gt;
A math joke: r = | |csc(&amp;theta;)|+|sec(&amp;theta;)|-||csc(&amp;theta;)|-|sec(&amp;theta;)|| |&lt;br /&gt;
[http://ysth.info/fortune/|Online Fortune Cookie Search]&lt;br /&gt;
[http://ysth.info/initech/|Office Space merchandise]
&lt;/small&gt;
&lt;/div&gt;&lt;/div&gt;</field>
<field name="root_node">
873020</field>
<field name="parent_node">
873256</field>
</data>
</node>
