Key Schedule Research Articles

Quantum rebound attacks on reduced‐round ARIA‐based hash functions

AbstractARIA is a block cipher proposed by Kwon et al. at ICISC 2003 that is widely used as the national standard block cipher in the Republic of Korea. Herein, we identify some flaws in the quantum rebound attack on seven‐round ARIA‐DM proposed by Dou et al. and reveal that the limit of this attack is up to five rounds. Our revised attack applies to not only ARIA‐DM but also ARIA‐MMO and ARIA‐MP among the PGV models, and it is valid for all ARIA key lengths. Furthermore, we present dedicated quantum rebound attacks on seven‐round ARIA‐Hirose and ARIA‐MJH for the first time. These attacks are only valid for the 256‐bit key length of ARIA because they are constructed using the degrees of freedom in the key schedule. All our attacks are faster than the generic quantum attack in the cost metric of the time–space tradeoff.

IMPLEMENTATION FPGA BASED IMPLEMENTATION OF 128-BIT AES ALGORITHM USING VHDL

In current world of computations, data encryption is of prominent importance. Many algorithms were developed for data encryption and decryption to prevent hacking. The Advanced Encryption Standard (AES) is one of the data encryption techniques. Two famous kinds of hardware implementation techniques are pipelining and loop-unrolling techniques. In pipelining, registers are inserted between each combinational processing element so that each input data block can be processed simultaneously in each processing element. In this work, a pipelined implementation of AES encryption algorithm is developed. The number of rounds of AES-128 encryption is 10 and an architecture implementing this cipher is called fully pipelined, when all data blocks of 10 rounds can be processed simultaneously. In the loop-unrolling technique one or multiple rounds of the algorithm are processed in the same clock cycle. Here only one round of the algorithm is implemented as a combinational processing element and a data register is also used to store the result obtained in the previous clock cycle. In this work, a128-bit AES is implemented and for each round of AES encryption, a different sub-key is used as the round key, which is produced by the key schedule algorithm based on the loop-unrolled technique, to produce the required sub-key for each round is done. The no of I/O, Slices in the proposed work are 386, 229 respectively with Spartan6 fpga with a minimum period of 5.813ns,maximum Frequency of 172.031MHz, minimum input arrival time before clock of 4.823ns,maximum output required time after clock of 5.588ns, throughput of 2.2Gbps. The no of I/O, Slices are 387, 264 respectively with Artix7 fpga with a minimum period of 3.397ns, maximum Frequency of 294.366MHz, minimum input arrival time before clock of 1.649ns, maximum output required time after clock of 1.669ns, throughput of 3.77Gbps.

AI business models and its impact on business strategic framework

Recently, a lot of research was done on how to evolve the artificial intelligence business model framework. However, one issue was still undeveloped, which was immature to understand. This has been vital for budding and progressive managers, policy decision makers, and academics alike, namely, how businesses transform and develop their AI business models framework to accomplish continuous value formation. Businesses, which achieve to make value over prolonged stages of time effectively, figure, acclimate and recommence their business models with AI technology to fuel such value formation. Sketch on verdicts from a research program on uninterruptedly budding businesses is given. This paper categorizes three perilous competences, namely, an alignment towards investigating with and manipulating innovative business openings, a well-adjusted use of properties, as well as attaining lucidity between management, ethos, and member of staff obligations, together they all decisive key maneuvering schedules. We conclude the paper by signifying the consequences for AI business model framework research and experts and by providing a tool for executives which permits them to reproduce and classify perilous problems relevant for shifting and emerging their business model to sustain value creation. In this paper, we try to explore the keys of Business Model Framework, which will revolutionize business market ecosystem.

Encryption Methods and Algorithms Based on Domestic Standards in Open-Source Operating Systems

