<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Salt on Micha Kops&#39; Tech Notes</title>
    <link>https://www.hascode.com/tags/salt/</link>
    <description>Recent content in Salt on Micha Kops&#39; Tech Notes</description>
    <generator>Hugo -- 0.147.8</generator>
    <language>en</language>
    <copyright>Copyright © 2010 - 2025 Micha Kops. #213243b1d6e8932079e09227d3f3ed0c806cd0c9</copyright>
    <lastBuildDate>Sun, 12 Jul 2015 00:00:00 +0200</lastBuildDate>
    <atom:link href="https://www.hascode.com/tags/salt/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Snippet: Creating secure Password Hashes in Java with Heimdall</title>
      <link>https://www.hascode.com/snippet-creating-secure-password-hashes-in-java-with-heimdall/</link>
      <pubDate>Sun, 12 Jul 2015 00:00:00 +0200</pubDate>
      <guid>https://www.hascode.com/snippet-creating-secure-password-hashes-in-java-with-heimdall/</guid>
      <description>&lt;div id=&#34;preamble&#34;&gt;
&lt;div class=&#34;sectionbody&#34;&gt;
&lt;div class=&#34;paragraph&#34;&gt;
&lt;p&gt;These days where a cheap GPU for about 100 € is capable to create 3 billion of MD5 Hashes per second, we need not only need to use salts the right way but we also need to choose a strong, non-reversible and slow hashing schemes when storing passwords in our application.&lt;/p&gt;
&lt;/div&gt;
&lt;div class=&#34;paragraph&#34;&gt;
&lt;p&gt;Heimdall is a library that implements a secure and upgradable password hashing mechanism and uses at the time of writing this article PBKDF2 SHA-1 HMAC with 20000 iterations and a 192 bit (24 byte) salt per default.&lt;/p&gt;
&lt;/div&gt;</description>
    </item>
  </channel>
</rss>
