Practical Issues Involved In Implementing The Lucente Stabile Atkins (LSA) Cryptosystem

Abstract

We discuss practical issues involved in implementing the Lucente Stabile Atkins (LSA) cryptosystem, a new asymmetric encryption algorithm that involves both group and number theory. The LSA algorithm requires a key exchange at the beginning of the process to define the group that will be used for the information sharing. We show that the LSA cryptosystem can be implemented with an algorithm that generates an arbitrarily large number of keys of various lengths using a computationally efficient method. By using this list of keys to determine the cyclic group to be used, we have developed a cryptosystem that can be more secure than existing encryption algorithms while also being computationally faster.