Relevant bibliographies by topics / SHA-3 Hashing

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'SHA-3 Hashing'

Author: Grafiati
Published: 7 June 2025
Last updated: 16 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'SHA-3 Hashing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "SHA-3 Hashing"

1

Sidorenko, A. V., and M. S. Shishko. "Hashing technique based on SHA-3 using chaotic maps1." Informatics 17, no. 1 (2020): 109–18. http://dx.doi.org/10.37661/1816-0301-2020-17-1-109-118.

Full text
Abstract:
New hashing technique based on SHA-3 (Secure Hash Algorithm-3) is introduced. Chaotic maps are used in this technique to enhance performance without losing security. Introduced algorithm was tested for resistance against collisions, statistical analysis of output sequences was performed, hashing performance was evaluated. The testing showed a low collision probability. The testing corresponds the standards of National Institute of Standards and Technology and showed that output sequences are close to random. Performance testing showed 60 % enhancement in comparison with plain SHA-3.
APA, Harvard, Vancouver, ISO, and other styles
2

Khan, Burhan Ul Islam, Rashidah Funke Olanrewaju, Malik Arman Morshidi, Roohie Naaz Mir, Miss Laiha Binti Mat Kiah, and Abdul Mobeen Khan. "EVOLUTION AND ANALYSIS OF SECURED HASH ALGORITHM (SHA) FAMILY." Malaysian Journal of Computer Science 35, no. 3 (2022): 179–200. http://dx.doi.org/10.22452/mjcs.vol35no3.1.

Full text
Abstract:
With the rapid advancement of technologies and proliferation of intelligent devices, connecting to the internet challenges have grown manifold, such as ensuring communication security and keeping user credentials secret. Data integrity and user privacy have become crucial concerns in any ecosystem of advanced and interconnected communications. Cryptographic hash functions have been extensively employed to ensure data integrity in insecure environments. Hash functions are also combined with digital signatures to offer identity verification mechanisms and non-repudiation services. The federal organization National Institute of Standards and Technology (NIST) established the SHA to provide security and optimal performance over some time. The most well-known hashing standards are SHA-1, SHA-2, and SHA-3. This paper discusses the background of hashing, followed by elaborating on the evolution of the SHA family. The main goal is to present a comparative analysis of these hashing standards and focus on their security strength, performance and limitations against common attacks. The complete assessment was carried out using statistical analysis, performance analysis and extensive fault analysis over a defined test environment. The study outcome showcases the issues of SHA-1 besides exploring the security benefits of all the dominant variants of SHA-2 and SHA-3. The study also concludes that SHA-3 is the best option to mitigate novice intruders while allowing better performance cost-effectively.
APA, Harvard, Vancouver, ISO, and other styles
3

PUTRI, THETA DINNARWATY, WINARNO SUGENG, and GUNAWAN YUGA UTAMA. "Tempat Sampah Pengelola Password Wifi dengan Algoritma TOTP SHA-3." MIND Journal 5, no. 1 (2021): 1–13. http://dx.doi.org/10.26760/mindjournal.v5i1.1-13.

Full text
Abstract:
AbstrakAlgoritma Time-Based One Time Password (TOTP) merupakan algoritma yang berfungsi menghasilkan password untuk satu kali pemakaian. Password yang dihasilkan memiliki batas waktu tertentu dan akan selalu berubah secara dinamis dalam periode tertentu. Algoritma TOTP menggabungkan secret key dengan current time yang kemudian dilakukan hashing menggunakan algoritma enkripsi SHA-3. Pada penelitian ini TOTP diaplikasikan untuk pengelolaan password wifi pada media tempat sampah dimana keterkaitan user dan kebutuhan mengakses wifi. TOTP akan menghasilkan password wifi untuk user jika user melakukan kegiatan membuang sampah pada media tempat sampah. Pada secret key dilakukan enkripsi menggunakan algoritma caesar terlebih dahulu sebelum dilakukan tahap hashing, ini agar membuat secret key dinamis sehingga variasi password menjadi lebih banyak dan dapat meningkatkan keamanan dari password. Dari hasil pengujian keluaran password tidak muncul secara berulang namun memiliki tingkat kemiripan sebesar 0,02%.Kata kunci: Internet Of Thing, TOTP, SHA-3, Tempat sampah AbstractThe Time-Based One Time Password (TOTP) algorithm is an algorithm that produces a password for only one use. A password that is produced has a limited time and always changed dynamically in a specific period. The TOTP algorithm combines a secret key with a current time which is then hased with an encryption algorithm SHA-3. In this experiment the TOTP is applied for managing a wifi password for a user, when the user is throwing a trash at a particular bin. The secret key will be encrypted used a caesar algorithm before the hashing process, so that a secret key become dynamic and the password multiplied, and the security level will be higher. In this experiment the password output has not produced periodically but has a 0.02% similliarity.Keywords: Internet Of Thing, TOTP, SHA-3,Trashbin
APA, Harvard, Vancouver, ISO, and other styles
4

