scholarly journals Modification of the algorithm based on the Feistel network by adding an element of randomness into the encryption key

2021 ◽  
pp. 81-88
Author(s):  
Pavel Chernov ◽  
◽  
Aleksander Shkaraputa ◽  
Keyword(s):  
Building Block ◽  
Execution Time ◽  
Block Ciphers ◽  
Time Increase ◽  
Encrypted Data ◽  
Hamming Codes ◽  
Advantages And Disadvantages ◽  
Modified Algorithm

The article revealed the research of methods for constructing block ciphers and its advantages and disadvantages. The modified algorithm based on the Feistel network using Hamming codes and adding an element of randomness into the encryption key was proposed. Analysis of the main arameters of the algorithm in comparison with Feistel network was performed: resistance to cryptanalysis, execution time, increase in the volume of encrypted data. The analysis revealed the stronger resistance to cryptanalysis than the Feistel network, increased execution time and volume of encrypted data. The potential for building block ciphers based on the algorithm was explored.

scholarly journals Cloud Data Integrity Verification Algorithm for Sustainable Accounting Informatization

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Lin Yang
Keyword(s):  
Big Data ◽  
Execution Time ◽  
Cloud Storage ◽  
Computing Time ◽  
Data Integrity ◽  
Cloud Data ◽  
Integrity Verification ◽  
Verification Algorithm ◽  
Advantages And Disadvantages ◽  
Better Than

In recent years, people have paid more and more attention to cloud data. However, because users do not have absolute control over the data stored on the cloud server, it is necessary for the cloud storage server to provide evidence that the data are completely saved to maintain their control over the data. Give users all management rights, users can independently install operating systems and applications and can choose self-service platforms and various remote management tools to manage and control the host according to personal habits. This paper mainly introduces the cloud data integrity verification algorithm of sustainable computing accounting informatization and studies the advantages and disadvantages of the existing data integrity proof mechanism and the new requirements under the cloud storage environment. In this paper, an LBT-based big data integrity proof mechanism is proposed, which introduces a multibranch path tree as the data structure used in the data integrity proof mechanism and proposes a multibranch path structure with rank and data integrity detection algorithm. In this paper, the proposed data integrity verification algorithm and two other integrity verification algorithms are used for simulation experiments. The experimental results show that the proposed scheme is about 10% better than scheme 1 and about 5% better than scheme 2 in computing time of 500 data blocks; in the change of operation data block time, the execution time of scheme 1 and scheme 2 increases with the increase of data blocks. The execution time of the proposed scheme remains unchanged, and the computational cost of the proposed scheme is also better than that of scheme 1 and scheme 2. The scheme in this paper not only can verify the integrity of cloud storage data but also has certain verification advantages, which has a certain significance in the application of big data integrity verification.

scholarly journals A COMPARISON OF CREATING AN ANDROID APPLICATION USER INTERFACE IN XAML AND IN C# CODE

2021 ◽  
Vol 2 ◽  
pp. 52-62
Author(s):  
Igor Košťál ◽  
Martin Mišút
Keyword(s):  
User Interface ◽  
User Interfaces ◽  
Execution Time ◽  
Android Application ◽  
Development Environment ◽  
Source Codes ◽  
Advantages And Disadvantages ◽  
C Programming Language ◽  
C Programming ◽  
Android Applications

