Cryptology ePrint Archive: Report 2021/495

Hiding Data in Plain Sight: Towards Provably Unbreakable Encryption with Short Secret Keys and One-Way Functions

Mircea Digulescu

Abstract: It has long been known that cryptographic schemes offering provably unbreakable security exist - namely the One Time Pad (OTP). The OTP, however, comes at the cost of a very long secret key - as long as the plain-text itself. In this paper we propose an encryption scheme which we (boldly) claim offers the same level of security as the OTP, while allowing for much shorter keys, of size polylogarithmic in the computing power available to the adversary. The Scheme requires a large sequence of truly random words, of length polynomial in the both plain-text size and the logarithm of the computing power the adversary has. We claim that it ensures such an attacker cannot discern the cipher output from random data, except with small probability. We also show how it can be adapted to allow for several plain-texts to be encrypted in the same cipher output, with almost independent keys. Also, we describe how it can be used in lieu of a One Way Function.

Category / Keywords: secret-key cryptography / Encryption, Provable Security, Chaos Machine, Truly Random, One Time Pad, One Way Function

Original Publication (with minor differences): ResearchGate.net
DOI:
10.13140/RG.2.2.34319.94887

Date: received 17 Apr 2021

Contact author: mircea digulescu at mail ru

Available format(s): PDF | BibTeX Citation

Note: Licensed under CC BY-NC (creative commons attribution-noncommercial) license.

Version: 20210419:061008 (All versions of this report)

Short URL: ia.cr/2021/495


[ Cryptology ePrint archive ]