Huynh, Huu-Thuan, Tuan-Kiet Tran, and Tan-Phat Dang. "Implementing a very high-speed secure hash algorithm 3 accelerator based on PCI-express." International Journal of Reconfigurable and Embedded Systems (IJRES) 14, no. 1 (2025): 1. https://doi.org/10.11591/ijres.v14.i1.pp1-11.

Full text
Abstract:
In this paper, a high-performance secure hash algorithm 3 (SHA-3) is proposed to handle massive amounts of data for applications such as edge computing, medical image encryption, and blockchain networks. This work not only focuses on the SHA-3 core as in previous works but also addresses the bottleneck phenomenon caused by transfer rates. Our proposed SHA-3 architecture serves as the hardware accelerator for personal computers (PC) connected via a peripheral component interconnect express (PCIe), enhancing data transfer rates between the host PC and dedicated computation components like SHA-3. Additionally, the throughput of the SHA-3 core is enhanced based on two different proposals for the KECCAK-f algorithm: re-scheduled and sub-pipelined architectures. The multiple KECCAK-f is applied to maximize data transfer throughput. Configurable buffer in/out (BIO) is introduced to support all SHA-3 modes, which is suitable for devices that handle various hashing applications. The proposed SHA-3 architectures are implemented and tested on DE10-Pro supporting Stratix 10 - 1SX280HU2F50E1VG and PCIe, achieving a throughput of up to 35.55 Gbps and 43.12 Gbps for multiple-re-scheduled-KECCAK-f-based SHA3 (MRS) and multiple-sub-pipelined-KECCAK-f-based SHA-3 (MSS), respectively.
APA, Harvard, Vancouver, ISO, and other styles
5

Huynh, Huu Thuan, Tuan Kiet Tran, and Tan-Phat Dang. "Implementing a very high-speed secure hash algorithm 3 accelerator based on PCI-express." International Journal of Reconfigurable and Embedded Systems (IJRES) 14, no. 1 (2025): 1–11. https://doi.org/10.11591/ijres.v14.i1.pp1-11.

Full text
Abstract:
In this paper, a high-performance secure hash algorithm 3 (SHA-3) is proposed to handle massive amounts of data for applications such as edge computing, medical image encryption, and blockchain networks. This work not only focuses on the SHA-3 core as in previous works but also addresses the bottleneck phenomenon caused by transfer rates. Our proposed SHA-3 architecture serves as the hardware accelerator for personal computers (PC) connected via a peripheral component interconnect express (PCIe), enhancing data transfer rates between the host PC and dedicated computation components like SHA-3. Additionally, the throughput of the SHA-3 core is enhanced based on two different proposals for the KECCAK-f algorithm: re-scheduled and sub-pipelined architectures. The multiple KECCAK-f is applied to maximize data transfer throughput. Configurable buffer in/out (BIO) is introduced to support all SHA-3 modes, which is suitable for devices that handle various hashing applications. The proposed SHA-3 architectures are implemented and tested on DE10-Pro supporting Stratix 10 - 1SX280HU2F50E1VG and PCIe, achieving a throughput of up to 35.55 Gbps and 43.12 Gbps for multiple-re-scheduled-KECCAK-f-based SHA3 (MRS) and multiple-sub-pipelined-KECCAK-f-based SHA-3 (MSS), respectively.
APA, Harvard, Vancouver, ISO, and other styles
6

Sinaga, Joice Sharon Gabriella, Nehemia Sitorus, and Steven Lukas Samosir. "Analisis Kinerja Algoritma Hash pada Keamanan Data: Perbandingan Antara SHA-256, SHA-3, dan Blake2." JURNAL QUANCOM: QUANTUM COMPUTER JURNAL 2, no. 2 (2024): 9–16. https://doi.org/10.62375/jqc.v2i2.432.

