Cryptology ePrint Archive: Report 2022/567

FC1: A Powerful, Non-Deterministic, Symmetric Key Cipher

Michele Fabbrini

Abstract: In this paper we describe a symmetric key algorithm that offers an unprecedented grade of confidentiality. Based on the uniqueness of the modular multiplicative inverse of a positive integer a modulo n and on its computability in a polynomial time, this non-deterministic cipher can easily and quickly handle keys of millions or billions of bits that an attacker does not even know the length of. The algorithm’s primary key is the modulo, while the ciphertext is given by the concatenation of the modular inverse of blocks of plaintext whose length is randomly chosen within a predetermined range. In addition to the full specification, we present a working implementation of it in Julia Programming Language, accompanied by real examples of encryption and decryption.

Category / Keywords: secret-key cryptography / symmetric key cipher, non-deterministic algorithm

Date: received 9 May 2022, last revised 12 May 2022

Contact author: fc1 at fabbrini org

Available format(s): PDF | BibTeX Citation

Version: 20220512:041936 (All versions of this report)

Short URL: ia.cr/2022/567


[ Cryptology ePrint archive ]