A block encryption algorithm based on exponentiation transform

Kapalova, Nursulu; Khompysh, Ardabek; Arıcı, Müslüm; Algazy, Kunbolat

doi:10.1080/23311916.2020.1788292

Cited by 7 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…From the obtained results, we can conclude that the ISL-LWC algorithm satisfies the statistical security criteria. statistic is compared with the tabular results and, depending on the probability of occurrence of such a statistic, a conclusion is made about its quality [23]. Among the advantages of these tests are their small number and the existence of fast execution algorithms.…”

Section: ) Nist Statistical Testsmentioning

confidence: 99%

Development of a New Lightweight Encryption Algorithm

Khompysh,

Kapalova,

Lizunov

et al. 2023

IJACSA

View full text Add to dashboard Cite

Due to the growing need to use devices with low hardware resources in everyday life, the likelihood of their susceptibility to various cyber-attacks increases. In this regard, one of the methods to ensure the security of information circulating in these devices is encryption. For devices with small hardware resources, the most applicable is low-resource (lightweight) cryptography. This article introduces a new lightweight encryption algorithm, ISL-LWS (Information Security Laboratorylightweight system), designed to protect data on resource-constrained devices. The encryption algorithm is implemented in the C++ programming language. The paper presents the statistical properties of ciphertexts obtained using the developed algorithm. For the experimental testing for statistical security, the sets of statistical tests by NIST and D. Knuth were used. Separately, the ISL-LWS algorithm was tested for avalanche effect properties. The obtained results of statistical tests were compared with the Present and Speck modern lightweight algorithms. The study and comparative analysis of the speed of encryption and key generation of the three algorithms were carried out on the Arduino Uno R3 board.

show abstract

Section: ) Nist Statistical Testsmentioning

confidence: 99%

Development of a New Lightweight Encryption Algorithm

Khompysh,

Kapalova,

Lizunov

et al. 2023

IJACSA

View full text Add to dashboard Cite

show abstract

“…In [12], EDS module algorithms for block data encryption (based on exponentiation transform) were considered, as well as in [13], the development using NPNS was considered. In [12,13], only software implementations of encryption and its testing with various test data are presented. As known, cryptosystems based on NPNS can be implemented in software, hardware-software and hardware.…”

Section: Literature Review and Problem Statementmentioning

confidence: 99%

Development of pipelined polynomial multiplier modulo irreducible polynomials for cryptosystems

Tynymbayev

Ibraimov

Namazbayev

et al. 2022

EEJET

View full text Add to dashboard Cite

In this paper, we consider a schematic solution of the pipeline multiplier modulo, where multiplication begins with the analysis of the lowest order of the polynomial multiplier, which can serve as an operating unit for high-speed encryption and decryption of data by hardware implementation of cryptosystems based on a non-positional polynomial notation. The functional diagram of the pipeline and the structure of its logical blocks, as well as an example of performing the operation of multiplying polynomials modulo, are given. The correct functioning of the developed circuit was checked by modeling in the Vivado Design Suite computer-aided design for the implementation of the multiplication device on the development/evaluation kit Artix-7 based on the Spartan 6 field-programmable gate array series by Xilinx. The effectiveness of the proposed hardware pipeline multiplier in modulo is confirmed by the Verilog Testbench timing diagram implemented for the evaluation kit Artix-7 field-programmable gate array. In addition, the developed pipelined modulo multiplier takes no more than 0.02 % of the resources of the used field-programmable gate array for a given length of input data. Compared to the matrix multiplication method, a pipelined modulo multiplier can handle a large data stream without waiting for the result of the previous multiplication step. The modulo pipelined multiplier depth depends on the bit width of the input data. The developed pipeline device can be used in digital computing devices operating in a polynomial system of residue classes, as well as for high-speed data encryption in blocks of cipher processors operating on the basis of a non-positional polynomial number system.

show abstract

“…Найбільш відомими та більш криптостійкими алгоритмами симетричних шифрів є: AES (Advanced Encryption Standard) та DES (Data Encryption Standard) -стандарти шифрування США [2]; IDEA (International Data Encryption Algorithm) -інтернаціональний; SEAL (Software Efficient Algorithm) -ефективний програмний; WAKE (World Auto Key Algorithm) -всесвітній алгоритм шифрування на автоматичному ключі [3]; ГОСТ 28147-89 -російський стандарт [4].…”

Section: аналіз наукових публікаційunclassified

Комбінований Метод Шифрування Даних З Ідентифікацією Їхнього Відправника

Волошко¹,

Лутчин²

2021

РЗОД

View full text Add to dashboard Cite

На основі аналізу узагальнених моделей інформаційних потоків на основі часово-просторових властивостей вейвлет-коефіцієнтів за рівнями вейвлет-декомпозиції запропоновано узагальнений метод шифрування даних із можливістю ідентифікації відправника повідомлення. Закритий ключ шифрування — пароль, що складається із чотирьох складових, його довжина — 324 біта. Розшифрування потребує орієнтовно 1012 операцій та обов’язкового знання вибраного вейвлет-базису над модифікованими даними (вейвлет-коефіцієнтами інформаційних даних із закодованим ключем). До зашифрованого повідомлення застосовується зворотне вейвлет-перетворення, коефіцієнти якого і будуть передаватися лініями зв’язку у вигляді відкритого ключа. Несанкціонований вплив на дані, які передаються, повністю виключається завдяки часово-просторовим і спектральним властивостям вейвлет-коефі-цієнтів за рівнями вейвлет-декомпозиції. Відносна похибка оберненого вейвлет-перетворення знаходиться в межах від 4·10–14 до 6·10–14.

show abstract

A block encryption algorithm based on exponentiation transform

Cited by 7 publications

References 10 publications

Development of a New Lightweight Encryption Algorithm

Development of a New Lightweight Encryption Algorithm

Development of pipelined polynomial multiplier modulo irreducible polynomials for cryptosystems

Комбінований Метод Шифрування Даних З Ідентифікацією Їхнього Відправника

Contact Info

Product

Resources

About