Full text
Abstract:
Data security is an essential aspect in the dynamic digital age, including protection of data integrity, confidentiality and authentication. This research evaluates the performance and security of three popular hash algorithms: SHA-256, SHA-3, and Blake2. Resistance to brute force attacks, avalanche effects, and processing time efficiency were analyzed. Results show that all algorithms have excellent resistance to brute force attacks, thanks to the 256-bit hash length. In terms of avalanche effect, SHA-3 shows higher consistency than the other algorithms, making it superior in maintaining data integrity. In terms of processing time efficiency, Blake2 performed best with the fastest hashing time, while SHA-256 offered balanced efficiency for general applications. SHA-3, although slower, has advantages in security and resistance to collision attacks. Overall, SHA-3 is recommended for applications with high security requirements, Blake2 is suitable for applications that prioritize efficiency, and SHA-256 remains relevant for applications that require a balance between speed and security.
APA, Harvard, Vancouver, ISO, and other styles
7

Ikhwan, Syariful, and Risa Farrid Christianti. "Penerapan Keamanan WSN Berbasis Algoritma RSA 2048 dan SHA-3 pada Pemantauan Suhu." Jurnal Nasional Teknologi dan Sistem Informasi 6, no. 3 (2021): 150–57. http://dx.doi.org/10.25077/teknosi.v6i3.2020.150-157.

Full text
Abstract:
Pemantauan kondisi suatu keadaan dengan menggunakan sensor semakin dibutuhkan untuk mengamati perubahan kondisi dari waktu ke waktu. Data-data yang didapatkan sensor kemudian dikirimkan ke sistem pengumpul yang telah disiapkan melalui saluran jaringan telekomunikasi. Pengirimanan data pada perangkat-perangkat jaringan telekomunikasi yang disebar pada lokasi-lokasi tertentu yang kurang aman diberbagai keadaan memungkinkan data tersebut rentan untuk diambil dan dipalsukan. Sistem pengamanan berupa kriptografi dan hashing kemudian digunakan untuk melindungi data agar sampai dengan baik ke penerima. Pada penelitian ini diterapkan sistem keamanan dengan mengimplementasikan algoritma kriptografi asimetrik RSA 2048 bit dan algoritma hashing SHA-3 pada pengiriman paket data yang dikirim. Hal ini dilakukan agar data bisa terjaga keasliannya dan tidak bisa dibaca oleh orang yang tidak berhak jika data tersebut didapatkan. Setelah dilakukan pengujian dengan mengirimkan paket data dari pengirim ke penerima dengan beberapa variasi jarak, didapatkan bahwa ada selisih waktu saat data dikirimkan tanpa menggunakan keamanan dan saat menggunakan keamanan SHA-3 dan RSA 2048 sebesar 70,96603 ms.
APA, Harvard, Vancouver, ISO, and other styles
8

Ikhwan, Syariful, and Risa Farrid Christianti. "Penerapan Keamanan WSN Berbasis Algoritma RSA 2048 dan SHA-3 pada Pemantauan Suhu." Jurnal Nasional Teknologi dan Sistem Informasi 6, no. 3 (2021): 150–57. http://dx.doi.org/10.25077/teknosi.v6i3.2020.150-157.

Full text
Abstract:
Pemantauan kondisi suatu keadaan dengan menggunakan sensor semakin dibutuhkan untuk mengamati perubahan kondisi dari waktu ke waktu. Data-data yang didapatkan sensor kemudian dikirimkan ke sistem pengumpul yang telah disiapkan melalui saluran jaringan telekomunikasi. Pengirimanan data pada perangkat-perangkat jaringan telekomunikasi yang disebar pada lokasi-lokasi tertentu yang kurang aman diberbagai keadaan memungkinkan data tersebut rentan untuk diambil dan dipalsukan. Sistem pengamanan berupa kriptografi dan hashing kemudian digunakan untuk melindungi data agar sampai dengan baik ke penerima. Pada penelitian ini diterapkan sistem keamanan dengan mengimplementasikan algoritma kriptografi asimetrik RSA 2048 bit dan algoritma hashing SHA-3 pada pengiriman paket data yang dikirim. Hal ini dilakukan agar data bisa terjaga keasliannya dan tidak bisa dibaca oleh orang yang tidak berhak jika data tersebut didapatkan. Setelah dilakukan pengujian dengan mengirimkan paket data dari pengirim ke penerima dengan beberapa variasi jarak, didapatkan bahwa ada selisih waktu saat data dikirimkan tanpa menggunakan keamanan dan saat menggunakan keamanan SHA-3 dan RSA 2048 sebesar 70,96603 ms.
APA, Harvard, Vancouver, ISO, and other styles
9

Sideris, Argyrios, and Minas Dasygenis. "Enhancing the Hardware Pipelining Optimization Technique of the SHA-3 via FPGA." Computation 11, no. 8 (2023): 152. http://dx.doi.org/10.3390/computation11080152.

