symmetric cryptography
Recently Published Documents


TOTAL DOCUMENTS

137
(FIVE YEARS 51)

H-INDEX

10
(FIVE YEARS 2)

2021 ◽  
Vol 12 (2) ◽  
pp. 447-455
Author(s):  
Samsul Arifin ◽  
Indra Bayu Muktyas ◽  
Puguh Wahyu Prasetyo ◽  
Abdul Azis Abdillah

One of the encryption algorithms is the Hill Cipher. The square key matrix in the Hill Cipher method must have an inverse modulo. The unimodular matrix is one of the few matrices that must have an inverse. A unimodular matrix can be utilized as a key in the encryption process. This research aims to demonstrate that there is another approach to protect text message data. Symmetric cryptography is the sort of encryption utilized. A Bernoulli Map is used to create a unimodular matrix. To begin, the researchers use an identity matrix to generate a unimodular matrix. The Bernoulli Map series of real values in (0,1) is translated to integers between 0 and 255. The numbers are then inserted into the unimodular matrix's top triangular entries. To acquire the full matrix as the key, the researchers utilize Elementary Row Operations. The data is then encrypted using modulo matrix multiplication.


Radiotekhnika ◽  
2021 ◽  
pp. 53-63
Author(s):  
A.A. Kuznetsov ◽  
N.A. Poluyanenko ◽  
V.A. Katrich ◽  
S.O. Kandii ◽  
Yu.A. Zaichenko

Nonlinear substitutions (S-boxes) are used in most modern symmetric cryptoalgorithms. They are designed to mix input data and play a significant role in ensuring resistance against known cryptanalytic attacks (differential, linear, algebraic and other cryptanalysis methods). However, random generation of nonlinear substitutions with the desired indicators is an extremely difficult mathematical problem. This article explores the heuristic techniques for S-boxes informed search, in particular, discusses various cost functions used in most of the known algorithms (for example, local search, hill climbing, simulated annealing, genetic search, etc.). The aim of the study is to determine the specific parameters of heuristic functions, which, on the one hand, do not reduce the degree of awareness of the search nodes, and on the other hand, do not require significant computational costs. The article examines the influence of individual parameters on the value of the cost function and complexity of its calculation. It also provides specific recommendations for the formation of parameters for heuristic search for S-boxes, which significantly affect the efficiency of generating nonlinear substitutions for symmetric cryptography.


2021 ◽  
Vol 31 (10) ◽  
pp. 2150146
Author(s):  
Yuanyuan Si ◽  
Hongjun Liu ◽  
Yuehui Chen

As the only nonlinear component for symmetric cryptography, S-Box plays an important role. An S-Box may be vulnerable because of the existence of fixed point, reverse fixed point or short iteration cycles. To construct a keyed strong S-Box, first, a 2D enhanced quadratic map (EQM) was constructed, and its dynamic behaviors were analyzed through phase diagram, Lyapunov exponent, Kolmogorov entropy, bifurcation diagram and randomness testing. The results demonstrated that the state points of EQM have uniform distribution, ergodicity and better randomness. Then a keyed strong S-Box construction algorithm was designed based on EQM, and the fixed point, reverse fixed point, and short cycles were eliminated. Experimental results verified the algorithm’s feasibility and effectiveness.


2021 ◽  
Vol 18 (4) ◽  
Author(s):  
Riccardo Aragona ◽  
Roberto Civino

AbstractIn symmetric cryptography, the round functions used as building blocks for iterated block ciphers are obtained as the composition of different layers acting as a sequence of bijective transformations providing global increasing complexity. The study of the conditions on such layers which make the group generated by the round functions of a block cipher a primitive group has been addressed in the past years, both in the case of Substitution Permutation Networks and Feistel Networks, giving to block cipher designers the recipe to avoid the imprimitivity attack, which exploits the invariance of some subspaces during the encryption. In the case of Lai–Massey schemes, where both Substitution Permutation Network and Feistel Network features are combined, the resistance against imprimitivity attacks has been a long-standing open problem. In this paper we consider a generalization of such a scheme and we prove its resistance against the imprimitivity attack. Our solution is obtained as a consequence of a more general result in which the problem of proving the primitivity of a generalized Lai–Massey scheme is reduced to the simpler one of proving the primitivity of the group generated by the round functions of a strictly related Substitution Permutation Network. We prove how this implies a reduction in the computational cost of invariant-subspace search.


Author(s):  
Olivier Seller

The LoRaWAN security design adheres to state-of-the-art principles: use of standard, well-vetted algorithms, and end-to-end security. The fundamental properties supported in LoRaWAN security are mutual end-point authentication, data origin authentication, integrity and replay protection, and confidentiality. The use of symmetric cryptography and prior secret key sharing between a device and a server enables an extremely power efficient and network efficient activation procedure.


2021 ◽  
Vol 3 (3) ◽  
pp. 57-62
Author(s):  
Fausto Abraham Jacques García ◽  
Sandra Luz Canchola Magdaleno ◽  
Gloria Nelida Avecilla Ramírez

El presente artículo describe la enseñanza de las matrices inversas modulares usando el algoritmo de criptografía simétrica Hill Cipher y su implementación en dispositivos móviles con Sistema operativo Android. El proceso de descifrado en el algoritmo Hill Cipher involucra el cálculo de matrices inversas modulares. El objetivo de este trabajo es la enseñanza del cálculo necesario para la obtención de matrices inversas modulares a estudiantes de licenciatura en las áreas de las ciencias computacionales a través del proceso de descifrado en la criptografía simétrica. Se realizó un experimento con dos grupos de estudiantes, el grupo experimental y el grupo de control. Se aplicó una prueba en ambos grupos para determinar el aprendizaje de los estudiantes. Un análisis comparativo entre ambos grupos muestra un incremento en el desempeño del grupo experimental en el cálculo de las matrices inversas modulares. This article describes the teaching of modular inverse matrices with the symmetric cryptographic algorithm Hill Cipher and its implementation on mobile devices with Android Operative System. The decryption in the Hill Cipher algorithm involves the calculus of modular inverse matrices. The goal of this paper is the teaching of modular inverse matrix calculation to undergraduate students of Computer Sciences through the decryption in symmetric cryptography. An experiment was conducted on two groups of students, the control and the experimental groups. To measure student learning, a test was applied to both groups. Comparison of control and experimental groups results show an increase in student performance for the calculation of modular inverse matrices.  


Author(s):  
Itai Dinur ◽  
Steven Goldfeder ◽  
Tzipora Halevi ◽  
Yuval Ishai ◽  
Mahimna Kelkar ◽  
...  

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 118624-118639
Author(s):  
Chia-Hung Lin ◽  
Jian-Xing Wu ◽  
Pi-Yun Chen ◽  
Hsiang-Yueh Lai ◽  
Chien-Ming Li ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document