summaryrefslogtreecommitdiff
path: root/lib
diff options
context:
space:
mode:
authorTed Unangst <tedu@cvs.openbsd.org>2013-12-22 03:29:08 +0000
committerTed Unangst <tedu@cvs.openbsd.org>2013-12-22 03:29:08 +0000
commitc6cd5f748ec1bf7313c24ff3f895c632011a0379 (patch)
tree94090a4985382bd93468f4d0251db82a2bcd9a0e /lib
parentb4079fa1bade398c7c39e63e627ef746e35295b2 (diff)
tweak comment
Diffstat (limited to 'lib')
-rw-r--r--lib/libutil/bcrypt_pbkdf.c6
1 files changed, 3 insertions, 3 deletions
diff --git a/lib/libutil/bcrypt_pbkdf.c b/lib/libutil/bcrypt_pbkdf.c
index 0c1c1c52fbc..a3dc2775056 100644
--- a/lib/libutil/bcrypt_pbkdf.c
+++ b/lib/libutil/bcrypt_pbkdf.c
@@ -1,4 +1,4 @@
-/* $OpenBSD: bcrypt_pbkdf.c,v 1.4 2013/07/29 00:55:53 tedu Exp $ */
+/* $OpenBSD: bcrypt_pbkdf.c,v 1.5 2013/12/22 03:29:07 tedu Exp $ */
/*
* Copyright (c) 2013 Ted Unangst <tedu@openbsd.org>
*
@@ -41,8 +41,8 @@
*
* One modification from official pbkdf2. Instead of outputting key material
* linearly, we mix it. pbkdf2 has a known weakness where if one uses it to
- * generate (i.e.) 512 bits of key material for use as two 256 bit keys, an
- * attacker can merely run once through the outer loop below, but the user
+ * generate (e.g.) 512 bits of key material for use as two 256 bit keys, an
+ * attacker can merely run once through the outer loop, but the user
* always runs it twice. Shuffling output bytes requires computing the
* entirety of the key material to assemble any subkey. This is something a
* wise caller could do; we just do it for you.