Paper 2023/1033

OWF Candidates Based on: Xors, Error Detection Codes, Permutations, Polynomials, Interaction and Nesting

Pawel Cyprys, Ben-Gurion University of the Negev
Shlomi Dolev, Ben-Gurion University of the Negev
Oded Margalit, Ben-Gurion University of the Negev
Abstract

Our research focuses on achieving perfect provable encryption by drawing inspiration from the principles of a one-time pad. We explore the potential of leveraging the unique properties of the one-time pad to design effective one-way functions. Our methodology involves the application of the exclusive-or (xor) operation to two randomly chosen strings. To address concerns related to preimage mappings, we incorporate error detection codes. Additionally, we utilize permutations to overcome linearity issues in the computation process. In order to enhance the security of our approach, we propose the integration of a secret-sharing scheme based on a linear polynomial. This helps mitigate collisions and adds an additional layer of perfect security. We thoroughly investigate the interactions between different aspects of one-way functions to strengthen the reliability of commitments. Lastly, we explore the possibility of nesting one-way functions as a countermeasure against potential backdoors. Through our study, we aim to contribute to the advancement of secure encryption techniques by leveraging the inherent strengths of the one-time pad and carefully considering the interplay of various components in the design of one-way functions.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
Keywords
One way functionsOne time padSecret sharing
Contact author(s)
cyprysp @ gmail com
dolev @ cs bgu ac il
oded margalit @ gmail com
History
2023-07-05: approved
2023-07-03: received
See all versions
Short URL
https://ia.cr/2023/1033
License
No rights reserved
CC0

BibTeX

@misc{cryptoeprint:2023/1033,
      author = {Pawel Cyprys and Shlomi Dolev and Oded Margalit},
      title = {OWF Candidates Based on: Xors, Error Detection Codes, Permutations, Polynomials, Interaction and Nesting},
      howpublished = {Cryptology ePrint Archive, Paper 2023/1033},
      year = {2023},
      note = {\url{https://eprint.iacr.org/2023/1033}},
      url = {https://eprint.iacr.org/2023/1033}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.