Publickey encryption by ordering

TL;DR

This paper explores a new public key encryption scheme based on permutation groups, aiming to improve speed and security over traditional methods like RSA, and investigates its potential through implementation.

Contribution

It introduces a novel public key encryption approach using permutation groups as noncommutative structures, expanding cryptographic options beyond matrices.

Findings

Proposed a permutation group-based encryption scheme.

Implemented the cryptosystem to evaluate its potential.

Discussed the security considerations of the new scheme.

Abstract

In 1999, public key cryptography using the matrix was devised by a hish school student of 16 yesrs old girl Sarah Flannery. This cryptosystem seemed faster than RSA, and it's having the strength to surpass even the encryption to RSA. However, this encryption scheme was broken bfore har papers were published. In this paper, We try to construct publickey encryption scheme from permutation group that is equivalent to matrix as noncommutative group. And we explore the potential of this cryptsystem through implementation.