scholarly journals ANALISIS PERBANDINGAN ALGORITMA SIMETRIS RIVEST CODE 5 DENGAN ALGORITMA SIMETRIS RIVEST CODE 6) (Studi Kasus : SMK Negeri Seluma)

2019 ◽  
Vol 4 (2) ◽  
Author(s):  
Rozali Toyib ◽  
Ardi Wijaya
Keyword(s):  
Execution Time ◽  
Hash Function ◽  
Storage Media ◽  
Encryption And Decryption ◽  
Secure Data ◽  
Computer Based ◽  
Message Digest ◽  
Set Up

Abstack: Data stored in storage media is often lost or opened by certain parties who are not responsible, so that it is very detrimental to the owner of the data, it is necessary to secure data so that the data can be locked so that it cannot be opened by irresponsible parties. The RC5 and RC6 algorithms are digestive massage algorithms or sometimes also known as the hash function which is an algorithm whose input is a message whose length is not certain, and produces an output message digest from its input message with exactly 128 bits in length. RC6 password is a protection for the user in securing data on a PC or computer. Based on the results of the conclusions taken: For the experiments carried out on the RC5 algorithm the execution time for the generation of keys (set-up key) is very fast, which is about 9-10 ns, a trial carried out on the RC6 algorithm execution time for the key generator (set up key ) faster than 10-11 ns. In the encryption and decryption process, the execution time depends on the size or size of the plaintext file. The larger the size of the plaintext file, the longer the execution time.Abstrak : Data yang tersimpan dalam media penyimpanan sering hilang atau dibuka oleh pihak-pihak tertentu yang tidak bertanggung jawab, sehinga merugikan sekali bagi pemilik data tersebut, untuk itu diperlukan suatu pengamanan data agar data tersebut dapat terkunci sehingga tidak dapat dibuka oleh pihak yang tidak bertanggung jawab.. Algoritma RC5 dan RC6 merupakan algoritma massage digest atau kadang juga dikenal dengan hash function yaitu suatu algoritma yang inputnya berupa sebuah pesan yang panjangnya tidak tertentu, dan menghasilkan keluaran sebuah message digest dari pesan inputnya dengan panjang tepat 128 bit. Password RC6 merupakan salah satu perlindungan kepada user dalam pengamanan data yang berada dalam sebuah Pc atau computer. Berdasarkan hasil pengujian diambil kesimpulan : Untuk uji coba yang dilakukan pada algoritma RC5 waktu eksekusi untuk pembangkitan kunci  (set up key) sangat cepat sekali yaitu sekitar  9-10 ns, uji coba yang dilakukan pada algoritma RC6 waktu eksekusi untuk pembangkit kunci (set up key) lebih cepat sekali yaitu 10-11 ns, Pada proses enkripsi dan dekripsi, waktu eksekusi tergantung dari besar atau kecilnya ukuran file plaintext.s emakin besar ukuran file plaintext maka semakin lama waktu eksekusinya.

scholarly journals Komparasi Waktu Algoritma RSA dengan RSA-CRT Base On Computer

2020 ◽  
Vol 2 (1) ◽  
pp. 13
Author(s):  
Nur Cayo Hendro Wibowo ◽  
Khotibul Umam ◽  
Albadru Muh Izul Khaq ◽  
Favian Agung Rizki
Keyword(s):  
Data Analysis ◽  
Product Development ◽  
Research And Development ◽  
Everyday Life ◽  
Execution Time ◽  
Rsa Algorithm ◽  
Encryption And Decryption ◽  
Long Time ◽  
Computer Based ◽  
Manual Calculation

<p align="center"><em>Cryptography is a branch of mathematics. Asymmetric algorithms such as RSA, including the type of cryptography that is more widely used to be implemented in everyday life because it has an algorithm that is not easy to be misused by others. However, the encryption and decryption process of RSA requires quite a long time. For this reason, RSA - CRT emerged. In this study a time comparison between the RSA algorithm and the RSA-CRT Base On Computer is done. The purpose of this study was to determine the execution time of the RSA-CRT algorithm using PHP.</em></p><p><em>This research uses the Research and Development or R&amp;D method, with the R&amp;D method created by the product development RSA-CRT algorithm application from UIN Walisongo Semarang based on computer. Based on the data analysis, the conclusion is that although the manual calculation of the RSA-CRT algorithm takes longer than the others in this case RSA. But have a faster time when using PHP.</em></p><p align="center"> </p>

