|LSA Python Implementation
The Lucente Stabile Atkins cryptosystem is an symmetric encryption algorithm which is based on both group and number theory that follows Kirchhoffs principal, and relies on a specific case of Gauss’ Generalization of Wilson’s Theorem. Unlike prime factorization based algorithms, LSA does not rely on the computational infeasability for security. For this reason, we aim to show that LSA is not only more secure than existing symmetric algorithms, but is also computationally faster.
This paper was originally authored by Francesco Lucente Stabile and Carey Patrick Atkins while at Salem State University. During this time, the three of us took the same Introduction to Cryptography graduate course as undergraduate students. After completing the theorem, and the patent filed, Francesco and Carey invited me to assist in the computer science portion of the research, where I programmed the Python prototype and begun research on the C++ implementation.