scholarly journals Rocca: An Efficient AES-based Encryption Scheme for Beyond 5G

2021 ◽  
pp. 1-30
Author(s):  
Kosei Sakamoto ◽  
Fukang Liu ◽  
Yuto Nakano ◽  
Shinsaku Kiyomoto ◽  
Takanori Isobe
Keyword(s):  
Critical Path ◽  
Authenticated Encryption ◽  
Round Function ◽  
Cryptographic Algorithm ◽  
Xor Operation ◽  
Software Implementations ◽  
Free Block ◽  
Key Length ◽  
Block Permutation ◽  
State Size

In this paper, we present an AES-based authenticated-encryption with associated-data scheme called Rocca, with the purpose to reach the requirements on the speed and security in 6G systems. To achieve ultra-fast software implementations, the basic design strategy is to take full advantage of the AES-NI and SIMD instructions as that of the AEGIS family and Tiaoxin-346. Although Jean and Nikolić have generalized the way to construct efficient round functions using only one round of AES (aesenc) and 128-bit XOR operation and have found several efficient candidates, there still seems to exist potential to further improve it regarding speed and state size. In order to minimize the critical path of one round, we remove the case of applying both aesenc and XOR in a cascade way for one round. By introducing a cost-free block permutation in the round function, we are able to search for candidates in a larger space without sacrificing the performance. Consequently, we obtain more efficient constructions with a smaller state size than candidates by Jean and Nikolić. Based on the newly-discovered round function, we carefully design the corresponding AEAD scheme with 256-bit security by taking several reported attacks on the AEGIS family and Tiaxion-346 into account. Our AEAD scheme can reach 138Gbps which is 4 times faster than the AEAD scheme of SNOW-V. Rocca is also much faster than other efficient schemes with 256-bit key length, e.g. AEGIS-256 and AES-256-GCM. As far as we know, Rocca is the first dedicated cryptographic algorithm targeting 6 systems, i.e., 256-bit key length and the speed of more than 100 Gbps.

scholarly journals A High-Speed Elliptic Curve Cryptography Processor for Teleoperated Systems Security

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Yong Xiao ◽  
Weibin Lin ◽  
Yun Zhao ◽  
Chao Cui ◽  
Ziwen Cai
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
High Speed ◽  
High Performance ◽  
Prime Field ◽  
Practical Applications ◽  
Cell Library ◽  
Cryptographic Algorithm ◽  
Human Operators ◽  
Key Length

Teleoperated robotic systems are those in which human operators control remote robots through a communication network. The deployment and integration of teleoperated robot’s systems in the medical operation have been hampered by many issues, such as safety concerns. Elliptic curve cryptography (ECC), an asymmetric cryptographic algorithm, is widely applied to practical applications because its far significantly reduced key length has the same level of security as RSA. The efficiency of ECC on GF (p) is dictated by two critical factors, namely, modular multiplication (MM) and point multiplication (PM) scheduling. In this paper, the high-performance ECC architecture of SM2 is presented. MM is composed of multiplication and modular reduction (MR) in the prime field. A two-stage modular reduction (TSMR) algorithm in the SCA-256 prime field is introduced to achieve low latency, which avoids more iterative subtraction operations than traditional algorithms. To cut down the run time, a schedule is put forward when exploiting the parallelism of multiplication and MR inside PM. Synthesized with a 0.13 um CMOS standard cell library, the proposed processor consumes 341.98k gate areas, and each PM takes 0.092 ms.

scholarly journals Implementation Gifford Method For Digital Image Security

2020 ◽  
Vol 2 (2) ◽  
pp. 237-244
Author(s):  
Fauduziduhu Laia ◽  
Erwin Panggabean
Keyword(s):  
Digital Image ◽  
Stream Cipher ◽  
Rapid Development ◽  
Encryption Algorithm ◽  
Output Function ◽  
Original Image ◽  
Left Shift ◽  
Cryptographic Algorithm ◽  
Xor Operation ◽  
The Right

Rapid development of digital image technology secret causes images require security aspect. Reviews These digital secret image can be encrypted using cryptographic methods. After being encrypted, the image is randomized, so that if it is Obtained by an unauthorized party, the image has no meaning. The cryptographic algorithm used in this study is Gifford method. The Gifford method is a stream cipher, a symmetry encryption algorithm that transforms the data character by character. Gifford has 8 registers filled with key bits. The processes performed by the Gifford method are the Output Function process, the 1-bit Sticky Shift Right process, the 1-bit Left Shift process, the XOR operation and the shift register operation to the right. The decryption process must use the same key as the encryption process in order to Obtain the original image.

