Mutations of Cryptographic Algorithms

Data security aims to achieve confidentiality, integrity, and availability of data. To reach confidentiality, different encryption algorithms are needed. The most used today are RSA, AES, and Diffie-Helman. Although these algorithms are considered secure today, as the performance of computers increases, their security is radically reduced. Concerning the increasing performance of modern computers and the effort to use encryption algorithms in devices with limited memory, new encryption algorithms are being developed. Although post-quantum encryption algorithms are considered the most promising direction in this area, some scientists are also dealing with mutations of encryption algorithms. In this article, we deal with the design of two simple encryption algorithms - Vigener's cipher and matrix encryption. Next, we test these algorithms from the point of view of time requirements.

Authors

Institutions

Publication Details

Published
2024-10-24
DOI
https://doi.org/10.1109/iceta63795.2024.10850786
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Mutations of Cryptographic Algorithms

Peter Pekarčík, Eva Chovancová
Computability, Logic, AI Algorithms
article

Mutations of Cryptographic Algorithms

Peter Pekarčík, Eva Chovancová
article en

Abstract

Data security aims to achieve confidentiality, integrity, and availability of data. To reach confidentiality, different encryption algorithms are needed. The most used today are RSA, AES, and Diffie-Helman. Although these algorithms are considered secure today, as the performance of computers increases, their security is radically reduced. Concerning the increasing performance of modern computers and the effort to use encryption algorithms in devices with limited memory, new encryption algorithms are being developed. Although post-quantum encryption algorithms are considered the most promising direction in this area, some scientists are also dealing with mutations of encryption algorithms. In this article, we deal with the design of two simple encryption algorithms - Vigener's cipher and matrix encryption. Next, we test these algorithms from the point of view of time requirements.

Technical University of Košice (SK)
Openalex Percentile: Top 69%
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.