On the public citation graph

Multiplikation großer Zahlen

https://doi.org/10.1007/bf02234362
0 signed · 27 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-95327-9openalex-snapshot
Aufzählbarkeit Entscheidbarkeit Berechenbarkeit
inferredcites →https://doi.org/10.1007/978-3-662-01462-2openalex-snapshot
Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit
inferredcites →https://doi.org/10.1090/s0025-5718-1961-0120187-1openalex-snapshot
On Modular Computation
inferredcites →https://doi.org/10.1145/321052.321057openalex-snapshot
The Use of Index Calculus and Mersenne Primes for the Design of a High-Speed Digital Multiplier

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11792086_37openalex-snapshot
20 Years of ECM
inferred← citeshttps://doi.org/10.1007/3-540-07407-4_14openalex-snapshot
On the complexity of computations under varying sets of primitives
inferred← citeshttps://doi.org/10.1007/bf01084283openalex-snapshot
Complexity of algorithms and computations
inferred← citeshttps://doi.org/10.1007/bf02242355openalex-snapshot
Schnelle Multiplikation großer Zahlen
inferred← citeshttps://doi.org/10.1007/s10559-025-00788-6openalex-snapshot
An Efficient Algorithm for Squaring Multi-Word Numbers
inferred← citeshttps://doi.org/10.1007/s10559-026-00908-wopenalex-snapshot
A Multiword Multiplication Algorithm Based on the Mersenne Transform
inferred← citeshttps://doi.org/10.1007/s11424-024-2452-5openalex-snapshot
A Generalized MSST Algorithm for Counting Points of Elliptic Curves over $$\mathbb{F}_{p^{n}}$$
inferred← citeshttps://doi.org/10.1016/j.jco.2005.05.001openalex-snapshot
Festschrift in honor of Arnold Schönhage
inferred← citeshttps://doi.org/10.1016/j.jco.2016.03.001openalex-snapshot
Even faster integer multiplication
inferred← citeshttps://doi.org/10.1017/9781139049801.011openalex-snapshot
Fast multiplication and its applications
inferred← citeshttps://doi.org/10.1090/s0002-9947-1969-0249212-8openalex-snapshot
On the Minimum Computation Time of Functions
inferred← citeshttps://doi.org/10.1090/s0025-5718-01-01393-xopenalex-snapshot
Hensel lifting and bivariate polynomial factorisation over finite fields
inferred← citeshttps://doi.org/10.1109/12.280803openalex-snapshot
Maximal and near-maximal shift register sequences: efficient event counters and easy discrete logarithms
inferred← citeshttps://doi.org/10.1109/icrc.2018.8638618openalex-snapshot
Multiplication with Fourier Optics Simulating 16-Bit Modular Multiplication
inferred← citeshttps://doi.org/10.1109/swat.1971.20openalex-snapshot
On decreasing the computing time for modular arithmetic
inferred← citeshttps://doi.org/10.1137/070711761openalex-snapshot
Faster Integer Multiplication
inferred← citeshttps://doi.org/10.1145/1250790.1250800openalex-snapshot
Faster integer multiplication
inferred← citeshttps://doi.org/10.1145/1277548.1277561openalex-snapshot
Time-and space-efficient evaluation of some hypergeometric constants
inferred← citeshttps://doi.org/10.1145/3505584openalex-snapshot
Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)
inferred← citeshttps://doi.org/10.1145/3637529.3637534openalex-snapshot
On a Two-Layer Modular Arithmetic
inferred← citeshttps://doi.org/10.20535/1560-8956.44.2024.302429openalex-snapshot
Метод прискореного модулярного множення для ефективної реалізації механізмів криптографічного захисту з відкритим ключем
inferred← citeshttps://doi.org/10.34229/kca2522-9664.26.5.4openalex-snapshot
A MULTIWORD MULTIPLICATION ALGORITHM BASED ON THE MERSENNE TRANSFORM
inferred← citeshttps://doi.org/10.47749/t/unicamp.2012.905908openalex-snapshot
Protocolos criptográficos de identificação baseados em reticulados
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.