title: Idea for protecting hashed passwords
body: <p>Since breaking password hashes has become a new passtime for scriptkiddies, I thought of the problem and came up with a novel(?) idea. </p>
  
  <ol>
  <li>store the pass as offset+number instead of hash</li>
  <li>the number is a product of two large primes</li>
  <li>the password is converted into a number , offset is added and that prime is used to divide the number. If it divides AND the divisor is the larger of the two primes the password is correct. </li>
  </ol>
  
  <p>by definition , each hash is unique and each password can be hashed in many different ways depending on the offset. Breaking one hash means you have to factor the number(which is hard), then find a word which corresponds to a number that is largerprime-offset (which is trivial). </p>
  
  <p>To generate use function f() to turn password into a password-number (not important) , generate two random primes larger than 2^4096 or however much is enough. Take the larger prime and calculate prime-passwordnumber=offset. Multiply the primes to get "number". store number and offset. </p>
  
  <p>To check. use function f() to turn password into a password-number, add offset to find prime. divide number with prime to get the other prime. Check that the first prime was the bigger of the two. If so, password was correct. </p>
  
  <p>f() might be for example utf-8 encoding of the password understood as a large binary integer. </p>