A deterministic prime generation chain constructs primes N from seed primes q using monogenic cubic fields, requiring one modular exponentiation in Õ(log² N) time.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Deterministic Cryptographic Prime Generation Chain over Monogenic Cubic Number Fields and their Generalizations
A deterministic prime generation chain constructs primes N from seed primes q using monogenic cubic fields, requiring one modular exponentiation in Õ(log² N) time.