Lightweight Cryptographic Algorithm : Variable Key Length Encryption Algorithm (VEA)

2014 ◽  
Author(s):  
Bassam.W. Aboshosha ◽  
Rabie. A. Ramdan ◽  
Abdel Moneim Wahdan
Keyword(s):  
Encryption Algorithm ◽  
Cryptographic Algorithm ◽  
Key Length

scholarly journals Word-based encryption algorithm using dictionary indexing with variable encryption key length

2022 ◽  
Vol 12 (1) ◽  
pp. 669
Author(s):  
Ahmad Al-Jarrah ◽  
Amer Albsharat ◽  
Mohammad Al-Jarrah
Keyword(s):  
Variable Length ◽  
Lookup Table ◽  
Encryption Algorithm ◽  
Two Dimensional ◽  
Statistical Features ◽  
Binary Matrix ◽  
Logical Operations ◽  
Original Message ◽  
Key Length ◽  
Index Size

<p>This paper proposes a new algorithm for text encryption utilizing English words as a unit of encoding. The algorithm vanishes any feature that could be used to reveal the encrypted text through adopting variable code lengths for the English words, utilizing a variable-length encryption key, applying two-dimensional binary shuffling techniques at the bit level, and utilizing four binary logical operations with randomized shuffling inputs. English words that alphabetically sorted are divided into four lookup tables where each word has assigned an index. The strength of the proposed algorithm concluded from having two major components. Firstly, each lookup table utilizes different index sizes, and all index sizes are not multiples of bytes. Secondly, the shuffling operations are conducted on a two-dimensional binary matrix with variable length. Lastly, the parameters of the shuffling operation are randomized based on a randomly selected encryption key with varying size. Thus, the shuffling operations move adjacent bits away in a randomized fashion. Definitively, the proposed algorithm vanishes any signature or any statistical features of the original message. Moreover, the proposed algorithm reduces the size of the encrypted message as an additive advantage which is achieved through utilizing the smallest possible index size for each lookup table.</p>

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.

scholarly journals IMPLEMENTASI STEGANOGRAFI PADA TEKS TERENKRIPSI DENGAN ALGORITMA RSA MENGGUNAKAN METODE BPCS

2018 ◽  
Vol 7 (2) ◽  
pp. 260-265 ◽  
Author(s):  
Yulia Fatma ◽  
Harun Mukhtar ◽  
Muhammad Taufik
Keyword(s):  
Human Life ◽  
Human Vision ◽  
Encryption Algorithm ◽  
Secret Message ◽  
The Internet ◽  
Rsa Algorithm ◽  
Cryptographic Algorithm ◽  
Insertion Method ◽  
Bit Plane ◽  
Internet Network

The internet network is growing rapidly and has a great impact on human life. The development of the internet network has enabled many people to exchange information or messages,one of tham by using email media. Apparently the internet is a path that in ni not too safe because it is a common communication media that can be used by everyone so prone to tapping information or messages. Therefore, security and confidentiality are needed in data communications. One may to keep messages safe is to use steganography technique. The steganography method used is the method of message insertion using BPCS (Bit Plane Complexity Segmentation). Before the message is inserted, the message is first encrypted using cryptography techniques. The cryptographic algorithm used is RSA algorithm. RSA algorithm consists of encryption algorithm and decryption algorithm. The confidential message is encrypted using RSA encryption algorithm and inserted using the insertion method of BPCS. With the technique of steganography on the image media then the delivery of a secret message will have a good level of security because it can not be detected directly by the senses of human vision. Keywords: cryptography, steganography, RSA, method BPCS   Abstrak Jaringan internet berkembang dengan pesat dan memberikan pengaruh besar bagi kehidupan manusia. Perkembangan jaringan Internet telah memungkinkan banyak orang untuk saling bertukar informasi atau pesan salah satunya dengan media email. Ternyata, internet merupakan jalur yang tidak terlalu aman karna merupakan media komunikasi umum yang dapat digunakan semua orang sehingga rawan penyadapan informasi atau pesan. Oleh karena itu, keamanan dan kerahasiaan sangat dibutuhkan dalam komunikasi data. Salah satu cara untuk menjaga keamanan pesan adalah menggunakan teknik steganografi. Metode steganografi yang digunakan adalah metode penyisipan pesan, dengan menggunakan metode BPCS (Bit Plane Complexity Segmentation). Sebelum pesan disisipkan terlebih dahulu pesan tersebut dienkripsi dengan menggunakan teknik kriptografi. Algoritma kriptografi yang digunakan adalah algoritma RSA. Algoritma RSA terdiri dari algoritma enkripsi dan algoritma dekripsi. Pesan rahasia disandikan menggunakan algoritma enkripsi RSA dan disisipkan menggunakan metode penyisipan BPCS. Dengan adanya teknik steganografi pada media citra maka pengiriman suatu pesan yang bersifat rahasia akan memiliki tingkat keamanan yang baik karena tidak dapat dideteksi langsung oleh indera penglihatan manusia. Keywords: Kriptografi, Steganogari, RSA, Metode BPCS

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.

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 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 Super-Encryption Cryptography with IDEA and WAKE Algorithm

2018 ◽  
Author(s):  
Andysah Putera Utama Siahaan ◽  
Robbi Rahim
Keyword(s):  
Data Encryption ◽  
Encryption Algorithm ◽  
Symmetric Cryptography ◽  
Cryptographic Algorithm ◽  
Encryption And Decryption ◽  
Long Time ◽  
International Data

The security and confidentiality of information becomes an important factor in communication, the use of cryptography can be a powerful way of securing the information, IDEA (International Data Encryption Algorithm) and WAKE (Word Auto Key Encryption) are some modern symmetric cryptography algorithms with encryption and decryption function are much faster than the asymmetric cryptographic algorithm, with the combination experiment IDEA and WAKE it probable to produce highly secret ciphertext and it hopes to take a very long time for cryptanalyst to decrypt the information without knowing the key of the encryption process.

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.

Sign in / Sign up

Export Citation Format

Share Document