512×512 Inverted Hash

We present the 512×512 Inverted Hash, a novel cryptographic hash function based on a pyramidal reduction architecture with a structural inversion mechanism. The design operates on 256-byte input blocks, maintains a 256-byte ( 2048-bit ) internal state, and produces a 256-byte output through 24 permutation rounds. Rigorous empirical evaluation through 11 independent statistical test on the fully 2048-bit output.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-05-30
DOI
https://doi.org/10.5281/zenodo.20466638
Primary Topic
Cryptographic Implementations and Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

512×512 Inverted Hash

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

512×512 Inverted Hash

Marco Lazcano
article en

Abstract

We present the 512×512 Inverted Hash, a novel cryptographic hash function based on a pyramidal reduction architecture with a structural inversion mechanism. The design operates on 256-byte input blocks, maintains a 256-byte ( 2048-bit ) internal state, and produces a 256-byte output through 24 permutation rounds. Rigorous empirical evaluation through 11 independent statistical test on the fully 2048-bit output.

Zenodo (CERN European Organization for Nuclear Research)
Sustainable cities and communities
Openalex Percentile: Top 4%
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.