Deterministic Cryptographic Seed Generation via Cyclic Modular Inversion over $\mathbb{Z}/3^p\mathbb{Z}$

TL;DR

This paper introduces a deterministic method for cryptographic seed generation using cyclic modular inversion over rac{3^p}{Z} with a new entropy metric, improving seed quality and security for cryptographic primitives.

Contribution

It presents a novel algebraic framework for seed generation based on modular inversion, including a new entropy confidence score for assessing randomness quality.

Findings

Constant-time execution confirmed by empirical tests

Minimal side-channel leakage demonstrated in hardware implementations

Generated seeds are suitable for cryptographic primitives like DRBGs and KDFs

Abstract

We present a deterministic framework for cryptographic seed generation based on cyclic modular inversion over $\mathbb{Z}/3^p\mathbb{Z}$. The method enforces algebraic admissibility on seed inputs via the identity $d_k \equiv -\left(2^{k-1}\right)^{-1} \bmod 3^p$, thereby producing structured and invertible residue sequences. This mapping yields entropy-rich, cycle-complete seeds well-suited for cryptographic primitives such as DRBGs, KDFs, and post-quantum schemes. To assess the quality of randomness, we introduce the Entropy Confidence Score (ECS), a composite metric reflecting coverage, uniformity, and modular bias. Although not a cryptographic PRNG in itself, the framework serves as a deterministic entropy filter that conditions and validates seed inputs prior to their use by conventional generators. Empirical and hardware-based results confirm constant-time execution, minimal side-channel leakage, and lightweight feasibility for embedded applications. The framework complements existing cryptographic stacks by acting as an algebraically verifiable entropy filter, thereby enhancing structural soundness and auditability.