The Forest Analogy: Full Specification of the MRS-AUTH Cryptographic Framework

This work presents MRS-AUTH, a hybrid post-quantum and coercion-resistant authentication framework built around a structured Diophantine witness space defined by N = 19A + 9B. Its mathematical core is expressed through three Crown Equations: A₀ = dr(N) = 1 + ((N − 1) mod 9) B₀ = (N − 19·A₀) / 9 dr(B) = dr(2, dr(N)) Together, these equations provide deterministic anchoring, exact boundary reconstruction, and structural filtering for constant-time witness sampling without exhaustive enumeration. MRS-AUTH uses a three-layer witness chain in which the authentic witness is cryptographically bound to an identity, while alternative mathematically valid witnesses can be generated as coercion-resistant alibis. The framework combines ML-KEM-1024, HKDF-SHA256, AES-256-GCM, HMAC-SHA256, Shamir Secret Sharing with commitment verification, and Merkle commitments. Its mathematical model and security games are formally specified in EasyCrypt, alongside a Rust implementation with an automated test suite. MRS-AUTH is an active research prototype and requires independent security review before production deployment.

Authors

Publication Details

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

The Forest Analogy: Full Specification of the MRS-AUTH Cryptographic Framework

Bilal El Issaoui
Zenodo (CERN European Organization for Nuclear Research)
Cryptographic Implementations and Security
preprint

The Forest Analogy: Full Specification of the MRS-AUTH Cryptographic Framework

Bilal El Issaoui
preprint en

Abstract

This work presents MRS-AUTH, a hybrid post-quantum and coercion-resistant authentication framework built around a structured Diophantine witness space defined by N = 19A + 9B. Its mathematical core is expressed through three Crown Equations: A₀ = dr(N) = 1 + ((N − 1) mod 9) B₀ = (N − 19·A₀) / 9 dr(B) = dr(2, dr(N)) Together, these equations provide deterministic anchoring, exact boundary reconstruction, and structural filtering for constant-time witness sampling without exhaustive enumeration. MRS-AUTH uses a three-layer witness chain in which the authentic witness is cryptographically bound to an identity, while alternative mathematically valid witnesses can be generated as coercion-resistant alibis. The framework combines ML-KEM-1024, HKDF-SHA256, AES-256-GCM, HMAC-SHA256, Shamir Secret Sharing with commitment verification, and Merkle commitments. Its mathematical model and security games are formally specified in EasyCrypt, alongside a Rust implementation with an automated test suite. MRS-AUTH is an active research prototype and requires independent security review before production deployment.

Zenodo (CERN European Organization for Nuclear Research)
Life in Land
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.