scholarly journals A New Hash Function Based On The Hybrid Of Existing Message Digest Algorithms

2019 ◽  
Vol 8 (5C) ◽  
pp. 1435-1437
Keyword(s):  
Execution Time ◽  
Hash Function ◽  
Hash Functions ◽  
Ideal Condition ◽  
Basic Operation ◽  
Security Applications ◽  
Message Digest ◽  
Almost All ◽  
Modern Cryptography ◽  
The Ideal

Hash functions are modern cryptography that have been developed by cryptographers to make security applications for protecting the integrity of data. However, almost all hash functions are either unsecure or inefficient. Therefore, another better hash function is needed to be used as an alternative hash function. In this paper, authors aim to reexplore message digest algorithms then proposes a new hash function was developed to combine the optimized internal strength elements of the algorithms, namely MD5 and SHA-1 to obtain a basic operation of the new hash that overall enhance the security, but still efficient. The proposed new hash function has been evaluated and the results shown that its execution time are slightly shorter than the combination of (SHA-192+MD5) but almost as fast as with the combination of (SHA-1+MD5). In addition, its avalanche effects exceeds 50% (the ideal condition is around 50%). These are secure enough for security applications.

Realization of SMS4 Algorithm Based on Share Memory of the Heterogeneous Multi-Core Password Chip System

2014 ◽  
Vol 668-669 ◽  
pp. 1368-1373
Author(s):  
Lei Zhang ◽  
Ren Ping Dong ◽  
Ya Ping Yu
Keyword(s):  
Shared Memory ◽  
Resource Utilization ◽  
System Architecture ◽  
Execution Time ◽  
Experimental Results ◽  
Encryption And Decryption ◽  
Set Up

In order to meet the rapid demand of the modern cryptographic communication, heterogeneous multi-core password system architecture is set up based on shared memory in Xilinx XUP Virtex-II Pro chip in this paper. Under this architecture, the encryption and decryption of the SMS4 algorithm is realized fastly. Make a contrast with the homogeneous multi-core password system and the heterogeneous one-core password system’s performance in the execution time, throughput and resource utilization of the SMS4 algorithm.The experimental results show that the heterogeneous multi-core password system which based on shared memory has better performance.

Public-Key Encryption

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Elliptic Curve ◽  
Public Key Cryptography ◽  
Public Key ◽  
Public Key Encryption ◽  
Hybrid Encryption ◽  
Public Key Cryptosystems ◽  
Encryption And Decryption ◽  
Encryption Schemes ◽  
Hard Problems ◽  
Set Up

In this chapter, we introduce public-key encryption. We first consider the motivation behind the concept of public-key cryptography and introduce the hard problems on which popular public-key encryption schemes are based. We then discuss two of the best-known public-key cryptosystems, RSA and ElGamal. For each of these public-key cryptosystems, we discuss how to set up key pairs and perform basic encryption and decryption. We also identify the basis for security for each of these cryptosystems. We then compare RSA, ElGamal, and elliptic-curve variants of ElGamal from the perspectives of performance and security. Finally, we look at how public-key encryption is used in practice, focusing on the popular use of hybrid encryption.

scholarly journals Ordinal synchronization mark sequence and its steganography for a multi-link network covert channel

PLoS ONE ◽  
2021 ◽  
Vol 16 (6) ◽  
pp. e0252813
Author(s):  
Songyin Fu ◽  
Rangding Wang ◽  
Li Dong ◽  
Diqun Yan
Keyword(s):  
Hash Function ◽  
High Capacity ◽  
Superior Performance ◽  
Covert Channel ◽  
Correlation Test ◽  
Switching Patterns ◽  
Finite Set ◽  
Set Up ◽  
Network Covert Channel ◽  
Real Traffic

