A Hash Algorithm for Directory Tree
Overview
This project aims to make hash-related file operations can be directly processed on directory tree level, as the existing hash algorithms are only for a single message or file, thus limits hash-related operations' performance in multi-file scenarios. A hash algorithm for directory tree, namely DTH algorithm, is designed. DTH algorithm generates folders’ hash through DFS recursion and sponge structure mergence. It provides a fast method of directory level data security verification, which can be widely used in data backup, file damage detection, folder comparison and other scenarios. In distributed storage, it also provides a cache method based on directory rather than just files. According to the algorithm evaluation, the DTH algorithm is fast and reliable. It measures up to the application standard to be used as an optimizer, and can be directly used in software development too.
Awards (3)
- King Abdulaziz & his Companions Foundation for Giftedness and Creativity: On-line Mawhiba Universal Enrichment Program
- King Abdulaziz & his Companions Foundation for Giftedness and Creativity: Award of $500 $500
- Association for Computing Machinery: Fourth Award of $500 $500
Competition history
- ISEF 2021
Resources
Related projects
ISEF · 2022
The Hash Algorithm Based on Three-Body Chaotic Motion
ISEF · 2014
A New Secure Distributed Storage System for Cloud: Mathematical Framework, Design and Applications
ISEF · 2018
A Novel Cryptographic Hash Code Algorithm Based on Cellular Automata
ISEF · 2019
Blockchain Optimization Model Based on Consistent Hash Algorithm
ISEF · 2024
Developing a Novel Paradigm for the Distributed Storage of Digital Information
ISEF · 2014
Winning the War against Hackers: A Hybrid Asymmetric Cryptographic Algorithm for Safe and Secure Data
ISEF · 2018
A Practical Cryptosystem with Provable Security: Three New Innovations in Cryptography
ISEF · 2017
Encryption in Everyday Life
Closest projects by meaning, across every fair and year in the corpus.
Browse more like this
Source: Regeneron International Science and Engineering Fair