Full text
Abstract:
Information is transmitted between multiple insecure routing hops in text, image, video, and audio. Thus, this multi-hop digital data transfer makes secure transmission with confidentiality and integrity imperative. This protection of the transmitted data can be achieved via hashing algorithms. Furthermore, data integrity must be ensured, which is feasible using hashing algorithms. The advanced cryptographic Secure Hashing Algorithm 3 (SHA-3) is not sensitive to a cryptanalysis attack and is widely preferred due to its long-term security in various applications. However, due to the ever-increasing size of the data to be transmitted, an effective improvement is required to fulfill real-time computations with multiple types of optimization. The use of FPGAs is the ideal mechanism to improve algorithm performance and other metrics, such as throughput (Gbps), frequency (MHz), efficiency (Mbps/slices), reduction of area (slices), and power consumption. Providing upgraded computer architectures for SHA-3 is an active area of research, with continuous performance improvements. In this article, we have focused on enhancing the hardware performance metrics of throughput and efficiency by reducing the area cost of the SHA-3 for all output size lengths (224, 256, 384, and 512 bits). Our approach introduces a novel architectural design based on pipelining, which is combined with a simplified format for the round constant (RC) generator in the Iota (ι) step only consisting of 7 bits rather than the standard 64 bits. By reducing hardware resource utilization in the area and minimizing the amount of computation required at the Iota (ι) step, our design achieves the highest levels of throughput and efficiency. Through extensive experimentation, we have demonstrated the remarkable performance of our approach. Our results showcase an impressive throughput rate of 22.94 Gbps and an efficiency rate of 19.95 Mbps/slices. Our work contributes to advancing computer architectures tailored for SHA-3, therefore unlocking new possibilities for secure and high-performance data transmission.
APA, Harvard, Vancouver, ISO, and other styles
10

R., SaiGanesh*1 Dr. K. Venkataramana2. "Optimized Digital Signature Algorithm with Multi-Prime RSA." International Journal of Scientific Research and Technology 2, no. 3 (2025): 434–39. https://doi.org/10.5281/zenodo.15078329.

Full text
Abstract:
Digital signatures are an essential cryptographic technique used to ensure the authenticity, integrity, and non-repudiation of digital messages. This paper presents on optimizing RSA-based digital signatures by integrating Multi-Prime RSA, Chinese Remainder Theorem (CRT)-based signing, Sliding Window Exponentiation, and SHA-3 hashing to enhance performance and security. Multi-Prime RSA improves efficiency by using multiple primes, reducing computational complexity while maintaining strong encryption. The CRT-based optimization accelerates signing by breaking computations into smaller modular exponentiations, and Sliding Window Exponentiation speeds up verification by reducing multiplication steps. SHA-3 hashing ensures message integrity and protection against cryptographic attacks. These techniques improve key generation, signing, and verification, making RSA more efficient for real-time applications such as secure transactions, encrypted communication, and blockchain security.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "SHA-3 Hashing"

1

Rawat, Hemendra Kumar. "Vector Instruction Set Extensions for Efficient and Reliable Computation of Keccak." Thesis, Virginia Tech, 2016. http://hdl.handle.net/10919/72857.

Full text
Abstract:
Recent processor architectures such as Intel Westmere (and later) and ARMv8 include instruction-level support for the Advanced Encryption Standard (AES), for the Secure Hashing Standard (SHA-1, SHA2) and for carry-less multiplication. These crypto-instructions are optimized for a single algorithm and provide significant performance improvements over software written using general-purpose instruction set. However, today's secure systems and protocols do not rely on just one, but a suite of many cryptographic applications that are expected to work in a correct and reliable manner. In this work, we propose a new instruction set for supporting efficient and reliable cryptography on modern processors. For efficiency, we propose flexible instruction set extensions for Keccak, a cryptographic kernel for hashing, authenticated encryption, key-stream generation and random-number generation. Keccak is the basis of the SHA-3 standard and the newly proposed Keyak and Ketje authenticated ciphers. For reliability, we propose a set of trusted instructions to verify the integrity of a cryptographic software library. These instructions are aimed at detecting tamper in the software or in the configurable hardware. We develop the instruction extensions for a 128-bit interface, commonly available in the vector processing unit of many modern processors. Simulation results on GEM5 architectural simulator show that the proposed instructions not only improves the performance of Keccak applications by 2 times (over NEON programming) and 6 times (over assembly programming), but also improves the reliability of applications at a performance overhead of just 6%.<br>Master of Science
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "SHA-3 Hashing"

1

Albertini, Ange, Jean-Philippe Aumasson, Maria Eichlseder, Florian Mendel, and Martin Schläffer. "Malicious Hashing: Eve’s Variant of SHA-1." In Selected Areas in Cryptography -- SAC 2014. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-13051-4_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

