Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Making many iterations with a hash function has a few subtleties, because there must be some kind of "salting" involved, and because existing hash functions are not as "random" as what could be hoped for; so care must be taken, in which case you end up with <a href="http://en.wikipedia.org/wiki/PBKDF2" rel="noreferrer">PBKDF2</a>. PBKDF2 was designed for <em>key derivation</em>, which is not exactly the same than password hashing, but it turned out to be quite good at it too.</p> <p>bcrypt has a (slight) advantage over PBKDF2-with-SHA-1 in that bcrypt is derived from the <a href="http://en.wikipedia.org/wiki/Blowfish_%28cipher%29" rel="noreferrer">Blowfish</a> block cipher. The point of having many iterations is to make the password processing slow, and, in particular, slow for the attacker. We <em>tolerate</em> that the function is made slow for the normal, honest systems, because it thwarts extensive password guessing. But an attacker may use hardware which the normal system does not use, e.g. a <a href="http://en.wikipedia.org/wiki/GPGPU" rel="noreferrer">programmable GPU</a>, which gives quite a boost to computations which fit well on that kind of hardware. Blowfish and bcrypt use RAM-based lookup tables (tables which are <em>modified</em> during the processing); such tables are easy to handle for a general purpose CPU, but quite cumbersome on a GPU; thus, bcrypt somewhat hinders processing enhancement by the attacker with GPU. That's a bonus which makes bcrypt a bit more desirable for a password storage than PBKDF2.</p>
    singulars
    1. This table or related slice is empty.
    1. POHow is bcrypt more future proof than increasing the number of SHA iterations?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USThomas Pornin
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POHow is bcrypt more future proof than increasing the number of SHA iterations?
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload