Algebraic aspects of cryptography
Algebraic aspects of cryptography
Password security: a case history
Communications of the ACM
Secure Applications of Low-Entropy Keys
ISW '97 Proceedings of the First International Workshop on Information Security
Understanding Cryptography: A Textbook for Students and Practitioners
Understanding Cryptography: A Textbook for Students and Practitioners
SP 800-108. Recommendation for Key Derivation Using Pseudorandom Functions (Revised)
SP 800-108. Recommendation for Key Derivation Using Pseudorandom Functions (Revised)
| Hi-index | 0.00 |
This paper describes a teaching example of a stretched, pseudo password-based key derivation function. Specifically, this paper will highlight the use of the non-commutative dihedral group D16, digital roots, recurrence relations, modulo operation, and prime numbers in constructing recoverable stretched character string of any length given a weak password seed and a salt of arbitrary byte (octet) length. The algorithm described here can be used to introduce the above topics and their importance in further coursework, and be used as a relatively simple example which can lead to discussion on serious and very technical work in password stretching, random functions, hash functions, and password-based key derivation functions specifically, and cryptography in general.