Fast computation of cyclic convolutions and their applications in code-based asymmetric encryption schemes
The development of fast algorithms for key generation, encryption and decryption not only increases the efficiency of related operations. Such fast algorithms, for example, for asymmetric cryptosystems on quasi-cyclic codes, make it possible to experimentally study the dependence of decoding failure...
Saved in:
Main Authors: | Andrey N. Sushko, Boris Y. Steinberg, Kirill V. Vedenev, Anton A. Glukhikh, Yury V. Kosolapov |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2023-12-01
|
Series: | Моделирование и анализ информационных систем |
Subjects: | |
Online Access: | https://www.mais-journal.ru/jour/article/view/1825 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A New Asymmetric Fully Homomorphic Encryption Scheme for Cloud Banking Data
by: Zana Thalage Omar, et al.
Published: (2021-01-01) -
Secured cloud-based image data processing of self-driving vehicles using full homomorphic encryption
by: Kamran Saeed, et al.
Published: (2025-10-01) -
Optical Image Encryption With Divergent Illumination and Asymmetric Keys
by: Xiaogang Wang, et al.
Published: (2017-01-01) -
Comprehensive Review and Analysis of Image Encryption Techniques
by: K. Mahalakshmi, et al.
Published: (2025-01-01) -
Retrieving Encrypted Images Using Convolution Neural Network and Fully Homomorphic Encryption
by: Emad M. Alsaedi, et al.
Published: (2023-02-01)