Cryptology ePrint Archive: Report 2019/1006

Lucente Stabile Atkins (LSA) Cryptosystem (Unbreakable)

Francesco Lucente Stabile and Carey Patrick Atkins

Abstract: The LSA cryptosystem is an asymmetric encryption algorithm which is based on both group and number theory that follows Kerckhoffs’s principle and relies on a specific case of Gauss’s Generalization of Wilson’s Theorem. Unlike prime factorization based algorithms, the eavesdropping cryptanalyst has no indication that he has successfully decrypted the ciphertext. For this reason, we aim to show that LSAis not only more secure than existing asymmetric algorithms but has the potential to be significantly computationally faster.

Category / Keywords: public-key cryptography / public-key cryptography, quantum cryptography, RSA, ElGamal, secret sharing, one-time-pad, key exchange, number theory, group theory, Gauss's generalization of Wilson's Theorem, factoring, cryptanalysis

Date: received 4 Sep 2019

Contact author: marchesedp at gmail com,carey atkins@gmail com

Available format(s): PDF | BibTeX Citation

Version: 20190906:142432 (All versions of this report)

Short URL: ia.cr/2019/1006


[ Cryptology ePrint archive ]