A pedagogical example of a stretched password-based key derivation function

Abstract

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.