2022
DOI: 10.21595/mme.2022.22517
|View full text |Cite
|
Sign up to set email alerts
|

MPF based symmetric cipher performance comparison to AES and TDES

Abstract: This paper presents a performance comparison of newly created matrix power function (MPF) based symmetric cipher realized in cipher-block chaining mode (CBC) with two other standardized ciphers namely AES-128 and triple DES. The encryption rate is compared using 64 bits arithmetic operations. It is shown that the proposed cipher has a significant advantage against compared ciphers. It is achieved by consuming more memory for MPF realization. Mentioned ciphers are compared using the central processing unit (CPU… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 10 publications
1
5
0
Order By: Relevance
“…We also think that a significant boost in the performance of our cipher is because matrix operations can be parallelized and hence the encryption of a single block can be executed on multiple processors. Relying on our findings presented in Mihalkovich et al (2022), we expect that the non-commuting platform group used in our paper also contributes to the performance of our scheme. Since all powers of the elements of M 2 t are reduced modulo 2 t , the reduction process is much simpler than reducing modulo a prime.…”
Section: Discussionsupporting
confidence: 55%
See 4 more Smart Citations
“…We also think that a significant boost in the performance of our cipher is because matrix operations can be parallelized and hence the encryption of a single block can be executed on multiple processors. Relying on our findings presented in Mihalkovich et al (2022), we expect that the non-commuting platform group used in our paper also contributes to the performance of our scheme. Since all powers of the elements of M 2 t are reduced modulo 2 t , the reduction process is much simpler than reducing modulo a prime.…”
Section: Discussionsupporting
confidence: 55%
“…Since all powers of the elements of M 2 t are reduced modulo 2 t , the reduction process is much simpler than reducing modulo a prime. For this reason, we think that our proposal can produce better results than those presented in Mihalkovich et al (2022). However, verifying this claim requires additional research thus far.…”
Section: Discussionmentioning
confidence: 57%
See 3 more Smart Citations