Performance Calculation of Hash Sha-1 in Embedded System Using Arduino

The development of digital electronic devices that can communicate with each other causing the need for data security or data protection. However, in the many digital electronic devices are not equipped with security or protection of the data. In this study has the main objective to design an embedded system that can be added to the digital electronic devices to provide security or protection of the data. As the initial phase of the study, in this paper have measured performance data security in embedded systems with Arduino using a cryptographic algorithm SHA-1 hash function. Performance of SHA-1 hash calculation using linear regression approach of measurement results show for 1 byte of data takes time 2,505 ms. Each additional 1 byte of data calculation time hash function SHA-1 increased 0.0715 ms

Cohomological properties of multinorm-one tori

In this paper we investigate the Tate--Shafarevich group Sha^1(k, T) of a multinorm-one torus $T$ over a global field $k$. We establish a few functorial maps among cohomology groups and explore their relations. Using these properties and relations we obtain a few basic structural results for Sha^1(k, T) and extend a few results of Bayer-Fluckiger--Lee--Parimala [Adv. in Math., 2019] to some more general multinorm-one tori. We also give a uniform proof of a result of Demarche--Wei for a criterion of the vanishing of Sha^1(k, T), and of the main result of Pollio [Pure App. Math. Q., 2014] for the case where the \'etale $k$-algebra in question is a product of two abelian extensions. Moreover, we improve the explicit description of Sha^1(k, T) in Lee [J. Pure Appl. Alg., 2022] by removing an intersection condition.Comment: 26 pages, comments welcom

АНАЛИЗ РЕАЛИЗАЦИЙ АЛГОРИТМА КРИПТОГРАФИЧЕСКОГО ХЭШИРОВАНИЯ SHA-1 НА КОНВЕЙЕРНЫХ СХЕМАХ

An analysis of hardware implementations of the cryptographic hash function SHA-1 based on pipeline circuits with different numbers of logic levels was made in this paper. The hardware implementations of the hash function SHA-1 for high performance applications were described.Проведен анализ аппаратных реализаций алгоритма криптографического хэширования SHA-1 на конвейерных схемах с различным количеством уровней логики. Рассмотрены аппаратные реализации алгоритма SHA-1 для приложений, требующих высокой производительности

Enhancement Of Manchester Encoding Technique By Combining IT With A Hash Function

This study proposes a combination of Manchester encoding technique and SHA-1 hash function, to provide a secure data transmission over a client/server environment by sending the message digest along with the message, and compare it with a new generated message digest on the server. Hash function improves integrity to the transmitted message. Manchester encoding technique is chosen to encode the transmitted message because it encodes both data and clocks into a form of synchronous bit stream. The modification of the message during the transmission, results in changing the message digest. This shows that including the SHA-1 hash function with Manchester encoding technique the integrity of the data can be accomplished

High Speed and Throughput Evaluation of SHA-1 Hash Function Design with Pipelining and Unfolding Transformation Techniques

In recent years, designing of SHA-1 hash function has become popular because it was important in security design application. One of the applications of SHA-1 hash function was HMAC where the architecture of SHA-1 needed to be improved in terms of speed and throughput in order to obtain the highperformance design. The objective of this project was to design high speed and throughput evaluation of SHA-1 hash function based on a combination of pipelining and unfolding techniques. By using both techniques in designing the architecture of SHA- 1 design, the speed of SHA-1 hash function can be increased significantly as well as throughput of the design. In this paper, five proposed SHA-1 architectures were designed with different stages of pipelining such as 1, 4 and 40 stages. The results showed the high-speed design of SHA-1 design can be obtained by using 40 stages pipelining with unfolding factor two. This design provided a high-speed implementation with maximum frequency of 308.17 MHz on Arria II GX and 458.59 MHz on Virtex 5 XC5VLX50T. Furthermore, the throughput of the design also increased about 150.269 Gbps and 223.618 Gbps on Arria II GX and Virtex 5 XC5VLX50T respectively. Thus, highspeed design of SHA-1 hash function was successfully obtained which can give benefit to society especially in security system data transmission and other types of hash functions

MAN J IMPLEMENTASI MAC DAN RC6 UNTUK MENDETEKSI PERUBAHAN FILE PADA PROSES DUPLIKASI FILE

Seiring dengan ilmu pengetahuan dan teknologi yang semakin berkembang, keamanan data juga semakin rentan terhadap tindak kejahatan. Kejahatan yang ada memiliki banyak tipe yang beragam, dimulai dari pemalsuan data, duplikasi data tanpa seijin pemilik, serta pemalsuan hak milik. Perlu adanya teknik yang mampu memeriksa terjadinya perubahan dalam proses duplikasi. Dalam ilmu kriptografi terdapat suatu mekanisme untuk memeriksa integritas terhadap sebuah file, yaitu dengan teknik MAC (Message Authentication Code). MAC menghasilkan sebuah nilai unik yang dapat diperoleh dari file yang selanjutnya disisipkan ke dalam file tersebut sebelum diduplikasi. Pendeteksian perubahan dilakukan dengan membandingkan MAC yang telah disisipkan dengan MAC hasil generasi dari potongan file tanpa MAC. MAC dapat diimplementasikan dengan menggunakan fungsi kriptografi hash SHA-1 dan algoritma kriptografi RC6. SHA-1 digunakan untuk mengenerate kunci sebelum menghasilkan nilai MAC. RC6 digunakan untuk mengacak nilai MAC sebelum disisipkan dengan tujuan untuk meningkatkan keamanan. Hasil penerapan dapat berupa file yang telah disisipi MAC yang terenkripsi algoritma kriptografi RC6 dan dapat pula informasi jika file tetap atau mengalami perubahan

Year 2010 Issues on Cryptographic Algorithms

In the financial sector, cryptographic algorithms are used as fundamental techniques for assuring confidentiality and integrity of data used in financial transactions and for authenticating entities involved in the transactions. Currently, the most widely used algorithms appear to be two-key triple DES and RC4 for symmetric ciphers, RSA with a 1024-bit key for an asymmetric cipher and a digital signature, and SHA-1 for a hash function according to international standards and guidelines related to the financial transactions. However, according to academic papers and reports regarding the security evaluation for such algorithms, it is difficult to ensure enough security by using the algorithms for a long time period, such as 10 or 15 years, due to advances in cryptanalysis techniques, improvement of computing power, and so on. To enhance the transition to more secure ones, National Institute of Standards and Technology (NIST) of the United States describes in various guidelines that NIST will no longer approve two-key triple DES, RSA with a 1024-bit key, and SHA-1 as the algorithms suitable for IT systems of the U.S. Federal Government after 2010. It is an important issue how to advance the transition of the algorithms in the financial sector. This paper refers to issues regarding the transition as Year 2010 issues in cryptographic algorithms. To successfully complete the transition by 2010, the deadline set by NIST, it is necessary for financial institutions to begin discussing the issues at the earliest possible date. This paper summarizes security evaluation results of the current algorithms, and describes Year 2010 issues, their impact on the financial industry, and the transition plan announced by NIST. This paper also shows several points to be discussed when dealing with Year 2010 issues.Cryptographic algorithm; Symmetric cipher; Asymmetric cipher; Security; Year 2010 issues; Hash function