Paper 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.
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
Metadata
- Available format(s)
-
PDF
PS
- Category
- Foundations
- Publication info
- Published elsewhere. Summary presented at the CRYPTO 2003 Rump Session (by Mr. Stuart Haber)
- Keywords
- one-way functionspermutationscomplexity theorylower boundP vs NP problem
- Contact author(s)
- bzoltak @ vmpcfunction com
- History
- 2003-11-09: last of 2 revisions
- 2003-08-29: received
- See all versions
- Short URL
- https://ia.cr/2003/179
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2003/179,
author = {Bartosz Zoltak},
title = {{VMPC} One-Way Function},
howpublished = {Cryptology {ePrint} Archive, Paper 2003/179},
year = {2003},
url = {https://eprint.iacr.org/2003/179}
}
