A new Polynomial based Symmetric Key Algorithm using Polynomial Interpolation Methods

The main attributes of a security framework are Confidentiality, Authentication, and Data integrity. There are two main standards of cryptography algorithms categorized as private or symmetric and public or asymmetric algorithms, symmetric algorithms use one secret key to encrypt and decrypt payload...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings (International Conference on Communication Systems and Network Technologies Online) S. 675 - 681
Hauptverfasser: Hasija, Taniya, Ramkumar, K. R., Singh, Bhupendra, Kaur, Amanpreet, Mittal, Sudesh Kumar
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 08.04.2023
Schlagworte:
Authentication
Banking
Communication systems
Data integrity
Economy
Elliptic curve cryptography
Enterprises
Interpolation
Newton Raphson
Polynomial Interpolation
Post Quantum Cryptography
Quantum computing
Secant Method
Supercomputers
ISSN:2473-5655
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The main attributes of a security framework are Confidentiality, Authentication, and Data integrity. There are two main standards of cryptography algorithms categorized as private or symmetric and public or asymmetric algorithms, symmetric algorithms use one secret key to encrypt and decrypt payloads, the list includes Data Encryption Standard (DES), Advanced Encryption Standard (AES), RC5, Blowfish, and others, and asymmetric algorithms use key pairs consists of public and private keys, RSA, and Elliptic Curve Cryptography are two best examples of the same. In spite of their successful implementations, these standards suffer from various attacks, and the beginning of large-scale quantum is the biggest threat to the commonly used cryptography algorithms. In general, Public-key cryptography relies upon mathematical problems that are hard to be broken with the available computational power but it is believed that quantum computers can break them at polynomial solvable time in future. Quantum-safe cryptography refers to a new generation of algorithms that are resilient against attacks launched by both classical and quantum computers. This work designs and implements a novel cryptography standard using polynomial interpolations to make it both supercomputer and quantum safe.
ISSN:2473-5655
DOI:10.1109/CSNT57126.2023.10134686