[Resource Topic] 2019/1006: Lucente Stabile Atkins (LSA) Cryptosystem (Unbreakable)

Welcome to the resource topic for 2019/1006

Lucente Stabile Atkins (LSA) Cryptosystem (Unbreakable)

Authors: Francesco Lucente Stabile, Carey Patrick Atkins


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.

ePrint: https://eprint.iacr.org/2019/1006

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .