scholarly journals Lorentz Chaotic System Key generation with Low Area FPGA Implementation using Present Security Algorithm

2019 ◽  
Vol 8 (2) ◽  
pp. 2104-2110
Keyword(s):  
Chaotic System ◽  
Block Cipher ◽  
Low Power Design ◽  
Streaming Data ◽  
Lookup Table ◽  
Security Level ◽  
Flip Flop ◽  
Cryptographic Algorithm ◽  
Cryptographic Algorithms ◽  
Lightweight Block Cipher

Recently, the study of lightweight symmetric ciphers has gained more importance because of high requirement in the services for security in the CCNs (Constrained Computing Environments): Wireless Sensor Network (WSN), Internet of Things (IoT). A lightweight cipher is a cryptographic algorithm which is used for low resource device, minimal area optimization, low power design and attains sufficient security level. Size of the key is considered as major challenges in the cryptographic algorithms, because it increases the complexity of the cryptographic algorithm. To overcome this issue and improve the security, Lorentz Chaotic System (LCS) based PRESENT architecture is introduced in this research. The PRESENT lightweight block cipher is selected due to it is most general and famous lightweight algorithms. Hence, the random numbers were generated for a key purpose by using an LCS circuit. The streaming data will be encrypt and decrypt by using this algorithm. In this research, the modified lightweight block cipher algorithm is called as LCS- PRESENT architecture. Finally, the performance of LCS - PRESENT architecture was evaluated by FPGA hardware utilizations such as Lookup Table (LUT), flip flop, slices, and frequency. The security level of LCS- PRESENT architecture was analysed based on encrypted and decrypted results in XILINX tool. The LCS- PRESENT architecture utilizes the FPGA device to attain maximum accuracy and throughput, such as 30 of LUTs, 115 of flip flops and 47 of slices from available sources compared to existing cryptographic algorithms.

scholarly journals Convolutional Neural Network-Based Cryptography Ransomware Detection for Low-End Embedded Processors

Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 705
Author(s):  
Hyunji Kim ◽  
Jaehoon Park ◽  
Hyeokdong Kwon ◽  
Kyoungbae Jang ◽  
Hwajeong Seo
Keyword(s):  
Success Rate ◽  
Block Cipher ◽  
C Language ◽  
Cryptographic Algorithm ◽  
Novel Approach ◽  
Source Data ◽  
Iot Platforms ◽  
Lightweight Block Cipher ◽  
Deep Learning Network ◽  
Exclusive Or

A crypto-ransomware has the process to encrypt victim’s files. Afterward, the crypto-ransomware requests a ransom for the password of encrypted files to victims. In this paper, we present a novel approach to prevent crypto-ransomware by detecting block cipher algorithms for Internet of Things (IoT) platforms. We extract the sequence and frequency characteristics from the opcode of binary files for the 8-bit Alf and Vegard’s RISC (AVR) processor microcontroller. In other words, the late fusion method is used to extract two features from one source data, learn through each network, and integrate them. We classify the crypto-ransomware virus or harmless software through the proposed method. The general software from AVR packages and block cipher implementations written in C language from lightweight block cipher library(i.e., Fair Evaluation of Lightweight Cryptographic Systems (FELICS)) are trained through the deep learning network and evaluated. The general software and block cipher algorithms are successfully classified by training functions in binary files. Furthermore, we detect binary codes that encrypt a file using block ciphers. The detection rate is evaluated in terms of F-measure, which is the harmonic mean of precision and recall. The proposed method not only achieved 97% detection success rate for crypto-ransomware but also achieved 80% success rate in classification for each lightweight cryptographic algorithm and benign firmware. In addition, the success rate in classification for Substitution-Permutation-Network (SPN) structure, Addition-Rotation-eXclusive-or structures (ARX) structure, and benign firmware is 95%.

scholarly journals Fast lightweight block cipher design with involution substitution permutation network (SPN) structure

2020 ◽  
Vol 20 (1) ◽  
pp. 361
Author(s):  
Omar A. Dawood
Keyword(s):  
Block Cipher ◽  
Block Size ◽  
Limited Resources ◽  
Security Level ◽  
Embedded Devices ◽  
Iot Applications ◽  
Restricted Environment ◽  
Lightweight Block Cipher ◽  
The Internet Of Things ◽  
Design Aspect

