KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesParameter Sizes, Records and Live ReferencesEngineering · Engineering MathematicsLesson 701/884← PrevNext →
ArticlePublished 7 Aug 20263 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIParameter Sizes, Records and Live References

KEVOS knowledge first · trusted web sources when needed

Engineering  /  Mathematics  — Computation and Sources

Parameter Sizes, Records and Live References

Where to obtain current key size recommendations, factoring records and post-quantum guidance, and why they are not reproduced here.

Page KV-MATH-0474Reading time 4 minReviewed 2026-08-07Author Kevin Jogin

Executive summary

Key size recommendations, computational records and migration timelines all change, and a static page carrying them becomes misleading rather than merely stale.

This page records the durable method for deriving a recommendation and routes to maintained sources for the figures.

Learning objectives

  1. Understand how key size recommendations are derived.
  2. Identify the categories of authoritative source.
  3. Recognise which facts are durable and which are not.

01The sourcing policy

Caution
This collection deliberately does not reproduce current record sizes, effort figures, recommended key lengths or migration deadlines. Records fall, guidance is revised, and a page carrying stale numbers is worse than one carrying none.

The same policy applies across the KEVOS mathematics collections. The durable layer — definitions, algorithms, complexity results and the reasoning by which parameters are chosen — is authored here. Numeric data with a shelf life is routed to maintained sources.

What this collection carries and what it does not
DurableNot durable
Why NFS has L(1/3) complexityThe current factoring record
How a key size follows from a recordThe recommended key size
Why quantum computers break RSAThe migration deadline
What a security level meansWhich algorithms meet it today

02How a recommendation is derived

  1. Take a completed record

    A published factorisation or discrete logarithm computation with its effort accounting in core-years.

  2. Extrapolate by the complexity formula

    The L(1/3) expression predicts effort at other parameter sizes.

  3. Project hardware improvement

    Allow for cost per operation falling over the intended protection period.

  4. Add a margin for algorithmic risk

    Allow for improvements to the algorithms themselves, which cannot be predicted.

  5. Publish a minimum size

    Standards bodies convert the result into recommendations by protection period.

Caution
Every step after the first is a judgement. Different bodies make different assumptions and publish different numbers for the same protection period, which is why comparison sites exist and why a single figure quoted without its source is not useful.

The extrapolation also assumes no algorithmic breakthrough. A materially better factoring algorithm would invalidate every recommendation simultaneously.

03Categories of source

  • Standards bodies

    National and international organisations publish key length recommendations by protection period, revised periodically.

  • Comparison services

    Maintained sites aggregating the recommendations of different bodies side by side, which makes the spread of expert opinion visible.

  • Record announcements

    Published by the teams performing the computations, with full effort accounting — the primary data for extrapolation.

  • Post-quantum guidance

    Migration timelines and algorithm selections, published separately and currently moving faster than classical guidance.

For any specific decision, consult a current source at the time of the decision. The reasoning on this page tells you what to look for and how to interpret it; it deliberately does not tell you the answer, because the answer changes.

Note
The post-quantum dimension is the one moving fastest. A sufficiently large fault-tolerant quantum computer would break RSA and discrete-log cryptography outright via Shor's algorithm, rather than merely requiring larger parameters. Migration guidance is being revised on a much shorter cycle than classical key size guidance, and anything written here would date quickly.

04Frequently asked questions

Why not include figures with a review date?

Because pages are read long after they are written and the review date is easily missed. Routing to a maintained source is more reliable than dating a static figure, and it fails safe.

Does the Riemann hypothesis affect key sizes?

No. It concerns the distribution of primes, not the difficulty of factoring. A proof would sharpen various estimates and settle conditional theorems, and would supply no factoring algorithm.

How urgent is post-quantum migration?

Urgent for data requiring long-term confidentiality, because encrypted traffic captured now could be decrypted once a sufficiently large quantum computer exists. Current guidance from standards bodies is the appropriate source for timelines.

Related pages

  • The Number Field Sieve and Factoring Records
  • The RSA Cryptosystem
  • The Diffie-Hellman Key Establishment Protocol
  • Arbitrary Precision Arithmetic in Practice

Sources and method

Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — orientation page, no single source section.

This page carries the durable method layer only: definitions, constructions, algorithms, complexity results and selection criteria, authored originally for KEVOS. No text is transcribed or paraphrased from the source, and no numeric tables or benchmark data are reproduced — these are routed to live authoritative sources instead.

Forward reference: this page extends beyond the source text and is flagged as post-source.

Author: Kevin Jogin. Last reviewed 2026-08-07.

Continue learning

Arbitrary Precision Arithmetic in PracticeArticle · Engineering MathematicsComputational Number Theory: Tools and LibrariesArticle · Engineering MathematicsFaster Square-Free DecompositionArticle · Engineering MathematicsDeterministic Polynomial Factorization AlgorithmsArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®