Publickey encryption by ordering
This work addresses cryptographic security by proposing a new encryption method, but it appears incremental as it builds on prior broken schemes without demonstrating clear advantages.
The paper tackles constructing a public-key encryption scheme using permutation groups as a noncommutative alternative to matrices, exploring its potential through implementation, but does not report specific numerical results or performance metrics.
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.