Hybrid Cryptography for Random-key Generation based on ECC Algorithm

2017 ◽  
Vol 7 (3) ◽  
pp. 1293 ◽  
Author(s):  
P. Gayathri ◽  
Syed Umar ◽  
G. Sridevi ◽  
N. Bashwanth ◽  
Royyuru Srikanth
Keyword(s):  
Security Level ◽  
Key Generation ◽  
Public Key Encryption ◽  
Private Key ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Safe Side ◽  
Key Length ◽  
High Level ◽  
User Friendly

As more increase in usage of communications and developing them more user friendly. While developing those communications, we need to take care of security and safety of user’s data. Many researchers have developed many complex algorithms to maintain security in user’s application. Among those one of the best algorithms are cryptography based, in which user will be safe side mostly from the attackers.  We already had some AES algorithm which uses very complex cryptographic algorithm to increase the performance and more usage of lookup tables. So the cache timing attackers will correlates the details to encrypt the data under known key with the unknown key. So, for this we provide an improvised solution. This paper deals with an extension of public-key encryption and decryption support including a private key. The private key is generated with the combination of AES and ECC. In general AES, key length is 128 bits with 10 times of iterations. But with this, users won’t get efficient security for their operations, so to increase the security level we are implementing 196-bit based encryption with 12 times round-key generation iterations. By this enhancement, we can assure to users to high level security and can keep users data in confidential way.

Analyzing the Linear Keystream Biases in AEGIS

2020 ◽  
pp. 348-368
Author(s):  
Maria Eichlseder ◽  
Marcel Nageler ◽  
Robert Primas
Keyword(s):  
Family Member ◽  
Upper Bounds ◽  
Software Performance ◽  
Authenticated Encryption ◽  
Boolean Operations ◽  
Large State ◽  
Round Function ◽  
Linear Characteristic ◽  
Caesar Competition ◽  
Generic Attacks

AEGIS is one of the authenticated encryption designs selected for the final portfolio of the CAESAR competition. It combines the AES round function and simple Boolean operations to update its large state and extract a keystream to achieve an excellent software performance. In 2014, Minaud discovered slight biases in the keystream based on linear characteristics. For family member AEGIS-256, these could be exploited to undermine the confidentiality faster than generic attacks, but this still requires very large amounts of data. For final portfolio member AEGIS-128, these attacks are currently less efficient than generic attacks. We propose improved keystream approximations for the AEGIS family, but also prove upper bounds below 2−128 for the squared correlation contribution of any single suitable linear characteristic.

scholarly journals Base64 Sebagai Kunci Keamanan pada One Time Pad (OTP)

2020 ◽  
Vol 5 (2) ◽  
pp. 241
Author(s):  
Oris Krianto Sulaiman ◽  
Khairuddin Nasution ◽  
Satria Yudha Prayogi
Keyword(s):  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Key Length

Message security in communication is very important to maintain the confidentiality and integrity of messages. The message that is sent must be conveyed in its entirety and only delivered according to its purpose. One Time Pad or OTP is an algorithm that can encrypt messages into ciphertext so that message security can be guaranteed. OTP is a symmetric cryptographic algorithm, that is, the key for encryption and decryption is the same. To perform encryption, the OTP plaintext length must be the same as the key length. This will make it difficult when there is a very long length of plaintext, so the key must also adjust it. OTP keys also have a weakness if a key has been used more than once. Therefore a key builder is needed. In this research, the key generator used is base64. Base64 is used to change the bits of plaintext that will be used by OTP. In this study, base64 can encode plaintext to be used as an OTP key so that it succeeded in making the key generator from base64 encoding.

scholarly journals Estimation of confidentiality of a communication system based on chaotic time-delay generator with switchable delay time

2019 ◽  
pp. 54-61
Author(s):  
Vladimir Ponomarenko ◽  
Elena Navrotskaya ◽  
Danil Kul’minskii ◽  
Mikhail Prokhorov
Keyword(s):  
Time Delay ◽  
Communication System ◽  
Delay Time ◽  
Communication Systems ◽  
Quantitative Estimation ◽  
Security Assessment ◽  
Dynamical Chaos ◽  
Cryptographic Algorithm ◽  
Information Signal ◽  
Key Length