<p>In the present paper, a new cryptographic lightweight algorithm has been developed for the Internet of Things (IoT) applications. The submitted cipher designed with the involution Substitution Permutation Network SPN structure. The involution structure means that the same encryption algorithm is used in the decryption process except the ciphering key algorithm is applied in reverse order. The introduced algorithm encrypts the data with a block size of 128-bit 192-bit or 256-bit, which iterative with 10, 12 and 14-rounds respectively similar to the AES cipher. The design aspect supports an elegant structure with a secure involution round transformation. The main round is built without S-Box stage instead that it uses the on-fly immediate computing stage and the involution of mathematical invertible affine equations. The proposed cipher is adopted to work in a restricted environment and with limited resources pertaining to embedded devices. The proposed cipher introduces an accepted security level and reasonable Gate Equivalent (GE) estimation with fast implementation.</p>

A Chaos-Based Approach for Correcting the Security Level of a Block Cipher Algorithm

2016 ◽  
Vol 11 (2) ◽  
pp. 92
Author(s):  
Fatma Zayen Sbiaa ◽  
Medien Zeghid ◽  
Sonia Kotel ◽  
Rached Tourki ◽  
Mohsen Machhout ◽  
...  
Keyword(s):  
Block Cipher ◽  
Security Level

A Novel Simplified AES Algorithm for Lightweight Real-Time Applications: Testing and Discussion

2020 ◽  
Vol 13 (3) ◽  
pp. 435-445 ◽  
Author(s):  
Malik Qasaimeh ◽  
Raad S. Al-Qassas ◽  
Fida Mohammad ◽  
Shadi Aljawarneh
Keyword(s):  
Processing Time ◽  
Block Size ◽  
Statistical Test ◽  
Mathematical Proofs ◽  
The Past ◽  
Aes Algorithm ◽  
Cryptographic Algorithm ◽  
Cryptographic Algorithms ◽  
Compare And Contrast ◽  
Constrained Devices

Background: Lightweight cryptographic algorithms have been the focus of many researchers in the past few years. This has been inspired by the potential developments of lightweight constrained devices and their applications. These algorithms are intended to overcome the limitations of traditional cryptographic algorithms in terms of exaction time, complex computation and energy requirements. Methods: This paper proposes LAES, a lightweight and simplified cryptographic algorithm for constricted environments. It operates on GF(24), with a block size of 64 bits and a key size of 80-bit. While this simplified AES algorithm is impressive in terms of processing time and randomness levels. The fundamental architecture of LAES is expounded using mathematical proofs to compare and contrast it with a variant lightweight algorithm, PRESENT, in terms of efficiency and randomness level. Results: Three metrics were used for evaluating LAES according to the NIST cryptographic applications statistical test suite. The testing indicated competitive processing time and randomness level of LAES compared to PRESENT. Conclusion: The study demonstrates that LAES achieves comparable results to PRESENT in terms of randomness levels and generally outperform PRESENT in terms of processing time.

scholarly journals Efficient Implementation of PRESENT and GIFT on Quantum Computers

2021 ◽  
Vol 11 (11) ◽  
pp. 4776
Author(s):  
Kyungbae Jang ◽  
Gyeongju Song ◽  
Hyunjun Kim ◽  
Hyeokdong Kwon ◽  
Hyunji Kim ◽  
...  
Keyword(s):  
Block Cipher ◽  
Search Algorithm ◽  
Block Ciphers ◽  
Quantum Circuits ◽  
Security Level ◽  
Symmetric Key ◽  
Grover Search ◽  
Target Block ◽  
Symmetric Key Cryptography ◽  
Grover Search Algorithm

Grover search algorithm is the most representative quantum attack method that threatens the security of symmetric key cryptography. If the Grover search algorithm is applied to symmetric key cryptography, the security level of target symmetric key cryptography can be lowered from n-bit to n2-bit. When applying Grover’s search algorithm to the block cipher that is the target of potential quantum attacks, the target block cipher must be implemented as quantum circuits. Starting with the AES block cipher, a number of works have been conducted to optimize and implement target block ciphers into quantum circuits. Recently, many studies have been published to implement lightweight block ciphers as quantum circuits. In this paper, we present optimal quantum circuit designs of symmetric key cryptography, including PRESENT and GIFT block ciphers. The proposed method optimized PRESENT and GIFT block ciphers by minimizing qubits, quantum gates, and circuit depth. We compare proposed PRESENT and GIFT quantum circuits with other results of lightweight block cipher implementations in quantum circuits. Finally, quantum resources of PRESENT and GIFT block ciphers required for the oracle of the Grover search algorithm were estimated.

Protecting lightweight block cipher implementation in mobile big data computing

2016 ◽  
Vol 11 (2) ◽  
pp. 252-264
Author(s):  
Weidong Qiu ◽  
Bozhong Liu ◽  
Can Ge ◽  
Lingzhi Xu ◽  
Xiaoming Tang ◽  
...  
Keyword(s):  
Big Data ◽  
Block Cipher ◽  
Mobile Big Data ◽  
Lightweight Block Cipher ◽  
Big Data Computing

Eight-sided fortress: a lightweight block cipher

