I CHING Pyramid v4.0: A Memory‑Hard Key Derivation Algorithm Inspired by the Oldest Binary System in Human History.

ABSTRACT This work presents a fully original cryptographic key derivation algorithm inspired by the **I CHING (Book of Mutations)** , the oldest known binary system in human history (3000 BCE). The algorithm is built upon a 2048‑level pyramidal structure, where each level processes 2048 base elements using a circular distance transformation (modulo 10), 1024 dynamic salts, polynomial non‑linearity, and 32 rounds of XOR‑based mutations. The system is memory‑hard, requiring 128 MB of RAM per block, making it resistant to brute‑force attacks, ASICs, and parallel hardware acceleration. In an era dominated by Western cryptographic standards (AES, SHA-2, Argon2), there is a growing need for **alternative, culturally diverse cryptographic primitives**. This work presents a key derivation algorithm that: - Is **100% original**, inspired by the I CHING. - Contains **no S‑boxes, P‑boxes, or NSA‑derived constants**. - Is **memory‑hard**, resistant to ASIC and GPU attacks. - Achieves **excellent statistical properties** (entropy ~8.0, avalanche ~50%). - Is **competitive** with modern standards like Argon2id.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-08-25
DOI
https://doi.org/10.5281/zenodo.22101365
Primary Topic
Cryptographic Implementations and Security
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

I CHING Pyramid v4.0: A Memory‑Hard Key Derivation Algorithm Inspired by the Oldest Binary System in Human History.

Marco Lazcano
Zenodo (CERN European Organization for Nuclear Research)
Cryptographic Implementations and Security
preprint

I CHING Pyramid v4.0: A Memory‑Hard Key Derivation Algorithm Inspired by the Oldest Binary System in Human History.

Marco Lazcano
preprint en

Abstract

ABSTRACT This work presents a fully original cryptographic key derivation algorithm inspired by the **I CHING (Book of Mutations)** , the oldest known binary system in human history (3000 BCE). The algorithm is built upon a 2048‑level pyramidal structure, where each level processes 2048 base elements using a circular distance transformation (modulo 10), 1024 dynamic salts, polynomial non‑linearity, and 32 rounds of XOR‑based mutations. The system is memory‑hard, requiring 128 MB of RAM per block, making it resistant to brute‑force attacks, ASICs, and parallel hardware acceleration. In an era dominated by Western cryptographic standards (AES, SHA-2, Argon2), there is a growing need for **alternative, culturally diverse cryptographic primitives**. This work presents a key derivation algorithm that: - Is **100% original**, inspired by the I CHING. - Contains **no S‑boxes, P‑boxes, or NSA‑derived constants**. - Is **memory‑hard**, resistant to ASIC and GPU attacks. - Achieves **excellent statistical properties** (entropy ~8.0, avalanche ~50%). - Is **competitive** with modern standards like Argon2id.

Zenodo (CERN European Organization for Nuclear Research)
Cryptographic Implementations and Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.