The paper describes the principles and methods underlying the creation of an application in secure operating systems, which provides reliable data encryption. The research aims to analyze and indicate the specifics of encryption methods and algorithms based on domestic standards in open-source operating systems. Cryptanalysis was used in the article, as this avoids vulnerabilities identified in previously created implementations. In the article, the authors draw attention to the fact that 7-Zip uses CBC encryption (concatenation of encrypted text blocks), but the Counter Mode is supported. The same support was provided in the encrypt implementation. Since the key expansion function initially fills the special array created by p7zip with round keys using a unique property of the domestic standard, only one round encryption function was created (performed both during encryption and decryption). This method is also used in various modes. In many cases, initialization time deviations depending on the selected mode are insignificant. The created cryptographic module was tested to meet the domestic standard, which contains several test cases. It was confirmed during the tests that the created module implements the algorithm of the domestic standard. The article shows a way to implement a fairly convenient graphical interface for accessing the cryptographic module, which enables the user not to call the command line and remember the sequence and types of parameters passed to p7zip. This implementation also takes into account the verification of the correctness of decryption and the reading of other error codes.

On the Security of Qalqan Cipher Against Differential Cryptanalysis


 
 
 In 2021, the first version of block cipher Qalqan was presented. It is positioned as a candidate to the future national encryption standard of the Republic of Kazakhstan. This cipher features the usage of addition by different modules for mixing the round keys and for linear layer. In this work, we consider some cryptographic properties of Qalqan, related with the security against differential and linear cryptanalysis. We present variations of cipher’s S-box with better cryptographic properties. We prove that branch number of Qalqan’s linear layer is equal to 3, and the layer itself has a significant amount of fixed points. Also, we build a set of multi-round differential characteristics with high probabilities for the modified version of the Qalqan cipher, which uses only addition modulo 256. With these results, we can argue that the declared security of Qalqan against differential and linear cryptanalysis should be reconsidered.
 
 

The Implementation of Improved Advanced Encryption Standard and Least Significant Bit for Securing Messages in Images

Security and confidentiality are essential aspects needed in the process of exchanging messages. Maintaining the message's security and confidentiality can be done by encrypting the message with cryptographic techniques to protect the message. However, the encrypted message (ciphertext) usually raises suspicion from eavesdroppers so that they try to unravel the contents of the message or damage the contents of the message or prevent the message from reaching the intended recipient. To avoid eavesdroppers' suspicion of encrypted messages, after encryption, the ciphertext can then be inserted into an image using steganography techniques so that eavesdroppers do not know whether there is a secret message in an image. In this research, the authors use the Improved AES-128 (Advanced Encryption Standard) Algorithm to encrypt messages and LSB (Least Significant Bit) Algorithm to insert ciphertext into an image. Where the AES Algorithm Improvement is made by adding a sending and receiving applications ID to modify the Key Schedule process, with modifications to the Key Schedule process, messages can only be read on the original recipient's cellphone by entering the correct key. The results of this study show that eavesdroppers do not easily know the existence of the ciphertext, besides that even if the eavesdroppers get the ciphertext and know the encryption key, the message remains unreadable on their cellphone because the ID of the application sending or receiving the message has changed.

A hybrid modified lightweight algorithm for achieving data integrity and confidentiality

<span lang="EN-US">Encryption algorithms aim to make data secure enough to be decrypted by an attacker. This paper combines the Speck and the Salsa20 to make it difficult for an attacker to exploit any weaknesses in these two algorithms and create a new lightweight hybrid algorithm called Speck-Salsa20 algorithm for data integrity and confidentiality (SSDIC). SSDIC uses less energy and has an efficient throughput. It works well in both hardware and software and can handle a variety of explicit plaintext and key sizes. SSDIC solves the difficulties of the Speck algorithm. The sequence generated by Speck is not random and fails to meet an acceptable success rate when tested in statistical tests. It is processed by generating a random key using the Salsa20 algorithm. Salsa20 is a high-speed secure algorithm that is faster than advanced encryption standard (AES) and can be used on devices with low resources. It uses a 256-bit key hash function. The recovery of the right half of the original key of the Speck algorithm is also handled by modifying the Speck round function and the key schedule. Simulation results show, according to a National Institute of Standards and Technology (NIST) test, the performance achieved by the SSDIC is increased by nearly 66% more than that achieved from the Speck in terms of data integrity and confidentiality.</span>

RBFK cipher: a randomized butterfly architecture-based lightweight block cipher for IoT devices in the edge computing environment

