Paper 2019/1006 Original: eprint.iacr.org/2019/1006 ↗
Lucente Stabile Atkins (LSA) Cryptosystem (Unbreakable)
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2019-09-06: last updated
- 2019-09-06: published
- Short URL
- https://ia.cr/2019/1006
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2019/1006,
author = {Francesco Lucente Stabile and Carey Patrick Atkins},
title = {Lucente Stabile Atkins (LSA) Cryptosystem (Unbreakable)},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/1006},
year = {2019},
url = {https://eprint.iacr.org/2019/1006}
}