Almost every Android user application has some kind of user interface. Android programmers who create Xamarin.Forms applications and who uses the Microsoft Visual Studio development environment to do so can create user interfaces in the XAML (the Extensible Application Markup Language) or in the C# programming language. This paper deals with a comparison of creating this user interface by the first and the second way. We demonstrate the differences in the creation of Android application user interfaces in XAML and in C# by way of using two of our Android applications which were created by the Microsoft Visual Studio 2019 Enterprise, which work as text editors with the ability to store text to disc, and have user interfaces that are visually identical. However, the user interface of the first Android application was created in XAML with a C# support code, whereas the user interface of the second Android application was created entirely in C#. While comparing the source codes of the user interfaces of both these Android applications, we identify the advantages and disadvantages of both approaches to creating a user interface and we try to find out which of these approaches is better for maintaining and modifying user interfaces. In this study, we also contrast the processes of handling events of controls of a user interface created in the XAML code for the first Android application as well as that of the same user interface created in the C# code for the second Android application. Furthermore, we were interested in determining whether the different ways of creating user interfaces affected the execution time of basic operations that included disc files that were performed on the same data by both the applications. We assume that it does not fundamentally affect the execution time, and so, we performed an experiment to confirm or refute our assumption.

scholarly journals Exploring Direct Convolution Performance on the Gemmini Accelerator

2020 ◽  
Author(s):  
Caio Vieira ◽  
Arthur Lorenzon ◽  
Lucas Schnorr ◽  
Philippe Navaux ◽  
Antonio Carlos Beck
Keyword(s):  
Neural Network ◽  
Computer Vision ◽  
Energy Consumption ◽  
Convolutional Neural Network ◽  
Building Block ◽  
Execution Time ◽  
Performance Gap ◽  
Main Building ◽  
Time And Energy ◽  
Lower Frequencies

Convolutional Neural Network (CNN) algorithms are becoming a recurrent solution to solve Computer Vision related problems. These networks employ convolutions as main building block, which greatly impact their performance since convolution is a costly operation. Due to its importance in CNN algorithms, this work evaluates convolution performance in the Gemmini accelerator and compare it to a conventional lightlyand heavily-loaded desktop CPU in terms of execution time and energy consumption. We show that Gemmini can achieve lower execution time and energy consumption when compared to a CPU even for small convolutions, and this performance gap grows with convolution size. Furthermore, we analyze the minimum Gemmini required frequency to match the same CPU execution time, and show that Gemmini can achieve the same runtime while working in much lower frequencies.

The Algebra Properties of the S-Boxes of Several Block Ciphers

2012 ◽  
Vol 546-547 ◽  
pp. 617-621
Author(s):  
Jia Liu ◽  
Yu Li Shen
Keyword(s):  
Boolean Function ◽  
Detailed Analysis ◽  
Block Ciphers ◽  
Algebraic Degree ◽  
Advantages And Disadvantages ◽  
Algebraic Properties ◽  
Cryptographic Security ◽  
Made In

S-boxes bring nonlinearity to block ciphers and strengthen their cryptographic security. A detailed analysis of the cryptographic properties of S-boxes of several block ciphers, such as SMS4, AES, Camellia and SEED, are made in this paper. Some algebraic properties of boolean function of S-boxes such as balanceness, non-linearity, algebraic degree and walsh spectrums are well investigated. We reveal the advantages and disadvantages of those S-boxes used in SMS4, AES, Camellia and SEED as compared with each other.

scholarly journals Covariant Genetic Dynamics

2007 ◽  
Vol 15 (3) ◽  
pp. 291-320 ◽  
Author(s):  
Chryssomalis Chryssomalakos ◽  
Christopher R. Stephens
Keyword(s):  
Coordinate Transformation ◽  
Building Block ◽  
Mathematical Object ◽  
Building Blocks ◽  
Dynamical Equations ◽  
Block Basis ◽  
Object A ◽  
Fine Grained ◽  
Transformation Matrices ◽  
Advantages And Disadvantages

We present a covariant form for the dynamics of a canonical GA of arbitrary cardinality, showing how each genetic operator can be uniquely represented by a mathematical object — a tensor — that transforms simply under a general linear coordinate transformation. For mutation and recombination these tensors can be written as tensor products of the analogous tensors for one-bit strings thus giving a greatly simplified formulation of the dynamics. We analyze the three most well known coordinate systems — string, Walsh and Building Block — discussing their relative advantages and disadvantages with respect to the different operators, showing how one may transform from one to the other, and that the associated coordinate transformation matrices can be written as a tensor product of the corresponding one-bit matrices. We also show that in the Building Block basis the dynamical equations for all Building Blocks can be generated from the equation for the most fine-grained block (string) by a certain projection (“zapping”).