Internet security has become a major concern with the growing use of the Internet of Things (IoT) and edge computing technologies. Even though data processing is handled by the edge server, sensitive data is generated and stored by the IoT devices, which are subject to attack. Since most IoT devices have limited resources, standard security algorithms such as AES, DES, and RSA hamper their ability to run properly. In this paper, a lightweight symmetric key cipher termed randomized butterfly architecture of fast Fourier transform for key (RBFK) cipher is proposed for resource-constrained IoT devices in the edge computing environment. The butterfly architecture is used in the key scheduling system to produce strong round keys for five rounds of the encryption method. The RBFK cipher has two key sizes: 64 and 128 bits, with a block size of 64 bits. The RBFK ciphers have a larger avalanche effect due to the butterfly architecture ensuring strong security. The proposed cipher satisfies the Shannon characteristics of confusion and diffusion. The memory usage and execution cycle of the RBFK cipher are assessed using the fair evaluation of the lightweight cryptographic systems (FELICS) tool. The proposed ciphers were also implemented using MATLAB 2021a to test key sensitivity by analyzing the histogram, correlation graph, and entropy of encrypted and decrypted images. Since the RBFK ciphers with minimal computational complexity provide better security than recently proposed competing ciphers, these are suitable for IoT devices in an edge computing environment.

Uncertainty Analysis of Key Schedule Performance Indicators in Design, Procurement, and Construction Phases of Heavy Industrial Projects

Construction is a dynamic industry due to the existence of uncertainties surrounding evolving technologies, budgets, resources, and the development process. Because construction environments are relatively complicated, project managers may face significant challenges in delivering timely and effective project outcomes. Delays may occur throughout the design, procurement, and construction (DPC) phases of all construction projects, including those involving heavy industry; however, indicators of schedule delays can be identified early in a project’s life cycle, and appropriate strategies can be applied. This purpose of this study was to identify indicators that lead to the poor schedule performance of a project during the DPC phases and to examine the robustness of each schedule performance indicator. To accomplish this objective, a survey questionnaire was designed and sent to a diverse group of experienced construction professionals. Statistical methods, such as the chi-squared test, the two-sample t-test, and the Kruskal-Wallis test, were employed to evaluate and screen the DPC schedule performance indicators of heavy industrial projects, and a list of schedule delay indicators was developed using the all-possible combination regression analysis approach. The extreme bound analysis (EBA) technique was used to determine the robustness of each indicator’s relationship to the model. The results revealed nine robust schedule performance indicators in each of the DPC phases. The findings of this study can be used by the decision makers in construction projects to emphasize more reliable factors and minimize the number of revisions required during a project’s execution.

A New Image Encryption Algorithm Based on DNA State Machine for UAV Data Encryption

Drone-based surveillance has become widespread due to its flexibility and ability to access hazardous areas, particularly in industrial complexes. As digital camera capabilities improve, more visual information can be stored in high-resolution images, resulting in larger image sizes. Therefore, algorithms for encrypting digital images sent from drones must be both secure and highly efficient. This paper presents a novel algorithm based on DNA computing and a finite state machine (FSM). DNA and FSM are combined to design a key schedule with high flexibility and statistical randomness. The image encryption algorithm is designed to achieve both confusion and diffusion properties simultaneously. The DNA bases themselves provide diffusion, while the random integers extracted from the DNA bases contribute to confusion. The proposed algorithm underwent a thorough set of statistical analyses to demonstrate its security. Experimental findings show that the proposed algorithm can resist many well-known attacks and encrypt large-sized images at a higher throughput compared to other algorithms. High experimental results for the proposed algorithm include correlation coefficients of 0.0001 and Shannon entropy of 7.999. Overall, the proposed image encryption algorithm meets the requirements for use in drone-based surveillance applications.

Efficient hardware implementation of SIMECK lightweight block cipher

