Ripon Patgiri · 2022
Secure hash functions are widely used in cryptographic algorithms to secure against diverse attacks. A one-way secure hash function is used in the various research fields to secure, for instance, blockchain. Notably, most of the hash functions provide security based on static parameters and publicly known operations. Consequently, it becomes easier to attack by the attackers because all parameters and operations are predefined. The publicly known parameters and predefined operations make the oracle regenerate the key even though it is a one-way secure hash function. Moreover, the sensitive data is mixed with the predefined constant where an oracle may find a way to discover the key. To address the above issues, we propose a novel one-way secure hash algorithm, OSHA for short, to protect sensitive data against attackers. OSHA depends on a pseudo-random number generator to generate a hash value. Particularly, OSHA mixes multiple pseudo-random numbers to produce a secure hash value. Furthermore, OSHA uses dynamic parameters, which is difficult for adversaries to guess. Unlike conventional secure hash algorithms, OSHA does not depend on fixed constants. It replaces the fixed constant with the pseudo-random numbers. Also, the input message is not mixed with the pseudo-random numbers; hence, there is no way to recover and reverse the process for the adversaries.
Cited by 2
Fatma Kahri, Hassen Mestiri, Belgacem Bouallègue et al. · Indian Journal of Science and Technology · 2017
Background/Objectives: Among the powerful techniques against the protected hash functions (SHA) the method of fault injection attacks. For obtain the confidential information, the method consist to inject this attacks during the process of the hash algorithm. In literature, they proposed a many methods of countermeasures to secure the SHA implementation against these attacks. Methods/Statistical Analysis: In this paper, we proposed a new scheme of fault detection; this scheme is based on the combines of two redundancies named hybrid redundancy for the hash algorithm. The weaknesses and the strengths of our proposed method against the fault attacks are discussed. Findings: our schemes proposed reaches 99.999% fault coverage. Moreover, we are implemented our proposed scheme on Xilinx Virtex-5 and Virtex-II Pro FPGA. Its area overhead fault coverage, frequency and throughput degradation have been compared and it is shown that our proposed scheme allows a trade-off between the security of the SHA and hardware overhead. Application/Improvements: Compared to other work, our fault detection scheme has the important performances in terms of frequency, occupied slices, fault coverage and throughput. Keywords: Countermeasures, Fault Detection Schemes, Fault Attacks, Security, Secure Hash Algorithm (SHA)
Cited by 1Open access
G Moheshkumar, P. Meenakshi Devi, G. S. Karthick et al. · 2024
This work concentrates on applying a security-driven methodology utilizing the Secure Hash Algorithm – 256 (SHA – 256) to improve healthcare data analytics for safe patient monitoring. Materials and Methods: Two different groups have contributed to this project. Group 1 refers to associated with Long Short-term Memory, displaying one level of performance. Group 2 refers to the Secure Hash Algorithm – 256, demonstrating another degree of performance. Result: The healthcare system employs a hybrid cryptography system that includes Paillier and Elgamal to offer high security, scalability, reduced risk of insider attacks, and improved patient privacy with an accuracy rate of 81%. Conclusion: In order to improve patient privacy, mitigate insider threats, and secure wireless medical sensor networks, the proposed healthcare system combines distributed data storage with Elgamal and Paillier cryptosystems.
Cited by 4Open access
N.R. Ram Mohan, S. Padmalal, B. Chitra · International Journal of Business Intelligence and Data Mining · 2020
This paper proposes a green cloud multi-tenant trust authentication with secure hash algorithm-3 (GreenCloud-MTASHA3) scheme to eliminate the unauthorised tenant access. GreenCloud-MTASHA3 scheme provide security over the multiple tenant requests by referring the confidentiality, integrity and availability rate. Confidentiality refers to limiting the unauthorised tenant's green cloud data access using the additive homomorphic privacy property in proposed scheme. Additive homomorphic privacy property-based encryption function is developed to improve the privacy preserving level. To attain the integrity level between the tenant requests and green cloud server machine in GreenCloud-MTASHA3 scheme an encrypted trust data management process is carried out. Trustworthiness of tenant request is measured to maintain the consistency level on security with minimal computational time. The proposed scheme attains the confidentiality, integrity and availability rate on communicating task. Experiment is conducted on factors such as secure computation confidence, authorised tenant computational time and space taken on storing encrypted data.
Cited by 0
Lim , Yen Ruen · Universiti Sains Malaysia Institutional Repository (Universiti Sains Malaysia) · 2017
Secure data transfer has been the most challenging task for Internet of Things (IoT) devices. Data integrity must be ensured before and after the data transmission. Cryptographic hash functions are generally the basis of a secure network and used for data integrity verification. Cryptographic hash functions carried out processes such as identity verification, file integrity checking, secure key passing, and source code version control. Among all of the cryptography measures, Secure Hash Algorithm 3 (SHA-3) is the newest and secure cryptographic hash algorithm in the current electronic industry. In the previous Intel Microelectronic SHA-3 design, the synthesized area of the design is large due to many intermediate states and logics of the step mapping functions. The objective of this project is to design a synthesizable SHA-3 with 256-bits hash output and 1600-bits state array with lower area compared to Intel Microelectronic SHA-3. This research implements the SHA-3 in ways such that all the step mapping algorithms are logically combined to only use the input lanes of the state array to eliminate the intermediate logics and reduces the area size. Functionality verification is done using the test case provided by National Institute Standards and Technology (NIST). Two squeezing phases are tested to ensure the functionality of design. Final design of SHA-3 in this research can achieve area reduction by 12.57%, the cell count reduction by 24.35%, the critical path length reduction by 18.84%, and reduction of the clock cycles needed to generate the hash output by 75%. In conclusion, the SHA-3 with smaller area and higher performance has been designed and is possible to cater the needs of IoT application.
Cited by 0
R. Garcia, Ignacio Algredo‐Badillo, Miguel Morales‐Sandoval et al. · Computers & Electrical Engineering · 2013
Cited by 47
Rezky M. Nasution · Bulletin of Computer Science Research · 2022
Audio file is a means of information from one person to another. Audio files are very vulnerable to fraud, eavesdropping or data theft by irresponsible parties. In order to maintain the security of audio files, this can be done by using cryptographic techniques. Cryptography is one of the data security methods that can be used to maintain data authenticity, data confidentiality, and the authenticity of data transmission. SHA stands for Secure Hash Algorithm is a standard hash function published by NIST (National Institute of Standards and Technology). SHA is published with a digest size of 512 bits. SHA-1 will output 160 bits of the string and the output string is called a message digest. The length of the message digest can range from 160 to 512 bits depending on the algorithm. This study describes the security process for detecting the authenticity of audio files using the SHA-1 method in the form of detection so that confidential audio sent via public telecommunications cannot be changed or modified by unauthorized persons or unauthorized persons. This is done as an effort to minimize acts of fraud, hoaxes, or misuse of audio files.
Cited by 1Open access
Ho-Jin Choi, SeongJun Choi, Seog Chung Seo · Electronics · 2024
Currently, cryptographic hash functions are widely used in various applications, including message authentication codes, cryptographic random generators, digital signatures, key derivation functions, and post-quantum algorithms. Notably, they play a vital role in establishing secure communication between servers and clients. Specifically, servers often need to compute a large number of hash functions simultaneously to provide smooth services to connected clients. In this paper, we present highly optimized parallel implementations of Lightweight Secure Hash (LSH), a hash algorithm developed in Korea, on server sides. To optimize LSH performance, we leverage two parallel architectures: AVX-512 on high-end CPUs and NVIDIA GPUs. In essence, we introduce a word-level parallel processing design suitable for AVX-512 instruction sets and a data parallel processing design appropriate for the NVIDIA CUDA platform. In the former approach, we parallelize the core functions of LSH using AVX-512 registers and instructions. As a result, our first implementation achieves a performance improvement of up to 50.37% compared to the latest LSH AVX-2 implementation. In the latter approach, we optimize the core operation of LSH with CUDA PTX assembly and apply a coalesced memory access pattern. Furthermore, we determine the optimal number of blocks/threads configuration and CUDA streams for RTX 2080Ti and RTX 3090. Consequently, in the RTX 3090 architecture, our optimized CUDA implementation achieves about a 180.62% performance improvement compared with the initially ported LSH implementation to the CUDA platform. As far as we know, this is the first work on optimizing LSH with AVX-512 and NVIDIA GPU. The proposed implementation methodologies can be used alone or together in a server environment to achieve the maximum throughput of LSH computation.
Cited by 3Open access
Jeremiah Blocki, Anupam Datta · arXiv (Cornell University) · 2015
An adversary who has obtained the cryptographic hash of a user's password can\nmount an offline attack to crack the password by comparing this hash value with\nthe cryptographic hashes of likely password guesses. This offline attacker is\nlimited only by the resources he is willing to invest to crack the password.\nKey-stretching tools can help mitigate the threat of offline attacks by making\neach password guess more expensive for the adversary to verify. However,\nkey-stretching increases authentication costs for a legitimate authentication\nserver. We introduce a novel Stackelberg game model which captures the\nessential elements of this interaction between a defender and an offline\nattacker. We then introduce Cost Asymmetric Secure Hash (CASH), a randomized\nkey-stretching mechanism that minimizes the fraction of passwords that would be\ncracked by a rational offline attacker without increasing amortized\nauthentication costs for the legitimate authentication server. CASH is\nmotivated by the observation that the legitimate authentication server will\ntypically run the authentication procedure to verify a correct password, while\nan offline adversary will typically use incorrect password guesses. By using\nrandomization we can ensure that the amortized cost of running CASH to verify a\ncorrect password guess is significantly smaller than the cost of rejecting an\nincorrect password. Using our Stackelberg game framework we can quantify the\nquality of the underlying CASH running time distribution in terms of the\nfraction of passwords that a rational offline adversary would crack. We provide\nan efficient algorithm to compute high quality CASH distributions for the\ndefender. Finally, we analyze CASH using empirical data from two large scale\npassword frequency datasets. Our analysis shows that CASH can significantly\nreduce (up to $50\\%$) the fraction of password cracked by a rational offline\nadversary.\n
Cited by 0Open access
Konstantinos Aisopos, Athanasios Kakarountas, Harris E. Michail et al. · 2006
A design approach to create small-sized high-speed implementation of the new version of secure hash algorithm is proposed. The resulted design can be easily embedded to operate in HMAC IP cores, providing a high degree of security. The proposed implementation does not introduce significant area penalty, compared to other competitive designs. However the achieved throughput presents an increase compared to commercially available IP cores that range from 43%-1830%.
Cited by 8
Guoping Zhang, Mande Xie · Information Technology Journal · 2014
Cited by 0Open access
Yibo Huang, An Li, Qiuyu Zhang · ACM Transactions on Asian and Low-Resource Language Information Processing · 2025
With the continuous growth of dimensions in retrieval systems, only a few data points are distributed near the center (empty space phenomenon), and the distance between data points in high-dimensional space is nearly equal (dimensional effect), resulting in high complexity and low accuracy in retrieval. Aiming at the preceding problems, this article designs a speech secure hash retrieval scheme. In this scheme, the spectral subband centroids of speech are extracted to generate the feature vector, then the biometric template index is established by KDTree classification, and the specific SHA256-Ushiki chaotic encryption algorithm key is allocated to each index. The security framework is constructed according to the cancelable biometric template generated by the combination of classification and distribution key, and the binary hash vector is generated, then the hash vector is encrypted. Experimental results show that through the establishment of the KDTree cancelable biometric template index, the super rectangular region of the K -dimensional space is constructed, which effectively solves the empty space phenomenon and the dimensional effect. Through the KDTree nearest neighbor search, the algorithm reduces the number of matches between classes, which effectively reduces computational complexity and accuracy problems. The tampering comparison of mobile terminal realizes the content verifiable retrieval. The speech encryption effectively prevents the leakage of plaintext and ensures security of the speech storage and transmission process.
Cited by 1Open access
Nur Annisa Fitriani, Aminuddin Aminuddin, Sofyan Arifianto · Jurnal Repositor · 2024
Sebuah data atau dokumen yang dikirimkan melalui internet sangat rentan terhadap serangan atau modifikasi serta sangat sulit untuk membuktikan keaslian data atau dokumen, maka dengan perkembangan sistem keamanan terbentuklah sebuah mekanisme kriptografi yang digunakan untuk memverifikasi keaslian dan kebenaran dari sebuah data yang disebut dengan tanda tangan digital. Tanda tangan digital seringkali dipadukan dengan fungsi hash untuk membuat tanda tangan pada suatu data. Algoritma tanda tangan yang sering digunakan adalah Diffle-Helman Digital Signature Algorithm dan lebih dikenal sebagai Digital Signature Algorithm (DSA). Algoritma Digital Signature Algorithm (DSA) dikembangkan menjadi algoritma Elliptic Curve Digital Signature Algorithm (ECDSA) yang menggunakan elliptic curve. Penelitian ini Melakukan perbandingan kinerja algoritma tanda tangan digital Elliptic Curve Digital Signature Algorithm (ECDSA) menggunakan fungsi hash yang berbeda dan menganalisis performa waktu proses dari awal hingga akhir antara algoritma Elliptic Curve Digital Signature Algorithm (ECDSA) menggunakan fungsi hash SHA-1 dan algoritma Elliptic Curve Digital Signature Algorithm (ECDSA) mengunakan fungsi hash Keccak. Parameter pengujian yang dilakukan membandingkan algoritma Elliptic Curve Digital Signature Algorithm (ECDSA) fungsi hash SHA-1 dan Keccak pada saat proses pembangkitan kunci (key generation), tahap penandatanganan (signature generation), dan tahap verifikasi tanda tangan digital (verifying).
Cited by 1Open access
Haider M. Al-Mashhadi, Hala Bahjat Abdulwahab, Rehab F. Hassan · 2014
Wireless sensor networks (WSNs) are used in many applications to gather sensitive information which is then forwarded to an analysis center. Resource limitations have to be taken into account when designing a WSN infrastructure. Authentication in WSNs is critical, as they are often deployed unattended in hostile environments and must transmit information over unsecured mediums. However, the cost of performing cryptographic operations is an extremely limiting factor because sensor devices and related equipment are constrained by storage and computational ability. Hash functions are the most widespread among all Authentication primitives, and are currently used in multiple cryptographic schemes and in security protocols. This paper presents a new Secure Hash Algorithm called (2AMD-160) which uses a famous structure of hash algorithm given by the MIT Laboratory for Computer Science and RSA Data Security, Inc. To demonstrate the effectiveness of 2AMD-160 in terms of security and execution time, we compare our approach with two methods namely, MD5 and SHA1 hash function algorithms. Simulation results demonstrate that the execution time and the security achieved by the proposed method are more effective than the MD5 and SHA1.
Cited by 13
Shuqin Zhu, Congxu Zhu, Wenhong Wang · Entropy · 2018
In order to overcome the difficulty of key management in "one time pad" encryption schemes and also resist the attack of chosen plaintext, a new image encryption algorithm based on chaos and SHA-256 is proposed in this paper. The architecture of confusion and diffusion is adopted. Firstly, the surrounding of a plaintext image is surrounded by a sequence generated from the SHA-256 hash value of the plaintext to ensure that each encrypted result is different. Secondly, the image is scrambled according to the random sequence obtained by adding the disturbance term associated with the plaintext to the chaotic sequence. Third, the cyphertext (plaintext) feedback mechanism of the dynamic index in the diffusion stage is adopted, that is, the location index of the cyphertext (plaintext) used for feedback is dynamic. The above measures can ensure that the algorithm can resist chosen plaintext attacks and can overcome the difficulty of key management in "one time pad" encryption scheme. Also, experimental results such as key space analysis, key sensitivity analysis, differential analysis, histograms, information entropy, and correlation coefficients show that the image encryption algorithm is safe and reliable, and has high application potential.
Cited by 122Open access
Ferry Antonius Simamora · 2011
Cited by 0
Huan Lan, Ruisong Ye · 2019 2nd International Conference on Safety Produce Informatization (IICSPI) · 2019
A novel image encryption algorithm based on secure hash function and Galois filed is proposed in this paper. We design a keystream generator based on SHA-512 for creating a matrix validated for the randomness by NIST tests. This matrix is used as a key matrix of the proposed encryption and decryption algorithms. Applying the multiplication operations between plain-image and key matrix on Galois field GF(2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">8</sup> ) to conceal pixels information. Two scrambling matrices are generated by ascending the rows and columns of the key matrix, respectively, to change the positions of pixels. Experimental simulations and security analysis demonstrate that the proposed algorithm has high security and sensitivity to resist brute-force attacks, statistical attack, differential attack, etc.
Cited by 2
Yopi Robi Milenium, - · Repository at Universitas Pendidikan Indonesia (Universitas Pendidikan Indonesia) · 2020
Sekarang ini, membuat dokumen tidak diproduksi hanya berupa cetakan melainkan dapat disajikan juga dalam bentuk digital. Keamanan suatu dokumen digital sangat perlu diperhatikan, karena tidak menutup kemungkinan pada saat proses pengiriman dokumen tersebut telah terjadi campur tangan pihak ketiga yang tidak bertanggung jawab yang mengubah atau memalsukan dokumen tersebut. Penelitian ini bertujuan untuk menjelaskan bagaimana prosedur autentikasi dokumen digital menggunakan kombinasi dua algoritma, yaitu Secure Hash Algorithm-256 dan ElGamal Signature Scheme serta merancang program aplikasinya dengan bahasa pemrograman Python. Hasil dari penelitian menunjukkan bahwa kombinasi algoritma Secure Hash Algorithm-256 dan ElGamal Signature Scheme dapat dirancang menjadi sebuah program aplikasi untuk autentikasi dokumen digital. Program aplikasi ini dapat mempermudah pengguna untuk membuat tanda tangan digital, serta melakukan autentikasi dokumen digital. \n \nNowadays, document is not only produced in printed form, but also can be presented in digital form. The security of digital document really needs to be considered, because it does not rule out the possibility that during the process of sending document there has been interference by a third party who is not responsible for changing or falsifying the document. This research aims to explain how procedure uses two algorithms, namely Secure Hash Algorithm-256 and the ElGamal Signature Scheme and designing the application program with the Python programming language. The result of this research indicated that the combination of Secure Hash Algorithm-256 and the ElGamal Signature Scheme can be designed to be an application program for digital document authentication. This application program can make it easier for users to create digital Signatures, as well as perform digital document authentication.
Cited by 0Open access
Neetesh Tiwari, Amit Sinhal · 2015
Abstract — “One way hash functions ” plays an important role in data integrity, message authentication, and digital signature in modern information security. This paper proposed a fast one-way hash function to optimize the time delay with strong collision resistance, assures a good compression and one-way resistance. It is based on the standard secure hash function (SHA-1) algorithm. The analysis indicates that the proposed algorithm which we call OSHA is time efficient and proven for better compression function.
Cited by 0
International Journal of Recent Trends in Engineering and Research · 2018
Cited by 0Open access