On the public citation graph
Schnelle Multiplikation von Polynomen �ber K�rpern der Charakteristik 2
0 signed · 179 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02242355openalex-snapshot
Schnelle Multiplikation großer Zahlen
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.10011openalex-snapshot
Analysis of Rabin's irreducibility test for polynomials over finite fields
inferred← citeshttps://doi.org/10.1006/jcom.2000.0571openalex-snapshot
A Gröbner Free Alternative for Polynomial System Solving
inferred← citeshttps://doi.org/10.1006/jsco.1998.0224openalex-snapshot
Factoring in Skew-polynomial Rings over Finite Fields
inferred← citeshttps://doi.org/10.1006/jsco.1999.0308openalex-snapshot
Efficient Decomposition of Associative Algebras over Finite Fields
inferred← citeshttps://doi.org/10.1006/jsco.1999.0309openalex-snapshot
Algorithms for Exponentiation in Finite Fields
inferred← citeshttps://doi.org/10.1006/jsco.1999.1002openalex-snapshot
Factoring Polynomials Over Finite Fields: A Survey
inferred← citeshttps://doi.org/10.1007/11554868_3openalex-snapshot
Introducing a New Variant of Fast Algebraic Attacks and Minimizing Their Successive Data Complexity
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_72openalex-snapshot
Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplication
inferred← citeshttps://doi.org/10.1007/3-540-16766-8_19openalex-snapshot
AT2-optimal galois field multiplier for VLSI
inferred← citeshttps://doi.org/10.1007/3-540-44499-8_21openalex-snapshot
Montgomery Multiplier and Squarer in GF(2m)
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_9openalex-snapshot
How to Fool an Unbounded Adversary with a Short Key
inferred← citeshttps://doi.org/10.1007/3-540-48059-5_24openalex-snapshot
Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_98openalex-snapshot
Gauss periods and fast exponentiation in finite fields
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_8openalex-snapshot
Exponentiation in finite fields: Theory and practice
inferred← citeshttps://doi.org/10.1007/978-3-031-54773-7_2openalex-snapshot
Algorithmic Views of Vectorized Polynomial Multipliers – NTRU Prime
inferred← citeshttps://doi.org/10.1007/978-3-031-68382-4_3openalex-snapshot
Exploring the Advantages and Challenges of Fermat NTT in FHE Acceleration
inferred← citeshttps://doi.org/10.1007/978-3-319-16715-2_17openalex-snapshot
Efficient Leakage Resilient Circuit Compilers
inferred← citeshttps://doi.org/10.1007/978-3-319-19216-1_15openalex-snapshot
Arithmetic in the Finite Fields Using Optimal Normal and Polynomial Bases in Combination
inferred← citeshttps://doi.org/10.1007/978-3-319-72453-9_9openalex-snapshot
Implementing Fast Carryless Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-540-24633-6_4openalex-snapshot
Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-540-25937-4_5openalex-snapshot
Improving Fast Algebraic Attacks
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_49openalex-snapshot
Fast Multipoint Evaluation of Bivariate Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-540-73074-3_10openalex-snapshot
Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
inferred← citeshttps://doi.org/10.1007/978-3-540-79456-1_10openalex-snapshot
Faster Multiplication in GF(2)[x]
inferred← citeshttps://doi.org/10.1007/978-3-540-85855-3_17openalex-snapshot
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_4openalex-snapshot
Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$
inferred← citeshttps://doi.org/10.1007/978-3-642-04159-4_23openalex-snapshot
Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering
inferred← citeshttps://doi.org/10.1007/978-3-642-05445-7_23openalex-snapshot
An Efficient Residue Group Multiplication for the η T Pairing over ${\mathbb F}_{3^m}$
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_8openalex-snapshot
Faster Polynomial Multiplication via Discrete Fourier Transforms
inferred← citeshttps://doi.org/10.1007/978-3-642-31662-3_16openalex-snapshot
Improving the Berlekamp Algorithm for Binomials x n − a
inferred← citeshttps://doi.org/10.1007/978-3-642-60539-0_27openalex-snapshot
Tests and Constructions of Irreducible Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1007/bf01178683openalex-snapshot
On fast multiplication of polynomials over arbitrary algebras
inferred← citeshttps://doi.org/10.1007/bf01272074openalex-snapshot
Computing Frobenius maps and factoring polynomials
inferred← citeshttps://doi.org/10.1007/bfb0054305openalex-snapshot
Analysis of Rabin's polynomial irreducibility test
inferred← citeshttps://doi.org/10.1007/s00145-004-0221-0openalex-snapshot
Polynomial and Normal Bases for Finite Fields
inferred← citeshttps://doi.org/10.1007/s00200-002-0109-xopenalex-snapshot
Computing Parametric Geometric Resolutions
inferred← citeshttps://doi.org/10.1007/s00200-015-0269-0openalex-snapshot
On the complexity of skew arithmetic
inferred← citeshttps://doi.org/10.1007/s00200-019-00389-9openalex-snapshot
Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
inferred← citeshttps://doi.org/10.1007/s00200-024-00655-5openalex-snapshot
Sparse polynomial interpolation: faster strategies over finite fields
inferred← citeshttps://doi.org/10.1007/s00200-024-00669-zopenalex-snapshot
Approximate contact factorization of germs of plane curves
inferred← citeshttps://doi.org/10.1007/s00200-025-00690-wopenalex-snapshot
Optimizing the half-gcd algorithm
inferred← citeshttps://doi.org/10.1007/s10958-013-1350-5openalex-snapshot
Complexity of computation in finite fields
inferred← citeshttps://doi.org/10.1007/s11128-024-04330-zopenalex-snapshot
Entropically secure encryption with faster key expansion
inferred← citeshttps://doi.org/10.1007/s13389-022-00293-yopenalex-snapshot
Karatsuba-based square-root Vélu’s formulas applied to two isogeny-based protocols
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90195-4openalex-snapshot
On the deterministic complexity of factoring polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/0041-5553(79)90124-1openalex-snapshot
The algebraic complexity of computing a family of bilinear forms
inferred← citeshttps://doi.org/10.1016/0097-3165(89)90020-4openalex-snapshot
On arithmetical algorithms over finite fields
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90010-7openalex-snapshot
An algorithm for polynomial multiplication that does not depend on the ring constants
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90119-7openalex-snapshot
A lower bound for polynomial multiplication
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90081-8openalex-snapshot
Factoring polynomials and primitive elements for special primes
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50016-3openalex-snapshot
Algebraic Complexity Theory
inferred← citeshttps://doi.org/10.1016/j.dam.2017.01.033openalex-snapshot
A note on the multiple-recursive matrix method for generating pseudorandom vectors
inferred← citeshttps://doi.org/10.1016/j.ffa.2008.07.004openalex-snapshot
Elliptic periods for finite fields
inferred← citeshttps://doi.org/10.1016/j.jco.2004.09.009openalex-snapshot
Polynomial evaluation and interpolation on special sets of points
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.2019.03.004openalex-snapshot
Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
inferred← citeshttps://doi.org/10.1016/j.jco.2021.101574openalex-snapshot
Fast amortized multi-point evaluation
inferred← citeshttps://doi.org/10.1016/j.jco.2022.101693openalex-snapshot
Amortized multi-point evaluation of multivariate polynomials
inferred← citeshttps://doi.org/10.1016/j.jnt.2012.07.007openalex-snapshot
Elliptic periods and primality proving
inferred← citeshttps://doi.org/10.1016/j.jsc.2005.07.001openalex-snapshot
Fast computation of special resultants
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.04.019openalex-snapshot
Fast arithmetic for triangular sets: From theory to practice
inferred← citeshttps://doi.org/10.1016/j.jsc.2009.05.004openalex-snapshot
Faster polynomial multiplication via multipoint Kronecker substitution
inferred← citeshttps://doi.org/10.1016/j.jsc.2012.06.004openalex-snapshot
On the bit-complexity of sparse polynomial and series multiplication
inferred← citeshttps://doi.org/10.1016/j.jsc.2015.11.012openalex-snapshot
An isomorphism test for modules over a non-commutative PID. Applications to similarity of Ore polynomials
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.04.018openalex-snapshot
Computing the bound of an Ore polynomial. Applications to factorization
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.08.005openalex-snapshot
Fast systematic encoding of multiplicity codes
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.002openalex-snapshot
Normal bases from 1-dimensional algebraic groups
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.014openalex-snapshot
Fast Hermite interpolation and evaluation over finite fields of characteristic two
inferred← citeshttps://doi.org/10.1016/j.jsc.2022.07.008openalex-snapshot
Fast computation of the N-th term of a q-holonomic sequence and applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.012openalex-snapshot
Fast arithmetic with general Gauß periods
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.014openalex-snapshot
A cache-friendly truncated FFT
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.048openalex-snapshot
A note on Gao’s algorithm for polynomial factorization
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.04.029openalex-snapshot
Improved method for finding optimal formulas for bilinear maps in a finite field
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00071-3openalex-snapshot
Efficient decomposition of separable algebras
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80014-4openalex-snapshot
Functional decomposition ofpolynomials: the tame case
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80054-5openalex-snapshot
Functional decomposition of polynomials: The wild case
inferred← citeshttps://doi.org/10.1017/9781139049801.011openalex-snapshot
Fast multiplication and its applications
inferred← citeshttps://doi.org/10.1070/rm1979v034n02abeh002923openalex-snapshot
THE RANK OF A PAIR OF MATRICES AND CONVOLUTION
inferred← citeshttps://doi.org/10.1090/conm/461/08982openalex-snapshot
A multi-level blocking distinct-degree factorization algorithm
inferred← citeshttps://doi.org/10.1090/s0025-5718-02-01421-7openalex-snapshot
Polynomial factorization over 𝔽₂
inferred← citeshttps://doi.org/10.1090/s0025-5718-03-01599-0openalex-snapshot
Computing special powers in finite fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-1985-0790658-xopenalex-snapshot
Factorization of Multivariate Polynomials Over Finite Fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-1990-0993933-0openalex-snapshot
New algorithms for finding irreducible polynomials over finite fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-1992-1134717-4openalex-snapshot
Irregular Primes to One Million
inferred← citeshttps://doi.org/10.1090/s0025-5718-2011-02461-0openalex-snapshot
Irregular primes to 163 million
inferred← citeshttps://doi.org/10.1090/s0025-5718-99-01139-4openalex-snapshot
Relative class number of imaginary Abelian fields of prime conductor below 10000
inferred← citeshttps://doi.org/10.1103/physreva.108.052405openalex-snapshot
Quantum multiplication algorithm based on the convolution theorem
inferred← citeshttps://doi.org/10.1109/12.29475openalex-snapshot
AT/sup 2/-optimal Galois field multiplier for VLSI
inferred← citeshttps://doi.org/10.1109/12.30855openalex-snapshot
A new algorithm for multiplication in finite fields
inferred← citeshttps://doi.org/10.1109/18.179343openalex-snapshot
New array codes for multiple phased burst correction
inferred← citeshttps://doi.org/10.1109/18.556111openalex-snapshot
Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences
inferred← citeshttps://doi.org/10.1109/18.6045openalex-snapshot
Encoding and decoding of BCH codes using light and short codewords
inferred← citeshttps://doi.org/10.1109/18.75248openalex-snapshot
Maximum-rank array codes and their application to crisscross error correction
inferred← citeshttps://doi.org/10.1109/ccc.2012.39openalex-snapshot
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators
inferred← citeshttps://doi.org/10.1109/focs.2014.41openalex-snapshot
Novel Polynomial Basis and Its Application to Reed-Solomon Erasure Codes
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206584openalex-snapshot
Efficient Interpolation-Based Decoding of Reed-Solomon Codes
inferred← citeshttps://doi.org/10.1109/sfcs.1981.37openalex-snapshot
Probabilistic algorithms in finite fields
inferred← citeshttps://doi.org/10.1109/sfcs.1987.29openalex-snapshot
Functional decomposition of polynomials
inferred← citeshttps://doi.org/10.1109/sfcs.1987.41openalex-snapshot
Multiplicative complexity of polynomial multiplication over finite fields
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21944openalex-snapshot
New algorithms for finding irreducible polynomials over finite fields
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267812openalex-snapshot
Fast algorithms for matrix normal forms
inferred← citeshttps://doi.org/10.1109/tc.2002.1017695openalex-snapshot
Bit-parallel finite field multiplier and squarer using polynomial basis
inferred← citeshttps://doi.org/10.1109/tc.2010.141openalex-snapshot
Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation
inferred← citeshttps://doi.org/10.1109/tc.2018.2874662openalex-snapshot
Better Circuits for Binary Polynomial Multiplication
inferred← citeshttps://doi.org/10.1109/tit.1986.1057137openalex-snapshot
Solving sparse linear equations over finite fields
inferred← citeshttps://doi.org/10.1109/tit.2005.864438openalex-snapshot
How to fool an unbounded adversary with a short key
inferred← citeshttps://doi.org/10.1109/tit.2010.2079016openalex-snapshot
Additive Fast Fourier Transforms Over Finite Fields
inferred← citeshttps://doi.org/10.1109/tit.2016.2600417openalex-snapshot
FFT Algorithm for Binary Extension Finite Fields and Its Application to Reed–Solomon Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2608892openalex-snapshot
Novel Polynomial Basis With Fast Fourier Transform and Its Application to Reed–Solomon Erasure Codes
inferred← citeshttps://doi.org/10.1109/tit.2025.3605160openalex-snapshot
Nearly-Linear Time Seeded Extractors With Short Seeds
inferred← citeshttps://doi.org/10.1112/s1461157014000138openalex-snapshot
Finding roots in with the successive resultants algorithm
inferred← citeshttps://doi.org/10.1134/s0001434615030256openalex-snapshot
Arithmetic complexity of certain linear transformations
inferred← citeshttps://doi.org/10.1134/s1990478911020074openalex-snapshot
On the complexity of linear boolean operators with thin matrices
inferred← citeshttps://doi.org/10.1137/0209024openalex-snapshot
Probabilistic Algorithms in Finite Fields
inferred← citeshttps://doi.org/10.1137/16m1062855openalex-snapshot
On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms
inferred← citeshttps://doi.org/10.1137/s0097539704443793openalex-snapshot
Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
inferred← citeshttps://doi.org/10.1137/s0097539705446810openalex-snapshot
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
inferred← citeshttps://doi.org/10.1137/s0097539793252687openalex-snapshot
Nearly Optimal Algorithms for Canonical Matrix Forms
inferred← citeshttps://doi.org/10.1145/1007352.1007361openalex-snapshot
Robust pcps of proximity, shorter pcps and applications to coding
inferred← citeshttps://doi.org/10.1145/12130.12163openalex-snapshot
Uniform closure properties of P-computable functions
inferred← citeshttps://doi.org/10.1145/1277548.1277585openalex-snapshot
Fast arithmetic for triangular sets
inferred← citeshttps://doi.org/10.1145/129712.129722openalex-snapshot
Computing Frobenius maps and factoring polynomials
inferred← citeshttps://doi.org/10.1145/1993886.1993930openalex-snapshot
Fast fourier transforms over poor fields
inferred← citeshttps://doi.org/10.1145/236869.236882openalex-snapshot
Arithmetic and factorization of polynomial over F2 (extended abstract)
inferred← citeshttps://doi.org/10.1145/258726.258777openalex-snapshot
Fast polynomial factorization over high algebraic extensions of finite fields
inferred← citeshttps://doi.org/10.1145/2608628.2608665openalex-snapshot
On isomorphisms of modules over non-commutative PID
inferred← citeshttps://doi.org/10.1145/2755996.2756674openalex-snapshot
A Fast Algorithm for Computing the P-curvature
inferred← citeshttps://doi.org/10.1145/2930889.2930897openalex-snapshot
Computation of the Similarity Class of the p-Curvature
inferred← citeshttps://doi.org/10.1145/2930889.2930904openalex-snapshot
Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field
inferred← citeshttps://doi.org/10.1145/2930889.2930920openalex-snapshot
Fast Polynomial Multiplication over F260
inferred← citeshttps://doi.org/10.1145/3005344openalex-snapshot
Faster Polynomial Multiplication over Finite Fields
inferred← citeshttps://doi.org/10.1145/309831.309869openalex-snapshot
Computing special powers in finite fields
inferred← citeshttps://doi.org/10.1145/31846.31850openalex-snapshot
A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor
inferred← citeshttps://doi.org/10.1145/3208976.3209003openalex-snapshot
Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases
inferred← citeshttps://doi.org/10.1145/3313880.3313882openalex-snapshot
Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
inferred← citeshttps://doi.org/10.1145/3373207.3404060openalex-snapshot
Computing the N-th term of a q-holonomic sequence
inferred← citeshttps://doi.org/10.1145/3476446.3535471openalex-snapshot
Algorithms for Discrete Differential Equations of Order 1
inferred← citeshttps://doi.org/10.1145/3476446.3535493openalex-snapshot
On the Complexity of Symbolic Computation
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/3747199.3747572openalex-snapshot
Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings
inferred← citeshttps://doi.org/10.1145/42267.45069openalex-snapshot
Greatest common divisors of polynomials given by straight-line programs
inferred← citeshttps://doi.org/10.1145/58562.214082openalex-snapshot
A note on probabilistically verifying integer and polynomial products
inferred← citeshttps://doi.org/10.1145/58562.59306openalex-snapshot
Multiplicative complexity of polynomial multiplication over finite fields
inferred← citeshttps://doi.org/10.1515/dma.2001.11.4.327openalex-snapshot
On a quick multiplication in normal bases of finite fields
inferred← citeshttps://doi.org/10.1561/0400000063openalex-snapshot
Complexity of Linear Boolean Operators
inferred← citeshttps://doi.org/10.3103/s0027132209040019openalex-snapshot
The complexity and depth of Boolean circuits for multiplication and inversion in some fields GF(2 n )
inferred← citeshttps://doi.org/10.3103/s0027132214060047openalex-snapshot
The arithmetic computational complexity of linear transforms
inferred← citeshttps://doi.org/10.3233/fi-2010-346openalex-snapshot
Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields
inferred← citeshttps://doi.org/10.4213/dm1023openalex-snapshot
О построении схем логарифмической глубины для инвертирования в конечных полях
inferred← citeshttps://doi.org/10.4213/dm1218openalex-snapshot
О сложности и глубине булевых схем для умножения и инвертирования в конечных полях характеристики 2
inferred← citeshttps://doi.org/10.4213/dm1224openalex-snapshot
О реализации умножения полиномиальных матриц над полем $GF(2)$ с помощью быстрого преобразования Фурье
inferred← citeshttps://doi.org/10.4213/dm1301openalex-snapshot
Арифметическая сложность преобразований Стирлинга
inferred← citeshttps://doi.org/10.4213/dm294openalex-snapshot
О быстром умножении в нормальных базисах конечных полей
inferred← citeshttps://doi.org/10.4213/dm340openalex-snapshot
Замечания о быстром умножении многочленов, преобразовании Фурье и Хартли
inferred← citeshttps://doi.org/10.4213/mzm10176openalex-snapshot
Арифметическая сложность некоторых линейных преобразований
inferred← citeshttps://doi.org/10.48550/arxiv.0710.4410openalex-snapshot
A Multi-level Blocking Distinct Degree Factorization Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.0901.4323openalex-snapshot
On the bit-complexity of sparse polynomial multiplication
inferred← citeshttps://doi.org/10.48550/arxiv.1004.5433openalex-snapshot
Some Results on the Functional Decomposition of Polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1708.09746openalex-snapshot
Faster Multiplication for Long Binary Polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1712.03693openalex-snapshot
Faster integer and polynomial multiplication using cyclotomic coefficient rings
inferred← citeshttps://doi.org/10.48550/arxiv.1803.11301openalex-snapshot
Multiplying boolean Polynomials with Frobenius Partitions in Additive Fast Fourier Transform
inferred← citeshttps://doi.org/10.48550/arxiv.1809.09906openalex-snapshot
Normal Bases using 1-dimensional Algebraic Groups
inferred← citeshttps://doi.org/10.48550/arxiv.2106.08759openalex-snapshot
OpenSSLNTRU: Faster post-quantum TLS key exchange
inferred← citeshttps://doi.org/10.5220/0002126102290236openalex-snapshot
SUBQUADRATIC BINARY FIELD MULTIPLIER IN DOUBLE POLYNOMIAL SYSTEM
inferred← citeshttps://doi.org/10.5555/1496770.1496855openalex-snapshot
From coding theory to efficient pattern matching
inferred← citeshttps://doi.org/10.5802/ccirm.9openalex-snapshot
Algorithmes rapides pour les polynômes, séries formelles et matrices
inferred← citeshttps://doi.org/10.62056/a0ivr-10kopenalex-snapshot
A Survey of Polynomial Multiplications for Lattice-Based Cryptosystems
inferred← citeshttps://doi.org/10.70675/11c7d7eaz46d1z49c4z9892zd0e19ad23ed0openalex-snapshot
Scalar complexity of Chudnovsky-type algorithms of multiplication in finite fields
inferred← citeshttps://doi.org/10.70675/48b883c9zae92z4527z9c63z80dd166980a6openalex-snapshot
Cryptanalysis of symmetric encryption algorithms
inferred← citeshttps://doi.org/10.70675/d6bccc99z42a7z4023za9f5z18124c58373fopenalex-snapshot
Fast finite field arithmetic
inferred← citeshttps://doi.org/10.70675/d8ca44b8zb45cz479az80a3zd34deb5c4454openalex-snapshot
Bases of relations in one or several variables : fast algorithms and applications
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.