A multi-link network covert channel (MLCC) such as Cloak exhibits a high capacity and robustness and can achieve lossless modulation of the protocol data units. However, the mechanism of Cloak involving an arrangement of packets over the links (APL) is limited by its passive synchronization schemes, which results in intermittent obstructions in transmitting APL packets and anomalous link switching patterns. In this work, we propose a novel ordinal synchronization mark sequence (OSMS) for a Cloak framework based MLCC to ensure that the marked APL packets are orderly distinguishable. Specifically, a unidirectional function is used to generate the OSMS randomly before realizing covert modulation. Subsequently, we formulate the generation relation of the marks according to their order and embed each mark into the APL packets by using a one-way hash function such that the mark cannot be cracked during the transmission of the APL packet. Finally, we set up a retrieval function of the finite set at the covert receiver to extract the marks and determine their orders, and the APL packets are reorganized to realize covert demodulation. The results of experiments performed on real traffic indicated that the MLCC embedded with OSMS could avoid the passive synchronization schemes and exhibited superior performance in terms of reliability, throughput, and undetectability compared with the renowned Cloak method, especially under a malicious network interference scenario. Furthermore, our approach could effectively resist the inter-link correlation test, which are highly effective in testing the Cloak framework.

Hash Functions and Their Applications

2018 ◽  
pp. 66-77
Author(s):  
Kannan Balasubramanian
Keyword(s):  
Hash Function ◽  
Hash Functions ◽  
Digital Signatures ◽  
Message Authentication ◽  
Authenticated Encryption ◽  
Authentication Codes ◽  
Message Authentication Codes ◽  
Message Digest ◽  
Cryptographic Hash Functions

Cryptographic Hash Functions are used to achieve a number of Security goals like Message Authentication, Message Integrity, and are also used to implement Digital Signatures (Non-repudiation), and Entity Authentication. This chapter discusses the construction of hash functions and the various attacks on the Hash functions. The Message Authentication Codes are similar to the Hash functions except that they require a key for producing the message digest or hash. Authenticated Encryption is a scheme that combines hashing and Encryption. The Various types of hash functions like one-way hash function, Collision Resistant hash function and Universal hash functions are also discussed in this chapter.

scholarly journals Modified Advanced Encryption Standard Algorithm for Information Security

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1484 ◽  
Author(s):  
Oluwakemi Christiana Abikoye ◽  
Ahmad Dokoro Haruna ◽  
Abdullahi Abubakar ◽  
Noah Oluwatobi Akande ◽  
Emmanuel Oluwatobi Asani
Keyword(s):  
Execution Time ◽  
Advanced Encryption Standard ◽  
Avalanche Effect ◽  
Plain Text ◽  
Aes Algorithm ◽  
Cipher Text ◽  
Encryption And Decryption ◽  
To Come ◽  
Cryptographic Techniques ◽  
Modified Aes

The wide acceptability of Advanced Encryption Standard (AES) as the most efficient of all of the symmetric cryptographic techniques has further opened it up to more attacks. Efforts that were aimed at securing information while using AES is still being undermined by the activities of attackers This has further necessitated the need for researchers to come up with ways of enhancing the strength of AES. This article presents an enhanced AES algorithm that was achieved by modifying its SubBytes and ShiftRows transformations. The SubBytes transformation is modified to be round key dependent, while the ShiftRows transformation is randomized. The rationale behind the modification is to make the two transformations round key dependent, so that a single bit change in the key will produce a significant change in the cipher text. The conventional and modified AES algorithms are both implemented and evaluated in terms avalanche effect and execution time. The modified AES algorithm achieved an avalanche effect of 57.81% as compared to 50.78 recorded with the conventional AES. However, with 16, 32, 64, and 128 plain text bytes, the modified AES recorded an execution time of 0.18, 0.31, 0.46, and 0.59 ms, respectively. This is slightly higher than the results obtained with the conventional AES. Though a slightly higher execution time in milliseconds was recorded with the modified AES, the improved encryption and decryption strength via the avalanche effects measured is a desirable feat.

Sign in / Sign up

Export Citation Format

Share Document