scholarly journals Noise Management in Homomorphic Encryption Scheme: Analyzing of Algorithm

2021 ◽  
Vol 9 (4) ◽  
pp. 100-111
Author(s):  
Paulin Boale Bomolo ◽  
Eugene Mbuyi Mukendi ◽  
Simon Ntumba Badibagna
Keyword(s):  
Execution Time ◽  
Management Strategy ◽  
Homomorphic Encryption ◽  
Resource Consumption ◽  
New Method ◽  
Encryption Scheme ◽  
Encrypted Data ◽  
Bounded Functions ◽  
Noise Management

Homomorphic encryption is the Swiss army of cryptography. It allows to perform computations on encrypted data. this conjecture of processing on encrypted data was stated by [RAD78]. Until Gentry breakthrough in 2009, only partial solutions were offered. They deal with encrypted data with bounded functions in operations.Gentry raised the bound of number of operations by introducing a new method called the bootstrapping. This method allows to reduce the noise in the ciphertext and to perform more computing on it. Since Gentry's breakthrough, several improvements and several alternatives to the bootstrapping technique have been proposed to improve execution time and reduce resource consumption.  This article studies the growth of noise and the noise management strategy in homomorphic encryption. It also presents the trend of hoping strategy from 2009 to 2016. Through the DGHV, it shows the management of noise on a one-bit encrypted message. 

scholarly journals New primitives of controlled elements F2/4 for block ciphers

2020 ◽  
Vol 10 (5) ◽  
pp. 5470
Author(s):  
Minh Nguyen Hieu ◽  
Duy Ho Ngoc ◽  
Canh Hoang Ngoc ◽  
Trung Dinh Phuong ◽  
Manh Tran Cong
Keyword(s):  
Building Block ◽  
Hardware Implementation ◽  
Block Cipher ◽  
Block Ciphers ◽  
Differential Analysis ◽  
New Class ◽  
Use Of Data ◽  
Hardware Implementations ◽  
Bit Vector ◽  
Elementary Building

This paper develops the cipher design approach based on the use of data-dependent operations (DDOs). A new class of DDO based on the advanced controlled elements (CEs) is introduced, which is proven well suited to hardware implementations for FPGA devices. To increase the hardware implementation efficiency of block ciphers, while using contemporary FPGA devices there is proposed an approach to synthesis of fast block ciphers, which uses the substitution-permutation network constructed on the basis of the controlled elements F2/4 implementing the 2 x 2 substitutions under control of the four-bit vector. There are proposed criteria for selecting elements F2/4 and results on investigating their main cryptographic properties. It is designed a new fast 128-bit block cipher MM-128 that uses the elements F2/4 as elementary building block. The cipher possesses higher performance and requires less hardware resources for its implementation on the bases of FPGA devices than the known block ciphers. There are presented result on differential analysis of the cipher MM-128

The distinguishing attack on ARX-based lightweight block ciphers

2019 ◽  
Author(s):  
А.С. Сосков ◽  
Б.Я. Рябко
Keyword(s):  
Block Size ◽  
Block Ciphers ◽  
Statistical Test ◽  
Encrypted Data ◽  
Plain Text ◽  
Distinguishing Attack ◽  
Cipher Text ◽  
Round Function ◽  
Low Degree ◽  
Symmetric Key