Introduction: Communication systems based on the use of dynamical chaos have a number of positive features. Dynamical chaoshas the properties of random processes, which allows systems based on it to ensure the information transmission confidentiality.However, a quantitative security assessment of such systems is a complicated problem, since the methods for evaluating cryptographicstrength are well developed only for the classical encryption algorithms. Purpose: Development of a method for quantitative estimationof confidentiality of a binary signal hidden transmission in a communication system based on a chaotic time-delay oscillator withswitchable delay time. Results: A method is proposed for estimating the confidentiality of a binary information signal transmissionin a communication system using a chaotic time-delay oscillator with switchable delay time as a transmitter. The method is based onestimating the power of the key space for the chaotic communication system under study. We have considered the cases when sometransmitter parameters are known, and the most general case when all the transmitter parameters are unknown. A communicationsystem based on dynamical chaos may have a much higher confidentiality than the classical cryptographic algorithm using a cipher witha key length of 56 bits, but is significantly inferior in terms of cryptographic strength to a cipher with a key length of 128 bits. Practicalrelevance: The proposed method allows us to obtain a quantitative estimation of confidentiality of communication systems based ondynamical chaos, and compare it with the known strength of classical cryptographic algorithms.

scholarly journals Meet-in-the-Middle Attacks on Classes of Contracting and Expanding Feistel Constructions

2017 ◽  
pp. 307-337 ◽  
Author(s):  
Jian Guo ◽  
Jérémy Jean ◽  
Ivica Nikolic ◽  
Yu Sasaki
Keyword(s):  
The State ◽  
Linear Functions ◽  
Block Length ◽  
Nonlinear Functions ◽  
Round Function ◽  
Generic Attacks ◽  
Key Length ◽  
Feistel Ciphers

We show generic attacks on unbalanced Feistel ciphers based on the meet-in-the-middle technique. We analyze two general classes of unbalanced Feistel structures, namely contracting Feistels and expanding Feistels. In both of the cases, we consider the practical scenario where the round functions are keyless and known to the adversary. In the case of contracting Feistels with 4 branches, we show attacks on 16 rounds when the key length k (in bits) is as large as the block length n (in bits), and up to 24 rounds when k = 2n. In the case of expanding Feistels, we consider two scenarios: one, where different nonlinear functions without particular structures are used in the round function, and a more practical one, where a single nonlinear is used but different linear functions are introduced in the state update. In the former case, we propose generic attacks on 13 rounds when k = n, and up to 21 rounds when k = 2n. In the latter case, 16 rounds can be attacked for k = n, and 24 rounds for k = 2n.

Aplikasi Keamanan Sms Menggunakan Algoritma Rijndael

2017 ◽  
Vol 16 (1) ◽  
pp. 105
Author(s):  
Raesul Azhar ◽  
Kurniawan
Keyword(s):  
Mobile Phones ◽  
Short Message Service ◽  
Computing Time ◽  
Short Message ◽  
Cryptographic Algorithm ◽  
Message Service ◽  
Key Length ◽  
Basic Features

Mobile phones and smartphones providing the basic features of SMS (Short Message Service).Messages sent through SMS facility sometimes confidential, so that the necessary mechanisms to protect messages from crime. Mechanism that can be used to protect the message is to use a cryptographic algorithm Rijndael. This algorithm is a cryptographic algorithm chipher 128-bit block that has the ability to protect confidential messages. This research resulted in an application that can be used to protect the SMS message when the message is sent and received by users. Based on research conducted on the length of different messages with the same key length is obtained that the length of the message used computing time takes longer than the length of the message is the same and different key lengths.

Kriptografi Audio MP3 Menggunakan RSA dan Transposisi Kolom

2021 ◽  
Vol 5 (3) ◽  
pp. 483-488
Author(s):  
Cinantya Paramita ◽  
Usman Sudibyo
Keyword(s):  
Internet Of Things ◽  
The Internet ◽  
Trial And Error ◽  
Application System ◽  
Algorithm Development ◽  
Audio File ◽  
Cryptographic Algorithm ◽  
Key Length ◽  
The Many ◽  
The Internet Of Things

Mp3 is one form of audio file extension that is widely used today. With a variety of uses in a variety of mp3 systems become one of the audio extensions that are commonly found in technology systems of the Internet of Things era. However, with the many uses of the .mp3 file extension, there is a new problem, namely the security of the data itself. From these problems, the author aims to examine the security of the mp3 file by designing cryptographic science-based applications. The cryptographic algorithm used in the application is a combination of the asymmetric RSA 2048 algorithm and symmetric columnic transpositions. RSA 2048 algorithm was chosen because it has a key length in accordance with NIST standards in securing data. By combining the two algorithms, the application system will have the ability to manage mp3 files and encrypt mp3 files with the results of data that cannot be played like mp3 files in general. This application system will be developed by prototype method which is the best method in developing a system with trial and error in algorithm development.  

Sign in / Sign up

Export Citation Format

Share Document