The internet of things (IoT) has recently expanded, resulting in a new world of smart gadgets with substantial security consequences. For their vital security role, lightweight block ciphers have gained a significant amount of development in low resource devices (LRDs). SIMECK is a new lightweight block cipher family that incorporates the finest aspect of both SIMON and SPECK. SIMECK is a more efficient block cipher than SIMON and SPECK cipher. These lightweight ciphers are especially referred to as an alternative to the AES for RCD. In this study, area optimised architecture is implemented for SIMECK lightweight block cipher with sizes: 64/128. For implementation on different platforms such as Sparton-6, Sparton-3, Virtex-7, Virtex-6, Virtex-5 and Virtex-4 FPGA are used to examine several properties such as block size, key scheduling, and throughput, among others. The proposed area optimised architecture have attained a maximum operating frequency of 496.429 MHz with 61 slices and a high throughput of 706.032 Mbps on the Virtex-7 platform.

Evaluating the Normative and Institutional Frameworks for Management of Violent Extremism Offenders in the Kenyan Prisons

This study aimed at evaluating the normative and institutional frameworks for management of violent extremism offenders in the Kenyan prisons. This study was guided by the Restorative justice theory, Retributive justice theory and the transformative justice theory. The study applied descriptive research design. This study used purposive and simple random sampling techniques to select 200 respondents who included; prison staff (senior staff), religious leaders (Sheikhs), and criminal justice lawyers, Office of the ODPP, prosecutors and inmates. Primary data was collected using questionnaires and key informants interview schedules. Secondary data was collected from published articles, journals, books, dissertations and projects. Quantitative data was coded and entered into Statistical Package for Social Sciences (SPSS) software version 22 for analysis while qualitative data was arranged thematically and presented through narration. The study findings established that; there exist weaknesses in law regarding management of violent extremist in Kenya particularly leniency relating to the justice served. On the strategies utilized for the management of violent extremist, incarceration is perceived as a fairly effective strategy while military incursion is regarded as a very effective strategy. Radicalization can be positive if it does not encourage violence or harm. Prison authorities have adopted various approaches to manage violent extremism which include; faith-based interventions which entail religious transformation offered by professional Clerics; separation of convicted inmates in different prison blocks and cells; education and vocational training to illiterate and marginalized offenders to acquire skills which can avail them employment opportunities, psychological and cognitive approaches as well as use of recreational and cultural activities. These strategies are geared towards dissuading violent extremism offenders from extremism as well as deradicalize them. The study findings identified the challenges which confront the successful implementation of deradicalization and prevention of violent extremism in Kenyan Prisons as well as opportunities. They include; institutional challenges, recidivism or relapse among the Prisoners; reintegration challenges; structural challenges evidenced by unemployment among the released terrorist convicts; regulatory discontinuities, Gang related problems among others. In this regard the study recommends for a coordinated multiagency cooperation in the management of violent extremists suspects or prisoners. There is also need for drafting and legislation of a policy framework for the management of violent extremism in rehabilitation facilities in the country.

Attention Based Quick Network With Optical Flow Estimation for Semantic Segmentation

Video semantic segmentation is a challenging vision task since the temporal-spatial characteristics are difficult to model to satisfy the requirements of real-time and accuracy simultaneously. To tackle this problem, this paper proposes a novel optical flow based method. We propose an adaptive threshold key frame scheduling strategy to model the temporal information by estimating the inter-frame similarity. To ensure segmentation accuracy, we construct a convolutional neural network named Quick Network with attention (QNet-attention), a lightweight image semantic segmentation model with a spatial-pyramid-pooling-attention module. The proposed network is further combined with optical flow estimation to realize a semantic segmentation framework. The performance of the proposed method is verified with existing benchmark methods. The experimental results indicated that our method achieves excellent balanced performance on accuracy and speed.

Security Implication of Mutual Police and Societal Corruption in Nairobi County, Kenya