Рассмотрено применение атаки различения на ряд легковесных блочных шифров, основанных на ARX-операциях (сложение по модулю, циклический сдвиг и исключающее ИЛИ). Представлены экспериментальные результаты и теоретические оценки устойчивости легковесных шифров Speck, Simon, Simeck, HIGHT, LEA к атаке различения. Вывод, что семейство шифров Simeck не выдерживает эту атаку, сделан на основе прогнозов, полученных путем экстраполяции экспериментальных данных. The distinguishing attack on modern lightweight ARX-based block ciphers was applied. Distinguishing attack is any form of cryptanalysis on data encrypted by a cipher that allows an attacker distinguishing the encrypted data from random data. Purpose. Modern symmetric-key ciphers must be designed to be immune to such an attack. The purpose of the work was to estimate the resistance of lightweight ciphers Speck, Simon, Simeck, HIGHT, and LEA to a distinguishing attack. Methodology. We note that these ciphers are iterated block ciphers. It is means that they transform blocks of plain text into blocks of cipher text by using the cyclically repeated invertible function known as the round function where each iteration is to be referred as a round. We have experimentally found a maximum number of rounds where encrypted data looked like random bit-sequence by using statistical test “Book Stack”. Then we extrapolated the theoretical length required for a successful distinguishing attack on cipher with full-number rounds by a polynomial of a low degree. Note that cryptography attack is considered as successful if the length of the encrypted sequence is less than the length 2K (K — key size). Originality/value. Our experiments and estimations show, that Simeck with 48bit block size and 96-bit key size is not immune to distinguishing attack. We recommended increasing the number of rounds by 15–20% in order to improve the reliability of the Simeck 48/96.

scholarly journals Fast implementations of ARX-based lightweight block ciphers (SPARX, CHAM) on 32-bit processor

2019 ◽  
Vol 15 (9) ◽  
pp. 155014771987418 ◽  
Author(s):  
Byoungjin Seok ◽  
Changhoon Lee
Keyword(s):  
Execution Time ◽  
Block Cipher ◽  
Block Ciphers ◽  
Memory Usage ◽  
Resource Constrained ◽  
Word Size ◽  
Key Schedule ◽  
Round Function ◽  
Fast Implementation ◽  
Implementation Method

Recently, many lightweight block ciphers are proposed, such as PRESENT, SIMON, SPECK, Simeck, SPARX, GIFT, and CHAM. Most of these ciphers are designed with Addition–Rotation–Xor (ARX)-based structure for the resource-constrained environment because ARX operations can be implemented efficiently, especially in software. However, if the word size of a block cipher is smaller than the register size of the target device, it may process inefficiently in the aspect of memory usage. In this article, we present a fast implementation method for ARX-based block ciphers, named two-way operation. Moreover, also we applied SPARX-64/128 and CHAM-64/128 and estimated the performance in terms of execution time (cycles per byte) on a 32-bit Advanced RISC Machines processor. As a result, we achieved a large amount of improvement in execution time. The cycles of round function and key schedule are reduced by 53.31% and 31.51% for SPARX-64/128 and 41.22% and 19.40% for CHAM-64/128.

scholarly journals Alternative N-bit Key Data Encryption for Block Ciphers

2019 ◽  
Author(s):  
Kayque Damasceno ◽  
Carlos Cruz ◽  
Anderson De Oliveira ◽  
Luís De Castro
Keyword(s):  
Block Ciphers ◽  
Data Encryption ◽  
Short Length ◽  
Experimental Results ◽  
Alternative Technique ◽  
Advantages And Disadvantages ◽  
Asymmetric Cryptography ◽  
Code Based Cryptography ◽  
Block Chaining

Post-encryption patterns are cribs that can be used by adversaries to unlock the encryption key both in symmetric or asymmetric cryptography, compromising security. Different methods to mitigate the problem, with their advantages and disadvantages, can be found in the literature, including one-time pad encryption, code-based cryptography and cipher block chaining. This work presents an alternative technique to generate an n-bit, n-block and key cipher that can be derived from reasonable short length key. The proposed technique is able to mitigate post-encryption patterns. Experimental results asserting the capabilities of the proposed cipher techniques are presented and discussed in the text.

Sign in / Sign up

Export Citation Format

Share Document