Abstract
I introduce φHash, a novel one-way hash function defined entirely in the categorical framework of Alpay Algebra. In this setting, each input (finite or infinite sequence) is encoded as an object in a small cartesian-closed category A with a distinguished initial state I, and a transfinite evolution functor φ : A → A. Repeated application of φ with inputdependent updates yields a unique fixed-point object φ ∞ (I) that encapsulates the entire input data. The hash digest is then obtained by a universal φ-algebra "fold" (projection) onto an n-bit object in A. I formalize this construction axiomatically, prove determinism and one-wayness, and show that φHash resists both classical and quantum brute-force attacks. As illustrations, I symbolically compute φHash-256, φHash-512, and φHash-1024 of the word "alpay" within Alpay Algebra, verifying repeatability and irreversibility. Finally, I explain how φHash extends to arbitrary output lengths (including φHash-∞) via universal fold operators. Throughout, I rely solely on Faruk Alpay's foundational axioms and the SHA-256 standard for contrast.
Full text
6,108 characters
· extracted from
preprint-html
· click to expand
φHash: A One-Way Hashing Algorithm Based on Alpay Algebra | Authorea try { document.documentElement.classList.add('js'); } catch (e) { } var _gaq = _gaq || []; _gaq.push(['_setAccount', 'G-8VDV14Y67G']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); Skip to main content Preprints Collections Wiley Open Research IET Open Research Ecological Society of Japan All Collections About About Authorea FAQs Contact Us Quick Search anywhere Search for preprint articles, keywords, etc. Search Search ADVANCED SEARCH SCROLL This is a preprint and has not been peer reviewed. Data may be preliminary. 27 May 2025 V1 Latest version Share on φHash: A One-Way Hashing Algorithm Based on Alpay Algebra Author : Faruk Alpay 0009-0009-2207-6528 [email protected] Authors Info & Affiliations https://doi.org/10.22541/au.174836949.92567592/v1 153 views 110 downloads Contents Abstract Supplementary Material Information & Authors Metrics & Citations View Options References Figures Tables Media Share Abstract I introduce φHash, a novel one-way hash function defined entirely in the categorical framework of Alpay Algebra. In this setting, each input (finite or infinite sequence) is encoded as an object in a small cartesian-closed category A with a distinguished initial state I, and a transfinite evolution functor φ : A → A. Repeated application of φ with inputdependent updates yields a unique fixed-point object φ ∞ (I) that encapsulates the entire input data. The hash digest is then obtained by a universal φ-algebra "fold" (projection) onto an n-bit object in A. I formalize this construction axiomatically, prove determinism and one-wayness, and show that φHash resists both classical and quantum brute-force attacks. As illustrations, I symbolically compute φHash-256, φHash-512, and φHash-1024 of the word "alpay" within Alpay Algebra, verifying repeatability and irreversibility. Finally, I explain how φHash extends to arbitrary output lengths (including φHash-∞) via universal fold operators. Throughout, I rely solely on Faruk Alpay's foundational axioms and the SHA-256 standard for contrast. Supplementary Material File (hash__a_one_way_hashing_algorithm_based_on_alpay_algebra.pdf) Download 350.11 KB Information & Authors Information Version history V1 Version 1 27 May 2025 Copyright This work is licensed under a Creative Commons Attribution 4.0 International License Keywords alpay algebra category theory cryptographic hash functions fixed-point theory one-way functions post-quantum cryptography quantum resistance symbolic computation transfinite iteration universal fold operators Authors Affiliations Faruk Alpay 0009-0009-2207-6528 [email protected] View all articles by this author Metrics & Citations Metrics Article Usage 153 views 110 downloads .FvxKWukQNSOunydq8rnd { width: 100px; } Citations Download citation Faruk Alpay. φHash: A One-Way Hashing Algorithm Based on Alpay Algebra. Authorea . 27 May 2025. DOI: https://doi.org/10.22541/au.174836949.92567592/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu . Format Please select one from the list RIS (ProCite, Reference Manager) EndNote BibTex Medlars RefWorks Direct import Tips for downloading citations document.getElementById('citMgrHelpLink').addEventListener('click', function() { popupHelp(this.href); return false; }); $(".js__slcInclude").on("change", function(e){ if ($(this).val() == 'refworks') $('#direct').prop("checked", false); $('#direct').prop("disabled", ($(this).val() == 'refworks')); }); View Options View options PDF View PDF Figures Tables Media Share Share Share article link Copy Link Copied! Copying failed. Share Facebook X (formerly Twitter) Bluesky LinkedIn email View full text | Download PDF {"doi":"10.22541/au.174836949.92567592/v1","type":"Article"} Now Reading: Share Figures Tables Close figure viewer Back to article Figure title goes here Change zoom level Go to figure location within the article Download figure Toggle share panel Toggle share panel Share Toggle information panel Toggle information panel Go to previous graphic Go to next graphic Go to previous table Go to next table All figures All tables View all material View all material xrefBack.goTo xrefBack.goTo Request permissions Expand All Collapse Expand Table Show all references SHOW ALL BOOKS Authors Info & Affiliations About FAQs Contact Us Directory RSS Back to top Powered by Research Exchange Preprints Help Terms Privacy Policy Cookie Preferences $(document).ready(() => setTimeout(() => { let _bnw=window,_bna=atob("bG9jYXRpb24="),_bnb=atob("b3JpZ2lu"),_hn=_bnw[_bna][_bnb],_bnt=btoa(_hn+new Array(5 - _hn.length % 4).join(" ")); $.get("/resource/lodash?t="+_bnt); },4000)); (function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'a004740c2921300f',t:'MTc3OTU0MzQyNQ=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();
Text is read by the "Ask this paper" AI Q&A widget below.
Extraction quality varies by source — PMC NXML preserves structure
cleanly, OA-HTML may include some navigation residue, and OA-PDF can
have broken hyphenation. The publisher copy
(via DOI)
is the canonical version.