scholarly journals Bright - Proposed Family of Lightweight Block Ciphers for IoT-Enabled Smart Environment

Lightweight security algorithms are tailored for resource-constrained environment. To improve the efficiency of an algorithm, usually, a tradeoff is involved in lightweight cryptography in terms of its memory requirements and speed. This paper proposes a software-oriented new family of lightweight block ciphers, BRIGHT. Proposed family of ciphers support a range of block and key sizes for constraint environment. BRIGHT family has 6 variants and all variants fulfill Strict Avalanche Criteria and key sensitivity test. It is believed that BRIGHT family of ciphers provides better security and performance in IoT-enabled smart environment. Our aim, while designing BRIGHT is to enhance the cipher for IoT applications. For this, we have used the concept of key whitening that helps to resist against attacks like MITM and brute-force. Round permutation in BRIGHT results in stronger and faster diffusion and provides resistance against linear, differential, impossible differential, related-key rectangle, biclique, MITM, and statistical saturation attack which is likely to be applied to GFN based ciphers. BRIGHT using round constant thwarts attacks like rotational cryptanalysis, self-similarity, invariant attack, related-key attacks, and weak key attacks.

Cryptanalysis is a very important challenge that faces cryptographers. It has several types that should be well studied by cryptographers to be able to design cryptosystem more secure and able to resist any type of attacks. This paper introduces six types of attacks: Linear, Differential , Linear-Differential, Truncated differential Impossible differential attack and Algebraic attacks. In this paper, algebraic attack is used to formulate the substitution box(S-box) of a block cipher to system of nonlinear equations and solve this system by using a classical method called Grobner  Bases . By Solving these equations, we made algebraic attack on S-box.


2018 ◽  
Vol 9 (5) ◽  
pp. 593-602 ◽  
Author(s):  
Yujin An ◽  
Jiyeon Oh ◽  
Shanshan Chen ◽  
Byongkyu Lee ◽  
Sang Myeon Lee ◽  
...  

A new family of NDI-based random terpolymers, incorporating a small amount (10%) of different chalcogenophene units (-Fu, -Th, -Se) was synthesized and investigated for all-PSCs.


2021 ◽  
pp. 120-125
Author(s):  
Ya. Yu. Chernikov

The article considers the current trends in the development of the food industry and the direction of food technology, which are based on the integration of digital technologies within the entire food chain: from farms and food production to packaging, storage, preparation and disposal of food. The purpose of this scientific paper is to study global trends, the growth rate of investments in this area and the prospects for the future. The author considers in more detail the Russian market for the delivery of ready-made rations, which is now gaining more and more popularity. The main drivers of the market are: new family values, health and nutrition standards, information technologies and the birth of new types of consumers. Only two serious competitors are currently represented in the Russian market: GrowFood and Performance Group, each with a market share of about 40 %. In the near future, a complete monopolization of the Russian market is possible, and this, of course, is a negative factor for consumers. The research area is in the early stages of the life cycle, and requires more attention and protection from institutional authorities.


Author(s):  
Sébastien Duval ◽  
Gaëtan Leurent

MDS matrices are an important element for the design of block ciphers such as the AES. In recent years, there has been a lot of work on the construction of MDS matrices with a low implementation cost, in the context of lightweight cryptography. Most of the previous efforts focused on local optimization, constructing MDS matrices with coefficients that can be efficiently computed. In particular, this led to a matrix with a direct xor count of only 106, while a direct implementation of the MixColumn matrix of the AES requires 152 bitwise xors. More recently, techniques based on global optimization have been introduced, where the implementation can reuse some intermediate variables. In particular, Kranz et al. used optimization tools to find a good implementation from the description of an MDS matrix. They have lowered the cost of implementing the MixColumn matrix to 97 bitwise xors, and proposed a new matrix with only 72 bitwise xors, the lowest cost known so far. In this work we propose a different approach to global optimization. Instead of looking for an optimized circuit of a given matrix, we run a search through a space of circuits, to find optimal circuits yielding MDS matrices. This results in MDS matrices with an even lower cost, with only 67 bitwise xors.


Author(s):  
Jihoon Cho ◽  
Kyu Young Choi ◽  
Itai Dinur ◽  
Orr Dunkelman ◽  
Nathan Keller ◽  
...  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document