Cryptology ePrint Archive: Report 2007/412

Proposing a Master One-Way Function

Gideon Samid

Abstract: Making an arbitrary binary string fit as a fixed size cipher key (via hashing) one could use an arbitrary string x as both plaintext and key to generate a ciphertext, y defined as "the crypto square of x", while x is the crypto square root of y. Extended to higher powers, this formalism allows for polynomial morphology that combines all one-way functions candidates into a single master function which is at least as intractable as its best ingredient one-way function. The master list has some interesting and useful attributes: at will size for both input and output, controlled forward computational burden, milestone computing, and of course the best practical chance for being one-way.

Category / Keywords: one-way functions, intractability, cryptographic polynomial morphology

Date: received 3 Oct 2007, last revised 7 Nov 2007

Contact author: gideon samid at case edu

Available format(s): PDF | BibTeX Citation

Version: 20071108:015311 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]