"Secure Hashing: SHA-1, SHA-2, and SHA-3." In Circuits and Systems for Security and Privacy. CRC Press, 2017. http://dx.doi.org/10.1201/b19499-11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Roberto Martinez Martinez, Carlos. "Blockchain Mining: Understanding Its Difficulty in Terms of Hashing Algorithm Efficiency." In Blockchain - Pioneering the Web3 Infrastructure for an Intelligent Future [Working Title]. IntechOpen, 2024. http://dx.doi.org/10.5772/intechopen.1005350.

Full text
Abstract:
This study systematically evaluates the performance of the hashing algorithms SHA-2 and SHA-3 (in both 256-bit and 512-bit variants), as well as MD5, in generating and verifying a thousand-block chain to understand the computational costs associated with blockchain mining. Java-specific source code was developed to simulate key aspects of a blockchain back-end environment, focusing on block creation and validation. The five distinct hashing algorithm configurations were tested at varying levels of complexity, with performance measured by the duration of each test. The study reveals that SHA-3, despite producing stronger hash values, is slower than MD5 and SHA-2. An optimal balance between security and calculation time was achieved at a four-character complexity level. While higher complexity levels enhance security, they significantly reduce performance, deeming them suitable for systems with lower data processing needs. These findings can guide small and medium-sized businesses in understanding the computational costs of employing blockchain technologies.
APA, Harvard, Vancouver, ISO, and other styles
4

Ganesan, P., D. Rosy Salomi Victoria, Arun Singh Chouhan, D. Saravanan, Rekha Baghel, and K. Saikumar. "Enhancing the Protection of Information in Digital Voting Using the Fraud Application of Blockchain Technology." In Advances in Multimedia and Interactive Technologies. IGI Global, 2023. http://dx.doi.org/10.4018/978-1-6684-6060-3.ch011.

Full text
Abstract:
Elections are conducted electronically instead of using paper ballots to cut down on mistakes and discrepancies. Recently, it has been discovered that paper-based balloting fails owing to security and privacy difficulties, and the electronic balloting approach has been recommended as a replacement. For the sake of keeping your data safe, the authors have designed and developed a hashing algorithm based on SHA-256. The blockchain's adaptability is aided by the sealing of the block concept's incorporation. Consortium blockchain technology is employed to ensure that only the election commission has access to the blockchain database, which candidates and other outside parties cannot modify. When used in the polling method, the methodology discussed in this chapter can yield reliable findings. The authors used a hashing algorithm (SHA-256), block generation, data collection, and result declaration to get to this point.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "SHA-3 Hashing"

1

Junior, Franklin Magalhaes Ribeiro, Edward D. Moreno, Wanderson Roger Azevedo Dias, and Felipe dos Anjos Lima. "Cache performance analysis of SHA-3 hashing algorithm (BLAKE) and SHA-1." In 2012 XXXVIII Conferencia Latinoamericana En Informatica (CLEI). IEEE, 2012. http://dx.doi.org/10.1109/clei.2012.6427246.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sharma, Jayanti, and Deepali Koppad. "Low power and pipelined secure hashing algorithm-3(SHA-3)." In 2016 IEEE Annual India Conference (INDICON). IEEE, 2016. http://dx.doi.org/10.1109/indicon.2016.7839059.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sklavos, Nicolas. "Multi-module Hashing System for SHA-3 & FPGA Integration." In 2011 International Conference on Field Programmable Logic and Applications (FPL). IEEE, 2011. http://dx.doi.org/10.1109/fpl.2011.37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ayuzawa, Yusuke, Naoki Fujieda, and Shuichi Ichikawa. "Design trade-offs in SHA-3 multi-message hashing on FPGAs." In TENCON 2014 - 2014 IEEE Region 10 Conference. IEEE, 2014. http://dx.doi.org/10.1109/tencon.2014.7022311.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Vanamala, Manuraj, Sarath Chandra Jampani, and Noor Mahammad Sk. "Designing of Secure Hashing Algorithm 3 (SHA-3) in Bluespec System Verilog and Python." In 2024 Second International Conference on Emerging Trends in Information Technology and Engineering (ICETITE). IEEE, 2024. http://dx.doi.org/10.1109/ic-etite58242.2024.10493377.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Akin, Abdulkadir, Aydin Aysu, Onur Can Ulusel, and Erkay Savaş. "Efficient hardware implementations of high throughput SHA-3 candidates keccak, luffa and blue midnight wish for single- and multi-message hashing." In the 3rd international conference. ACM Press, 2010. http://dx.doi.org/10.1145/1854099.1854135.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'SHA-3 Hashing' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography