Data Tastes Better Seasoned: Introducing the ASH Family of Hashing Algorithms
D.J. Capelis

TL;DR
The paper introduces the ASH family of cryptographic hashing algorithms, which enhance collision resistance and security post-collision mitigation over SHA-2, offering flexible design features for diverse applications.
Contribution
It presents a new family of hashing algorithms with modifications to SHA-2, focusing on improved security and flexibility for future cryptographic needs.
Findings
Enhanced collision resistance compared to SHA-2
Improved mitigation of post-collision security risks
Flexible design with public/private sections and salt/pepper
Abstract
Over the recent months it has become clear that the current generation of cryptographic hashing algorithms are insufficient to meet future needs. The ASH family of algorithms provides modifications to the existing SHA-2 family. These modifications are designed with two main goals: 1) Providing increased collision resistance. 2) Increasing mitigation of security risks post-collision. The unique public/private sections and salt/pepper design elements provide increased flexibility for a broad range of applications. The ASH family is a new generation of cryptographic hashing algorithms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptographic Implementations and Security · Coding theory and cryptography · Chaos-based Image/Signal Encryption
