An ECC with Probable Secure and Efficient Approach on Noncommutative Cryptography

Abstract

An Elliptic Curve Cryptography (ECC) is used on the Noncommutative Cryptographic (NCC) principles. The security and strengths of the manuscript are resilient on these two cryptographic assumptions. The claims on the Noncommutative cryptographic scheme on monomials generated elements is considered be based on hidden subgroup or subfield problems that strengthen this manuscript, where original assumptions are hidden and its equivalents semiring takes part in the computation process. In relation to the same, the research gap is well designed on Dihedral orders of 6 and 8, but our contributions are in security- and length-based attacks enhancement over Dihedral order 12, reported in work done. We modeled the said strategies and represent the ideal security concerns for applications.