This paper uses data collected for an MA Thesis on the security implication of the mutual police and societal corruption in Nairobi County, Kenya. The study was motivated by increased insecurity in Embakasi North constituency despite tight security in the area. This study attributed this to mutual police and societal corruption that this study sought to establish. This study was guided by the Erosion Theory (ET) of corruption explaining why so many potentially good people get drawn into the vice. The study used cross-sectional survey design and stratified random sampling techniques and enlisted, 196 respondents and 10 Key Informants (K. I’s). The main data collection methods were the questionnaires for the main respondents and interviews for K. I’s. The main data collection tools were the questionnaires and Key Informants schedules. Quantitative data will be analyzed with the aid of statistical package for social sciences (SPSS). This study unraveled both, Macro and Micro police contextual obstacles where the extent and implications of the state organs such as the legislature, executive, and justice sector institutions suggested corrupt political contexts, hence constraining policing function with criminological approaches to corruption. With reference to the second objective, the study revealed the main forms of police corruption in the area which included receiving bribes to; release suspects from lawful custody, assist suspects evade arrest, cover up criminal activities, reveal police operations; protection of illegal activities, evidence tampering & theft and disclosure of privileged Information amongst others. These forms of corruption benefited organized criminal groups, which were said to be potentially risky to an extent of disabling both individuals and entire institutions, besides seeking state capture; in polity and economy. Finally, the study revealed a deeper relationship between police and society corruption based on determinant factors such as culture (p=0.01), systemic failure of governance(p=0.01), and failed economy (p=0.02). Deeper insight of police corruption seems to draw from a society wide cultural corruption paradigm. This study recommends that recommends an anti-corruption approach that goes beyond targeting “bad apples” and adopt a systems approach. Further, Political will from a benevolent dictator with presidential degrees on matters corruption will help crush this cancerous vice to the nib.

A Survey of Scheduling in 5G URLLC and Outlook for Emerging 6G Systems

Future wireless communication is expected to be a paradigm shift from three basic service requirements of 5th Generation (5G) including enhanced Mobile Broadband (eMBB), Ultra Reliable and Low Latency communication (URLLC) and the massive Machine Type Communication (mMTC). Integration of the three heterogeneous services into a single system is a challenging task. The integration includes several design issues including scheduling network resources with various services. Specially, scheduling the URLLC packets with eMBB and mMTC packets need more attention as it is a promising service of 5G and beyond systems. It needs to meet stringent Quality of Service (QoS) requirements and is used in time-critical applications. Thus through understanding of packet scheduling issues in existing system and potential future challenges is necessary. This paper surveys the potential works that addresses the packet scheduling algorithms for 5G and beyond systems in recent years. It provides state of the art review covering three main perspectives such as decentralised, centralised and joint scheduling techniques. The conventional decentralised algorithms are discussed first followed by the centralised algorithms with specific focus on single and multi-connected network perspective. Joint scheduling algorithms are also discussed in details. In order to provide an in-depth understanding of the key scheduling approaches, the performances of some prominent scheduling algorithms are evaluated and analysed. This paper also provides an insight into the potential challenges and future research directions from the scheduling perspective.

STUDY OF THE CRYPTOGRAPHIC STRENGTH OF THE S-BOX OBTAINED ON THE BASIS OF EXPONENTIATION MODULO

This article presents one of the main transformations of symmetric block ciphers used to protect confidential information, a new method for obtaining a non-linear S block, and an analysis of the results obtained. The S-box obtained by this method can be used as a non-linear transformation in block cipher algorithms to protect confidential data transmitted over an open channel. In most well-known works in the field of analysis and synthesis of modern block symmetric ciphers, S-box is used as a mathematical apparatus for cryptographic Boolean functions. In this case, each S-box is represented by a set of composite Boolean functions whose properties characterize the efficiency of the nonlinear substitution node. Substitution nodes for modern symmetric primitives, including key unfolding functions, are usually implemented as replacement tables. Considering that in most modern block symmetric ciphers for introducing round keys, the encryption algorithm uses a linear operation (bitwise addition modulo 2), S-blocks are the only elements responsible for the cryptographic stability of block encryption algorithms. The required number of rounds of block symmetric ciphers is selected taking into account the results of the cryptographic analysis performed, provided that the properties of S-boxes are specified. As the main criteria and performance indicators, the balance and nonlinearity of composite Boolean functions are used; strict avalanche criterion (SAC), propagation criterion; algebraic degree; the value of the autocorrelation function. In this article, a study was made of the nonlinearity and strict avalanche criterion (SAC) of the S-box used in the block symmetric encryption algorithm. The results of the study were compared with the S-boxes of modern cryptographic algorithms and showed good results.

Tweakable SM4: How to tweak SM4 into tweakable block ciphers?

