Cryptology ePrint Archive: Report 2003/179

VMPC One-Way Function

Bartosz Zoltak

Abstract: The VMPC function is a combination of two basic operations: permutation composition and integer addition. The function resulting from this combination shows to have very high resistance to inverting. Computational effort of about 2^260 operations is estimated to be required to invert the VMPC function. The value of the function can be computed with 3 elementary computer processor instructions per byte. An open question is whether the function's simplicity raises a realistic chance that the lower bound on the complexity of inverting it might be proved.

Category / Keywords: foundations / one-way functions, permutations, complexity theory, lower bound, P vs NP problem

Publication Info: Summary presented at the CRYPTO 2003 Rump Session (by Mr. Stuart Haber)

Date: received 29 Aug 2003, last revised 9 Nov 2003

Contact author: bzoltak at vmpcfunction com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: The paper describes results of research on the VMPC function, done by Bartosz Zoltak from 1998 to 2003, with help of several Polish professors. Description of the inverting algorithm simplified

Version: 20031109:140437 (All versions of this report)

Short URL: ia.cr/2003/179

Discussion forum: Show discussion | Start new discussion