KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesInteger MultiplicationEngineering · Engineering MathematicsLesson 549/883← PrevNext →
GuidePublished 7 Aug 2026Updated 13 Aug 20268 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIInteger Multiplication

KEVOS knowledge first · trusted web sources when needed

Engineering  /  Mathematics  — Integer Algorithms

Integer Multiplication

Schoolbook multiplication of multiprecision integers, the accumulator requirement, and where the quadratic cost comes from.

Page KV-MATH-0321Reading time 3 minReviewed 2026-08-07Author Kevin Jogin

Executive summary

Schoolbook multiplication forms every pairwise product of digits and accumulates them into the correct positions, costing a number of digit multiplications equal to the product of the operand lengths.

It remains the method of choice below a crossover point that is surprisingly high in practice, typically in the hundreds or thousands of bits depending on implementation quality.

Learning objectives

  1. State the schoolbook algorithm and its cost.
  2. Determine the accumulator width required.
  3. Recognise when to switch to a subquadratic method.

01The algorithm

Algorithm

Schoolbook multiplication

Inputa with m digits, b with n digits
Outputa · b, at most m + n digits
  1. Allocate a result array of m + n digits, initialised to zero.
  2. For i from 0 to m−1: set carry c = 0.
  3.   For j from 0 to n−1: compute t = r_{i+j} + aᵢ · bⱼ + c; set r_{i+j} = t mod B, c = t div B.
  4.   Set r_{i+n} = r_{i+n} + c.
  5. Strip leading zeros and return r.
Cost  O(mn) digit operations, so O(ℓ²) for equal lengths
Caution
The accumulator in the inner loop must hold (B−1)² + 2(B−1), which is just under B². With a 64-bit base this requires a 128-bit intermediate. Implementations that use only the native word width here silently truncate and produce wrong answers on large inputs.

02Where the quadratic cost is unavoidable

Every digit of a must interact with every digit of b, because each contributes to the product. Schoolbook does exactly mn digit multiplications, which is the obvious count and for a long time was assumed optimal.

It is not. Karatsuba's method computes the product of two-digit-groups with three multiplications rather than four, by reusing a sum, and recursion drives the exponent down to log₂3 ≈ 1.585. Further methods reduce it further.

  1. SchoolbookO(ℓ²)Best below the crossover; simple and cache-friendly
  2. KaratsubaO(ℓ^1.585)Crossover typically a few hundred bits
  3. Toom–CookO(ℓ^1.465) and lowerFamily parameterised by split count
  4. Schönhage–StrassenO(ℓ log ℓ log log ℓ)FFT-based; crossover in the tens of thousands of bits

03Squaring as a special case

Squaring admits a genuine saving over general multiplication. Since aᵢaⱼ and aⱼaᵢ are equal, the off-diagonal products need computing only once and doubling, roughly halving the digit multiplications.

a² = Σᵢ aᵢ²B^{2i} + 2Σ_{i<j} aᵢaⱼB^{i+j}
Note
The saving matters because modular exponentiation is dominated by squarings — a repeated-squaring chain performs one squaring per exponent bit and a multiplication only on set bits. A dedicated squaring routine is therefore one of the higher-value optimisations in a cryptographic library.

04Frequently asked questions

Why is the crossover for Karatsuba so high?

Because Karatsuba trades multiplications for additions and recursion overhead, and additions are cheap while function calls and memory traffic are not. A well-optimised schoolbook inner loop with good cache behaviour beats a naive Karatsuba implementation for a long way up.

Does the result always have m + n digits?

At most. It has m + n − 1 or m + n, depending on whether the leading digits produce a carry out. Allocating m + n and stripping is simpler than predicting which.

Is FFT multiplication used in practice?

In general-purpose libraries such as GMP, yes, for very large operands. For cryptographic sizes of a few thousand bits it is not competitive, so RSA implementations rarely reach past Karatsuba or Toom–Cook.

Related pages

  • Faster Integer Arithmetic: Karatsuba and Beyond
  • Integer Addition and Subtraction
  • Integer Division with Remainder

Sources and method

Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 42-45.

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.

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

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Integer Multiplication. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Integer Multiplication as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—multiplication, schoolbook, quadratic, cost, integer—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

  1. Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
  2. Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
  3. Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
  4. Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
  5. Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

StageRecordQuality check
InputObjects, domain, notation, assumptionsEvery symbol is defined
MethodPermitted operation or cited result at each stepAll hypotheses hold
OutputExact result and representationCorrect type, domain and form
VerificationSubstitution, invariant or alternative derivationIndependent agreement
Boundary testZero, identity, degenerate or failed hypothesisScope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

  • Can every symbol be traced to a definition or prior result?
  • Which hypothesis does each major step use?
  • Does the method cover zero, identity, degenerate and boundary cases?
  • Can the conclusion be checked by a second representation or calculation?
  • Are mandatory requirements distinguished from recommendations and illustrative values?
  • Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
  • Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
  • Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Integer Multiplication?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which assumption about multiplication would change the result most if it proved false?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What evidence would allow an independent reviewer to reproduce or challenge the conclusion?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which boundary, exception or failure case has not yet been tested?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What must be handed over, monitored or reviewed after the immediate work is complete?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Authoritative references and use notes

The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.

  • MIT OpenCourseWare — Number Theory I — Massachusetts Institute of Technology. Used for algebraic and analytic number theory. Accessed 2026-08-13.
  • MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.

Continue learning

Integer Addition and SubtractionGuide · Engineering MathematicsNEXT LESSON →Integer Division with RemainderGuide · Engineering MathematicsRepresenting Large IntegersGuide · Engineering MathematicsComputing in the Integers Modulo nGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®