SM4 is China’s commercial block cipher standard and an ISO/IEC international standard. While SM4 withstood a great deal of analysis, its non-tweakable structure makes it inflexible. In this paper, we study three different methods to turn SM4 into a tweakable block cipher. Based on the Tweak-aNd-Tweak (TNT) introduced by Bao et al. at EUROCRYPT 2020, we propose the first scheme, called TNT-SM4, which can be treated as an instantiation of TNT. For comparative analysis, the 128 and 32 bits tweaks are both adopted, which is denoted as TNT-SM4-128 and TNT-SM4-32, respectively. By taking full advantage of the structural characteristics of SM4, we also propose the second method, which studies how to tweak SM4 into a tweakable block cipher in a direct way. With the design goal of reducing the design, security evaluation, and implementation costs, we use SM4 as is and attach a lightweight linear tweak schedule to it. The biggest challenge is to find the best insertion location for tweaks in both aspects of security and efficiency. We extensively utilize mixed integer linear programming (MILP) to perform a comprehensive search. The third method adopts the same tweak schedule as the key schedule of SM4, which is equivalent to one more key schedule for SM4. We analyze the security of the three schemes, focusing on related-key and related-tweak attacks, and provide a comparative analysis of the three schemes. The results show that our schemes are secure, and a better scheme that makes SM4 more flexible is obtained from the comparison of the three schemes.

Implementasi Algoritma RC4A Dalam Pengamanan Citra Digital

Digital images that are private and confidential are very vulnerable to wiretapping by irresponsible parties, especially if the images are distributed via the internet. The act of theft and abuse of secret images of course can harm the image owner. One of the techniques to reduce the above problems is by using cryptographic techniques. Cryptographic techniques can secure images by means of digital image encryption by implementing the RC4A algorithm then using the initial keyword as input in the process carried out to generate new, more random keywords, based on the Key Schedule Algorithm. (KSA) and pseudo random generation algorithm (PRGA). To determine the comparison between the original image (PlainImage) and the original image (CipherImage), processing was carried out with MeanSquareError (MSE) and PeakSiqnalToNoiseRation (PSNR). The results of this study were digital images encrypted with the RC4A algorithm in terms of time differences and image results after encryption where the time used to encrypt is shorter than the description and the image results before encryption are not the same after encryption.

Design and cryptanalysis of a new iterative structure

AbstractThis study proposes a new iterative structure called the L‐Feistel structure, which shares similar procedures between encryption and decryption and could unify the Feistel structure and the Lai‐Massey structure. This paper evaluates the security of the L‐Feistel structure from the perspective of provable security and classical analysis, respectively. Firstly, it is proved that the 4‐round Key‐Alternating L‐Feistel cipher with independent round keys and independent round functions is secure against 2n/2 queries that is, birthday‐bound security. Then by presenting the dual structure of the L‐Feistel structure with SP‐type round functions, it is proven that a differential of the L‐Feistel structure is impossible when and only when it is a zero‐correlation linear hull of its dual structure. Finally, the paper constructs impossible differentials, zero‐correlation linear hulls and integral distinguishers of the L‐Feistel structure with SP‐type round functions which cover six and seven rounds, respectively, under different conditions.

Differential fault analysis on the lightweight block cipher plug‐in plug‐out

AbstractIn recent years, many lightweight block ciphers were proposed to provide security for resource‐constrained environments such as Internet of Things (IoT). PIPO, which stands for “plug‐in plug‐out”, is just a lightweight bit‐sliced block cipher offering excellent performance in 8‐bit AVR software implementations. In fact, PIPO owns 64‐bit input and output, 128‐bit secret key. In this article, we consider the differential fault analysis (DFA), a typical side‐channel attack, on the PIPO cipher. More concretely, for the first time, we apply the mixed attack model, which considers the DFA on the encryption state and key schedule simultaneously, to recover PIPO's 128‐bit master key. The theoretical analysis shows that, in average, after injecting 4‐byte faults, the complexity of obtaining the master key reduces from 2128 reduces to 214. In fact, this attack model alleviates the assumption on attacker than the bit‐injection case. It should be noted that our analysis also holds for other bit‐sliced block ciphers. Finally, the simulations show that our proposed DFA on PIPO cipher is rather practical.