2014 ◽  
Vol 21 (1) ◽  
pp. 104-128
Author(s):  
Xuan LIU ◽  
Wen-ying ZHANG ◽  
Xiang-zhong LIU ◽  
Feng LIU
Keyword(s):  
Block Cipher ◽  
Lightweight Block Cipher

Dynamic Cryptographic Algorithms Kuznyechik and Magma

2020 ◽  
Vol 1 (11) ◽  
pp. 1-10
Author(s):  
Pablo Freyre ◽  
Oristela Cuellar ◽  
Nelson Díaz ◽  
Ramses Rodríguez ◽  
Adrián Alfonso
Keyword(s):  
Russian Federation ◽  
Block Cipher ◽  
A Priori ◽  
Block Length ◽  
Cryptographic Algorithms ◽  
The Russian Federation

Abstract—The cryptographic algorithms Kuznyechik and Magma since 2015 are block cipher standardized in the Russian Federation, formally called GOST R 34.12-2015. Both use fixed functions as a priori selected and differ on the structure, the block length and the bit-level of the processed blocks. In the present paper, we provide a dynamic variant of Kuznyechik and Magma where some of their functions are randomly generated and dependent on pseudorandom sequences.Tóm tắt—Các thuật toán mã hóa Kuznyechik và MAGMA từ năm 2015 là mật mã khối được tiêu chuẩn hóa ở Liên bang Nga, được gọi chính thức là GOST R 34.12-2015. Hai thuật toán này đều sử dụng các hàm chức năng được lựa chọn ưu tiên và khác nhau về cấu trúc, độ dài khối và mức bit của các khối được xử lý. Trong bài báo này, nhóm tác giả cung cấp một biến thể động của Kuznyechik và MAGMA, trong đó một số hàm chức năng của chúng được tạo ngẫu nhiên và phụ thuộc vào chuỗi giả ngẫu nhiên.

scholarly journals Audio steganography based on least significant bits algorithm with 4D grid multi-wing hyper-chaotic system

2022 ◽  
Vol 12 (1) ◽  
pp. 320
Author(s):  
Hussein Abdulameer Abdulkadhim ◽  
Jinan Nsaif Shehab
Keyword(s):  
Mean Square Error ◽  
Chaotic System ◽  
Signal To Noise Ratio ◽  
Secret Message ◽  
Security Level ◽  
Mean Square ◽  
Signal To Noise ◽  
Protection Level ◽  
Voice Message ◽  
Least Significant Bits

Although variety in hiding methods used to protect data and information transmitted via channels but still need more robustness and difficulty to improve protection level of the secret messages from hacking or attacking. Moreover, hiding several medias in one media to reduce the transmission time and band of channel is the important task and define as a gain channel. This calls to find other ways to be more complexity in detecting the secret message. Therefore, this paper proposes cryptography/steganography method to hide an audio/voice message (secret message) in two different cover medias: audio and video. This method is use least significant bits (LSB) algorithm combined with 4D grid multi-wing hyper-chaotic (GMWH) system. Shuffling of an audio using key generated by GMWH system and then hiding message using LSB algorithm will provide more difficulty of extracting the original audio by hackers or attackers. According to analyses of obtained results in the receiver using peak signal-to-noise ratio (PSNR)/mean square error (MSE) and sensitivity of encryption key, the proposed method has more security level and robustness. Finally, this work will provide extra security to the mixture base of crypto-steganographic methods.

scholarly journals Color Image Encryption using AES and RSA

2020 ◽  
Vol 9 (5) ◽  
pp. 547-550
Keyword(s):  
Data Security ◽  
Block Cipher ◽  
Color Image ◽  
Signal To Noise Ratio ◽  
Security Level ◽  
Change Rate ◽  
The Public ◽  
Key Block ◽  
Symmetric Key ◽  
Encryption Algorithms

Information security is an important task on multimedia and communication world. During storing and sharing maintaining a strategic distance from the outsider access of information is the difficult one. There are many encryption algorithms that can provide data security. In this paper two of the encryption algorithms namely AES and RSA are implemented for color images. AES (Advanced Encryption Standard) is a symmetric key block cipher published in December 2001 by NSIT (National Institute of Standards and Technology). RSA (Rivest-Shamir-Adleman) is an asymmetric key block cipher. It uses two separate keys, one for encryption called the public key and other for decryption called the private key. Both the implementation and analysis are done in Matlab. The quality and security level of both the algorithms is analysed based on various criteria such as Histogram analysis, Correlation analysis, Entropy analysis, NPCR (Number of Pixel Change Rate), UACI (Unified Average Changing Intensity), PSNR (Peak Signal-to-Noise Ratio).

Sign in / Sign up

Export Citation Format

Share Document