Bhaskar Prakash Kosta, Pasala Sanyasi · International Journal of Advanced Computer Science and Applications · 2021
Cryptographic hash function assumes a fundamental job in numerous pieces of cryptographic algorithm and conventions, particularly in authentication, non-repudiation and information trustworthiness administrations. A cryptographic hash work takes a commitment of optional tremendous size message and conveys a fixed little size hash code as a yield. In the proposed work SSLHA-160 (a strong and secure lightweight cryptographic hash algorithm), each 512-digit square of a message is first diminished to 256-bit. A cryptographic hash work takes a contribution of discretionary enormous size message and delivers a fixed little size hash code as a yield. In the proposed work SSLHA-160 (A strong and secure lightweight cryptographic hash algorithm), each 512- digit square of a message is first diminished to 256-bit and afterward partitioned into eight equivalent block of 32 pieces each and each 32-cycle block is additionally separated into two sub-block of 16-piece each. These two sub-blocks go about as two purposes of an elliptic curve, which are utilized for computing another point which is of 16 pieces. The new point esteems are thusly handled to produce message digest. SSLHA-160 is easy to develop, simple to actualize and displays solid torrential slide impact (avalanche), when contrasted with SHA1, RIPEMD160 and MD5.
Cited by 4Open access
Devi Thiyagarajan, R. Ganesan · International Journal of Technology · 2015
Cited by 1
Kisakye Diana Michelle, Ocen Gilbert Gilibrays, Odongtoo Godfrey · Journal of Independent Studies and Research - Computing · 2024
Text steganography is a method used to hide confidential messages in a message's text without arousing suspicion. This technique has been used in the past, from ancient Greece's scytale tool to modern methods such as Lempel-Ziv-Welch compression and Reflection Symmetry. As digital data continues to be transmitted between devices, it is vulnerable to attack, making text steganography an essential tool for securing data. Over the years, various techniques have been used to achieve this, including substitution, modification, and embedding techniques. However, text steganography still presents challenges, such as easy detection and the trade-off between hiding capacity and quality of the covered medium. Cryptography has been suggested to improve security by encrypting the original message into a cypher text. However, it cannot withstand the advancements in technology that can break cryptographic methods. Therefore, combining cryptography and steganography is always advisable because steganography increases the security of the carrier message as encryption (Cryptography) provides confidentiality. This study explores the various techniques used in text steganography and the challenges present in them to develop a high hiding capacity, robust, and high-quality covered medium text steganography technique that combines both Steganography and Cryptography using a condition Logic and Secure Hashing algorithm.
Cited by 1Open access
Sariyun Naja Anwar, Widiyanto Tri Handoko, Eka Ardhianto et al. · Engineering and Technology Journal · 2024
This research aims to enhance message security by developing a Light Weight Parallel Digit Arithmetic of Covertext (PDAC) encryption-based authentication scheme that adopts the Secure Hash Algorithm (SHA) algorithm to ensure message integrity and authentication aspects. Through experiments, tests are conducted on two main aspects: entropy and collision resistance. The experimental results show that the average entropy generated reaches 4.992, or 62.41% of the optimal entropy value. While this result shows a good randomness, there is room for further improvement to reach the optimal level. Collision resistance testing using Google's SHAttered tool showed very positive results. No collisions were found in any of the samples tested, indicating that the PDAC scheme combined with SHA can maintain message integrity well. This indicates that PDAC has strong resistance to hash-based attacks, ensuring that messages remain authentic and safe from manipulation. Thus, this study concludes that PDAC schemes offer a good balance between efficiency, security, and low power consumption, making it suitable for use in resource-constrained environments such as IoT devices and mobile applications
Cited by 0Open access
Devi Thiyagarajan, R. Ganesan · SHILAP Revista de lepidopterología · 2015
Data owners use the huge space offered by ‘Cloud’ Computing for storage of data and also for carrying out computations. To eliminate the burden of storing file locally, cloud stores them on remote servers using virtualization concepts. Therein arises one of the major issues in the field of cloud computing: security. Data owners lack in having direct control over files stored in the cloud and consequently, the problem of data security arises. An efficient scheme to provide data security, while storing data in the cloud has been proposed which makes use of Hyperelliptic curve cryptography (HECC) for encryption and decryption and Secure Hash Algorithm-3 (SHA-3) for data integrity verification. Implementation results clearly illustrate that HECC remains as a good alternative asymmetric key technique rather than ECC and RSA when securing documents in cloud.
Cited by 0Open access
Sariyun Naja, Anwar, Widiyanto Tri, Handoko, Eka, Ardhianto et al. · Zenodo (CERN European Organization for Nuclear Research) · 2024
This research aims to enhance message security by developing a Light Weight Parallel Digit Arithmetic of Covertext (PDAC) encryption-based authentication scheme that adopts the Secure Hash Algorithm (SHA) algorithm to ensure message integrity and authentication aspects. Through experiments, tests are conducted on two main aspects: entropy and collision resistance. The experimental results show that the average entropy generated reaches 4.992, or 62.41% of the optimal entropy value. While this result shows a good randomness, there is room for further improvement to reach the optimal level. Collision resistance testing using Google's SHAttered tool showed very positive results. No collisions were found in any of the samples tested, indicating that the PDAC scheme combined with SHA can maintain message integrity well. This indicates that PDAC has strong resistance to hash-based attacks, ensuring that messages remain authentic and safe from manipulation. Thus, this study concludes that PDAC schemes offer a good balance between efficiency, security, and low power consumption, making it suitable for use in resource-constrained environments such as IoT devices and mobile applications
Cited by 0Open access
Adonis, Mthomasebe · Figshare · 2024
Creation of node addresses using the Chord algorithm. Secure Hash Algorithm (SHA-1) one is used to hash an IP address and a port number
Cited by 0Open access
Ilyas Mahfud, Putranto Hadi Utomo, Bowo Winarno · AIP conference proceedings · 2025
Cited by 0
Paris Kitsos, Nicolas Sklavos · 2010
The most well known and officially used hash function is the Secure Hash Algorithm-1 (SHA-1) and Secure Hash Algorithm-2 (SHA-2). In recent years serious attacks have been published against SHA-1. This led the National Institute of Standard and Technology (NIST) to organize an effort to develop a modern and more secure hash algorithms through a hash function competition for usage in the following years in the near future. The selected new hash function will be called SHA-3. This paper deals with the hardware implementation efficiency of SHA-3 candidates, which is one of the most critical issues, regarding the adoption of the SHA-3 standard. Comparisons, in terms of hardware terms are given in detail, through this work.
Cited by 10
Nicolas Sklavos · IEEE Latin America Transactions · 2012
The most well-known and officially used hash function is the Secure Hash Algorithm-1 (SHA-1) and Secure Hash Algorithm-2 (SHA-2). In recent years serious attacks have been published against SHA-1. This led the National Institute of Standard and Technology (NIST) to organize an effort to develop a modern and more secure hash algorithms through a hash function competition for usage in the following years in the near future. The selected new hash function will be called SHA-3. This keynote talk deals with the hardware implementation efficiency of SHA-3 candidates, which is one of the most critical issues, regarding the adoption of the SHA-3 standard. Comparisons, in terms of hardware terms are given in detail, throughout this talk.
Cited by 12
Santi Sulastri · 2019
Perkembangan teknologi dan informasi yang sangat pesat membawa dampak positif yaitu kemudahan dalam berbagi informasi melalui jaringan komputer. Namun pada saat yang bersamaan juga menimbulkan dampak negatif yaitu informasi yang dibagi dapat diketahui atau diakses oleh pihak yang tidak bertanggung jawab. Maka dibutuhkan suatu mekanisme pengamanan informasi / data.
Penelitian ini mengusulkan sebuah mekanisme pengamanan informasi / data dengan menggunakan teknik kriptografi yaitu dengan menambahkan metode enkripsi pada suatu sistem berbasis web. Terdapat berbagai macam jenis enkripsi yang dapat digunakan, misalnya MD5 dan SHA-256. Namun penggunaan MD5 saja atau SHA-256 saja dinilai tidak cukup aman. Penelitian ini bertujuan untuk mengembangkan metode kolaborasi dari MD5 dan SHA-256. Enkripsi diterapkankan pada password pengguna pada sistem login web.
Hasil simulasi dapat diuji dengan mengukur ketahanan terhadap serangan brute force dan besar nilai Avalanche effect. Dari hasil pengujian yang dilakukan yaitu dengan menggunakan software penyerang CrackStation dan Rainbow Table hasil penyandian cukup aman dari serangan brute force. Dari pengujian Avalanche effect diperoleh hasil dengan nilai AE sebesar 71% yang artinya hasil penyandian cukup baik.
Cited by 1
R. Roshdy, M. Fouad, M. Aboul-dahab · 2014
A cryptographic hash function has an important role in cryptography to achieve certain security goals such as authenticity, digital signatures, digital time stamping, and entity authentication. They are also strongly related to other important cryptographic tools such as block ciphers and pseudorandom functions.Due to the previous merits we present a proposal for a new secure hash algorithm based on the combination of some functions of SHA-256 (Secure Hash Algorithm 256)-with its message expansion modification- and MD5 (Message Digest 5) based on double-Davis-Mayer scheme to overcome the weakness existing in these functions. The proposal hash algorithm has been designed to satisfy the different levels of enhanced security and to resist the advanced hash attacks by increasing the complexity degree of the proposed hash algorithm. The security analysis of the proposed hash algorithm is compared to SHA256 and gives more security and highly acceptable results as shown in our security results and discussions.
Cited by 0
Rojali Rojali, Zulfany Erlisa Rasjid, Justin Cliff Matthew · 2022 International Conference on Informatics, Multimedia, Cyber and Information System (ICIMCIS) · 2022
The use of digital images is increasingly widespread currently. There is a need for security in digital photos. Cryptography is a technique that can be applied to secure data. In addition to safety, data integrity also needs to be considered to anticipate the image being manipulated. The hash function is a technique that can be used to determine data authentication. In this study, the Rail Fence Cipher and Myszkowski algorithms were used for the encryption and decryption of digital images, as the Secure Hash Algorithm (SHA-256) algorithm. Rail Fence Cipher Algorithm is a transposition algorithm that is quite simple but still vulnerable. It is combined with the Myszkowski Algorithm, which has a high level of complexity with a simple key. Secure Hash Algorithm (SHA-256) is a hash function that accepts an input limit of fewer than 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∧</sup> 64 bits and produces a fixed hash value of 256 bits. The tested images vary based on image resolution and can be encrypted and decrypted well, with an average MSE value of 4171.16 and an average PSNR value of 11.96 dB. The hash value created is also unique. Keywords—Cryptography, Hash Function, Rail Fence Cipher, Myszkowski, SHA-256, Digital image.
Cited by 3
Seddik Abdelalim, Abdelkarim Lkoiaza, Asmaa Cherkaoui et al. · 2025
As opposed to the different methods used in the preprocessing and concatenation steps associated with Secure Hash Algorithm 1 (SHA-1), we treat here the case of Secure Hash Algorithm 2 (SHA-2) that is still unbreakable up to the present. In addition, before its implementation in Python, we first explain the difference between the two approaches.
Cited by 0
Iv Scott, F. Midkiff · 2014
This paper focuses on characterizing the overhead of IP Security (IPSec) for email and web applications using a set of test bed configurations. The different confligurations are implemented using both wireline and wireless netwrk links. n e testing considers different combinations of authentication algorithms and authentication protocols. Authentication algorithms
Cited by 0
Zhigang Xu, J Baker, Su-Bong Ryu · Medical Physics · 2016
Purpose: To develop an efficient way to verify that patient plan and dose information does not change during an Eclipse/Aria database version upgrade. Methods: Eclipse Scripting Application Programming Interface (ESAPI) was used to create a script to retrieve plan information from the Eclipse database before and after the database upgrade for each patient on treatment. Using Cryptographic Secure Hash Algorithm (SHA256), fixed length digest hash values are generated from the plan parameters for each patient. The script is run twice to create two hash values, HV before and HV after , before and after the Aria database upgrade. Separately, the delivered dose information for all patients was verified by comparing two hash values based on a crystal report summary for all patients treated within a date range. Lastly, an Excel macro is used to import the generated hash values for comparison. Results: If HV before is the same as HV after , then the database is considered unchanged based on the collision resistant property of the cryptographic hash function. Otherwise, we conclude that the patient data may have been altered during the upgrade process. In testing the process, all patients passed the comparison. Without using this method, the time to verify a single patient's information was about five minutes. This would result in five hours of work for sixty patients. With this method, we can verify sixty patients in less than thirty minutes before and after the upgrade. This results in time savings of four hours. Conclusion: An automatic database verification method has been developed using ESAPI, SHA‐256 Cryptographic Hash Algorithm and Microsoft Excel. We found that the time to verify the database for sixty patients is less than one hour. The scripts can be integrated into Eclipse or can be run as a stand‐alone executable program for a more automated process and increased time savings.
Cited by 0
S. Santesson, N. Pope · 2010
This document updates RFC 3161.It allows the use of ESSCertIDv2, as defined in RFC 5035, to specify the hash of a signer certificate when the hash is calculated with a function other than the Secure Hash Algorithm (SHA-1).
Cited by 2
2002
SHA-384, and SHA-512- for computing a condensed representation of electronic data (message). When a message of any length &lt; 2 64 bits (for SHA-1 and SHA-256) or &lt; 2 128 bits (for SHA-384 and SHA-512) is input to an algorithm, the result is an output called a message digest. The message digests range in length from 160 to 512 bits, depending on the algorithm. Secure hash algorithms are typically used with other cryptographic algorithms, such as digital signature algorithms and keyed-hash message authentication codes, or in the generation of random numbers (bits). The four hash algorithms specified in this standard are called secure because, for a given algorithm, it is computationally infeasible 1) to find a message that corresponds to a given message digest, or 2) to find two different messages that produce the same message digest. Any change to a message will, with a very high probability, result in a different message digest. This will result in a verification failure when the secure hash algorithm is used with a digital signature algorithm or a keyed-hash message authentication algorithm. This standard supersedes FIPS 180-1, adding three algorithms that are capable of producing larger message digests. The SHA-1 algorithm specified herein is the same algorithm that was
Cited by 0
Rashid Sheikh, Rashid Sheikh, Durgesh Kumar Mishra et al. · Journal of University of Shanghai for Science and Technology · 2021
The ideal Secure Multiparty Computation (SMC) model deploys a Trusted Third Party (TTP) which assists in secure function evaluation. The participating joint parties give input to the TTP which provide the results to the participating parties. The equality check problem in multiple party cases can be solved by simple architecture and a simple algorithm. In our proposed protocol Equality Hash Checkin ideal model, we use a secure hash function. All the parties interested to check equality of their data supply hash of their data to the TTP which then compared all hash values for equality. It declares the result to the parties.
Cited by 0Open access
Christian Rechberger, Vincent Rijmen, Nicolas Sklavos · IEEE Security & Privacy · 2006
In light of recent breakthroughs on the cryptanalysis of hash functions, the US National Institute for Standards and Technology (NIST) organized a workshop to solicit input on the current status of the Secure Hash Algorithm-1 (SHA-1) family of hash functions.
Cited by 20