On the public citation graph
Computing Frobenius maps and factoring polynomials
0 signed · 189 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/3-540-39757-4_20openalex-snapshot
Discrete logarithms in finite fields and their cryptographic significance
inferredcites →https://doi.org/10.1007/978-94-011-1806-4openalex-snapshot
Computational and Algorithmic Problems in Finite Fields
inferredcites →https://doi.org/10.1007/bf00289470openalex-snapshot
Schnelle Multiplikation von Polynomen �ber K�rpern der Charakteristik 2
inferredcites →https://doi.org/10.1007/bf01178683openalex-snapshot
On fast multiplication of polynomials over arbitrary algebras
inferredcites →https://doi.org/10.1007/bf02242355openalex-snapshot
Schnelle Multiplikation großer Zahlen
inferredcites →https://doi.org/10.1016/0020-0190(90)90195-4openalex-snapshot
On the deterministic complexity of factoring polynomials over finite fields
inferredcites →https://doi.org/10.1016/0022-0000(85)90043-1openalex-snapshot
Irreducibility of multivariate polynomials
inferredcites →https://doi.org/10.1016/0196-6774(88)90026-0openalex-snapshot
Addition requirements for matrix and transposed matrix products
inferredcites →https://doi.org/10.1016/0304-3975(83)90110-xopenalex-snapshot
The complexity of partial derivatives
inferredcites →https://doi.org/10.1016/0304-3975(87)90081-8openalex-snapshot
Factoring polynomials and primitive elements for special primes
inferredcites →https://doi.org/10.1016/0890-5401(91)90078-gopenalex-snapshot
Boolean circuits versus arithmetic circuits
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1016/s0747-7171(08)80158-7openalex-snapshot
Constructing normal bases in finite fields
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1080/02522667.1989.10698971openalex-snapshot
A Deterministic Algorithm for Factorizing Polynomials over Extensions GF(pm) of GF(p), p a Small Prime
inferredcites →https://doi.org/10.1090/s0025-5718-1969-0257039-xopenalex-snapshot
Factorization of Polynomials Over Finite Fields
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0276200-xopenalex-snapshot
Factoring polynomials over large finite fields
inferredcites →https://doi.org/10.1090/s0025-5718-1977-0422193-8openalex-snapshot
On the Efficiency of Algorithms for Polynomial Factoring
inferredcites →https://doi.org/10.1090/s0025-5718-1981-0606517-5openalex-snapshot
A New Algorithm for Factoring Polynomials Over Finite Fields
inferredcites →https://doi.org/10.1093/qmath/5.1.102openalex-snapshot
ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD
inferredcites →https://doi.org/10.1109/sfcs.1981.37openalex-snapshot
Probabilistic algorithms in finite fields
inferredcites →https://doi.org/10.1109/sfcs.1988.21943openalex-snapshot
Fast management of permutation groups
inferredcites →https://doi.org/10.1109/tit.1983.1056666openalex-snapshot
Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
inferredcites →https://doi.org/10.1137/0209024openalex-snapshot
Probabilistic Algorithms in Finite Fields
inferredcites →https://doi.org/10.1137/0212001openalex-snapshot
The Computational Complexity of Continued Fractions
inferredcites →https://doi.org/10.1137/0221018openalex-snapshot
Subgroup Refinement Algorithms for Root Finding in $GF(q)$
inferredcites →https://doi.org/10.1145/120694.120697openalex-snapshot
A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic
inferredcites →https://doi.org/10.1145/322092.322099openalex-snapshot
Fast Algorithms for Manipulating Formal Power Series
inferredcites →https://doi.org/10.1145/74540.74556openalex-snapshot
Solving systems of nonlinear polynomial equations faster
inferredcites →https://doi.org/10.1145/800205.806320openalex-snapshot
On square-free decomposition algorithms
inferredcites →https://doi.org/10.1201/9781003072157-9openalex-snapshot
Polynomial Factorization 1982–1986
inferredcites →https://doi.org/10.1515/9783110848632-006openalex-snapshot
Complexity of Algorithms in Algebraic Number Theory
inferredcites →https://doi.org/10.5555/313559.313865openalex-snapshot
Fast construction of irreducible polynomials over finite fields
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/jagm.2001.1158openalex-snapshot
The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
inferred← citeshttps://doi.org/10.1006/jcom.1998.0476openalex-snapshot
Fast Rectangular Matrix Multiplication and Applications
inferred← citeshttps://doi.org/10.1006/jsco.1994.1025openalex-snapshot
Fast Construction of Irreducible Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1006/jsco.1999.1001openalex-snapshot
On the Deterministic Complexity of Factoring Polynomials
inferred← citeshttps://doi.org/10.1006/jsco.1999.1002openalex-snapshot
Factoring Polynomials Over Finite Fields: A Survey
inferred← citeshttps://doi.org/10.1006/jsco.2000.0370openalex-snapshot
Challenges of Symbolic Computation: My Favorite Open Problems
inferred← citeshttps://doi.org/10.1007/3-540-45353-9_20openalex-snapshot
The Security of Hidden Field Equations (HFE)
inferred← citeshttps://doi.org/10.1007/3-540-57936-2_27openalex-snapshot
Constructive problems for irreducible polynomials over 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-030-05153-2_4openalex-snapshot
Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-031-30589-4_17openalex-snapshot
Breaking SIDH in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-031-62746-0_6openalex-snapshot
Polynomial XL: A Variant of the XL Algorithm Using Macaulay Matrices over Polynomial Rings
inferred← citeshttps://doi.org/10.1007/978-3-032-35374-0_15openalex-snapshot
Faster Polynomial Evaluations for SIMD FHEs and Application to BGV in HElib
inferred← citeshttps://doi.org/10.1007/978-3-319-10683-0_6openalex-snapshot
Open Problems for Polynomials over Finite Fields and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-70694-8_1openalex-snapshot
Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24633-6_8openalex-snapshot
What Do Random Polynomials over Finite Fields Look Like?
inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_15openalex-snapshot
Construction of Secure Random Curves of Genus 2 over Prime Fields
inferred← citeshttps://doi.org/10.1007/978-3-540-74496-2_14openalex-snapshot
Issues on Computer Search for Large Order Multiple Recursive Generators
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_15openalex-snapshot
Overview of Cryptanalysis Techniques in Multivariate Public Key Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_31openalex-snapshot
Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_29openalex-snapshot
Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation
inferred← citeshttps://doi.org/10.1007/978-3-642-27323-0_90openalex-snapshot
Multidimensional Data Reduction Based on Compressed Sensing for Sensor Network
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-56755-1_14openalex-snapshot
Gauß Periods in Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-56755-1_25openalex-snapshot
Algorithms for Factoring Polynomials over Finite Fields
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/bf01202042openalex-snapshot
Counting curves and their projections
inferred← citeshttps://doi.org/10.1007/bf02684415openalex-snapshot
A generalisation of the Cantor-Zassenhaus algorithm
inferred← citeshttps://doi.org/10.1007/bfb0023837openalex-snapshot
Polynomial factorization 1987–1991
inferred← citeshttps://doi.org/10.1007/bfb0054305openalex-snapshot
Analysis of Rabin's polynomial irreducibility test
inferred← citeshttps://doi.org/10.1007/s00037-013-0063-yopenalex-snapshot
Modular Composition Modulo Triangular Sets and Applications
inferred← citeshttps://doi.org/10.1007/s00037-020-00204-9openalex-snapshot
Subquadratic-Time Algorithms for Normal Bases
inferred← citeshttps://doi.org/10.1007/s00145-004-0221-0openalex-snapshot
Polynomial and Normal Bases for Finite Fields
inferred← citeshttps://doi.org/10.1007/s00145-019-09316-0openalex-snapshot
Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
inferred← citeshttps://doi.org/10.1007/s00200-021-00536-1openalex-snapshot
Univariate polynomial factorization over large 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/s00453-011-9537-yopenalex-snapshot
Interval Partitions and Polynomial Factorization
inferred← citeshttps://doi.org/10.1007/s10623-013-9875-7openalex-snapshot
Computing in degree $$2^k$$ 2 k -extensions of finite fields of odd characteristic
inferred← citeshttps://doi.org/10.1007/s10623-018-0568-0openalex-snapshot
Factorization of a class of composed polynomials
inferred← citeshttps://doi.org/10.1007/s11425-007-0169-2openalex-snapshot
Fast rectangular matrix multiplication and some applications
inferred← citeshttps://doi.org/10.1007/s13389-023-00329-xopenalex-snapshot
Probabilistic root finding in code-based cryptography
inferred← citeshttps://doi.org/10.1007/s44007-023-00053-2openalex-snapshot
Orienteering with One Endomorphism
inferred← citeshttps://doi.org/10.1016/j.amc.2007.05.038openalex-snapshot
A note on Gröbner bases and Berlekamp’s algorithm
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.10.003openalex-snapshot
Factoring polynomials of the form f(xn)∈Fq[x]
inferred← citeshttps://doi.org/10.1016/j.ffa.2018.08.003openalex-snapshot
Polynomial factorization over finite fields by computing Euler–Poincaré characteristics of Drinfeld modules
inferred← citeshttps://doi.org/10.1016/j.ffa.2025.102753openalex-snapshot
A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2009.04.013openalex-snapshot
An algorithm for Lang's Theorem
inferred← citeshttps://doi.org/10.1016/j.jco.2018.05.002openalex-snapshot
Modular composition via factorization
inferred← citeshttps://doi.org/10.1016/j.jnt.2010.07.003openalex-snapshot
Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.05.004openalex-snapshot
Deterministic distinct-degree factorization of polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.jsc.2006.02.007openalex-snapshot
Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.01.004openalex-snapshot
Elliptic Gauss sums and applications to point counting
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.09.003openalex-snapshot
Genus 2 point counting over prime fields
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.008openalex-snapshot
Fast arithmetics in Artin–Schreier towers over finite fields
inferred← citeshttps://doi.org/10.1016/j.jsc.2012.05.008openalex-snapshot
On the complexity of computing with zero-dimensional triangular sets
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.2019.02.011openalex-snapshot
Deterministic polynomial factoring over finite fields: A uniform approach via P -schemes
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.06.007openalex-snapshot
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.05.014openalex-snapshot
Solving structured linear systems with large displacement rank
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00174-5openalex-snapshot
On the degrees of irreducible factors of polynomials over a finite field
inferred← citeshttps://doi.org/10.1016/s0024-3795(96)00290-xopenalex-snapshot
On the Computation of Minimal Polynomials, Cyclic Vectors, and Frobenius Forms
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)80001-1openalex-snapshot
Univariate polynomial factorization over finite fields
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00291-1openalex-snapshot
Factoring polynomials over arbitrary finite fields
inferred← citeshttps://doi.org/10.1090/conm/461/08982openalex-snapshot
A multi-level blocking distinct-degree factorization algorithm
inferred← citeshttps://doi.org/10.1090/mcom/3363openalex-snapshot
Computing isomorphisms and embeddings of finite fields
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.1090/s0025-5718-02-01421-7openalex-snapshot
Polynomial factorization over 𝔽₂
inferred← citeshttps://doi.org/10.1090/s0025-5718-02-01422-9openalex-snapshot
Constructing hyperelliptic curves of genus 2 suitable for cryptography
inferred← citeshttps://doi.org/10.1090/s0025-5718-02-01428-xopenalex-snapshot
Factoring multivariate polynomials via partial differential equations
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-08-02200-xopenalex-snapshot
The complexity of class polynomial computation via floating point approximations
inferred← citeshttps://doi.org/10.1090/s0025-5718-1995-1265019-6openalex-snapshot
On a New Factorization Algorithm for Polynomials Over Finite Fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-2011-02505-6openalex-snapshot
Trading GRH for algebra: Algorithms for factoring polynomials and related structures
inferred← citeshttps://doi.org/10.1090/s0025-5718-2013-02715-9openalex-snapshot
Taking roots over high extensions of finite fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-2014-02800-7openalex-snapshot
A search for Wilson primes
inferred← citeshttps://doi.org/10.1090/s0025-5718-2014-02832-9openalex-snapshot
A subquadratic algorithm for computing the 𝑛-th Bernoulli number
inferred← citeshttps://doi.org/10.1090/s0025-5718-98-00944-2openalex-snapshot
Subquadratic-time factoring of polynomials over finite fields
inferred← citeshttps://doi.org/10.1109/focs.2008.13openalex-snapshot
Fast Modular Composition in any Characteristic
inferred← citeshttps://doi.org/10.1109/iciteics64870.2025.11341571openalex-snapshot
Analysis of Average Running Times and Complexity in Root-Finding Algorithms for Polynomial Factorization
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492484openalex-snapshot
Finding points on curves over finite fields
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646092openalex-snapshot
Deciding properties of polynomials without factoring
inferred← citeshttps://doi.org/10.1109/tc.2005.124openalex-snapshot
An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations
inferred← citeshttps://doi.org/10.1109/tcc.2014.2344662openalex-snapshot
Privacy-Preserving Data Storage in Cloud Using Array BP-XOR Codes
inferred← citeshttps://doi.org/10.1109/tit.2012.2204530openalex-snapshot
Multiproperty-Preserving Domain Extension Using Polynomial-Based Modes of Operation
inferred← citeshttps://doi.org/10.1109/tit.2015.2511784openalex-snapshot
Capacity of Non-Malleable Codes
inferred← citeshttps://doi.org/10.1112/s1461157013000296openalex-snapshot
Deterministic polynomial factoring and association schemes
inferred← citeshttps://doi.org/10.1112/s1461157014000138openalex-snapshot
Finding roots in with the successive resultants algorithm
inferred← citeshttps://doi.org/10.1137/08073408xopenalex-snapshot
Fast Polynomial Factorization and Modular Composition
inferred← citeshttps://doi.org/10.1137/140990401openalex-snapshot
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields
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/s0097539799351018openalex-snapshot
Finding Points on Curves over Finite Fields
inferred← citeshttps://doi.org/10.1142/s021819670500230xopenalex-snapshot
CONSTRUCTIVE RECOGNITION OF NORMALIZERS OF SMALL EXTRA-SPECIAL MATRIX GROUPS
inferred← citeshttps://doi.org/10.1142/s0218196706003128openalex-snapshot
EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS
inferred← citeshttps://doi.org/10.1145/1005285.1005289openalex-snapshot
Factoring polynomials via polytopes
inferred← citeshttps://doi.org/10.1145/1145768.1145814openalex-snapshot
Change of order for bivariate triangular sets
inferred← citeshttps://doi.org/10.1145/1182553.1182558openalex-snapshot
Solving structured linear systems of large displacement rank
inferred← citeshttps://doi.org/10.1145/1277548.1277554openalex-snapshot
Solving toeplitz- and vandermonde-like linear systems with large displacement rank
inferred← citeshttps://doi.org/10.1145/1277548.1277587openalex-snapshot
Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts
inferred← citeshttps://doi.org/10.1145/1374376.1374445openalex-snapshot
Fast polynomial factorization and modular composition in small characteristic
inferred← citeshttps://doi.org/10.1145/1576702.1576722openalex-snapshot
Fast arithmetics in artin-schreier towers over finite fields
inferred← citeshttps://doi.org/10.1145/1576702.1576730openalex-snapshot
Schemes for deterministic polynomial factoring
inferred← citeshttps://doi.org/10.1145/167088.167292openalex-snapshot
Counting curves and their projections
inferred← citeshttps://doi.org/10.1145/190347.190371openalex-snapshot
Factoring high-degree polynomials by the black box Berlekamp algorithm
inferred← citeshttps://doi.org/10.1145/225058.225166openalex-snapshot
Subquadratic-time factoring of polynomials over finite 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/236869.236884openalex-snapshot
Factoring modular polynomials (extended abstract)
inferred← citeshttps://doi.org/10.1145/236869.236886openalex-snapshot
Parallel distinct degree factorization algorithm
inferred← citeshttps://doi.org/10.1145/2465506.2465514openalex-snapshot
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
inferred← citeshttps://doi.org/10.1145/2554797.2554814openalex-snapshot
Capacity of non-malleable codes
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.2608672openalex-snapshot
Fast arithmetic for the algebraic closure of finite fields
inferred← citeshttps://doi.org/10.1145/266670.266680openalex-snapshot
Towards an efficient implementation of a fast algorithm for multipoint polynomial evaluation and its parallel processing
inferred← citeshttps://doi.org/10.1145/2755996.2756637openalex-snapshot
Algorithms for Finite Field Arithmetic
inferred← citeshttps://doi.org/10.1145/2930889.2930931openalex-snapshot
A Fast Algorithm for Computing the Truncated Resultant
inferred← citeshttps://doi.org/10.1145/309831.309859openalex-snapshot
Efficient computation of minimal polynomials in algebraic extensions of finite fields
inferred← citeshttps://doi.org/10.1145/3145573openalex-snapshot
Simultaneous Conversions with the Residue Number System Using Linear Algebra
inferred← citeshttps://doi.org/10.1145/3326229.3326256openalex-snapshot
Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module
inferred← citeshttps://doi.org/10.1145/3326229.3326260openalex-snapshot
Quadratic-Time Algorithms for Normal Elements
inferred← citeshttps://doi.org/10.1145/3326229.3326268openalex-snapshot
Change of Basis for m-primary Ideals in One and Two Variables
inferred← citeshttps://doi.org/10.1145/3373207.3404023openalex-snapshot
Sparse multiplication for skew polynomials
inferred← citeshttps://doi.org/10.1145/3373207.3404061openalex-snapshot
Fast in-place algorithms for polynomial operations
inferred← citeshttps://doi.org/10.1145/3597066.3597080openalex-snapshot
Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology
inferred← citeshttps://doi.org/10.1145/3597066.3597087openalex-snapshot
New Sparse Multivariate Polynomial Factorization Algorithms over Integers
inferred← citeshttps://doi.org/10.1145/3832046.3832055openalex-snapshot
Modular Composition for Decomposable Polynomials
inferred← citeshttps://doi.org/10.1145/504331.504333openalex-snapshot
Factoring a binary polynomial of degree over one million
inferred← citeshttps://doi.org/10.1201/9781584888239-c17openalex-snapshot
Algebraic and Numerical Algorithms
inferred← citeshttps://doi.org/10.1515/dma.2007.031openalex-snapshot
On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
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.3934/amc.2014.8.459openalex-snapshot
Smoothness testing of polynomials over finite fields
inferred← citeshttps://doi.org/10.4134/jkms.2013.50.2.361openalex-snapshot
COMPRESS MULTIPLE CIPHERTEXTS USING ELGAMAL ENCRYPTION SCHEMES
inferred← citeshttps://doi.org/10.4213/dm968openalex-snapshot
О построении схем для перехода между полиномиальными и нормальными базисами конечных полей
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2008.1323openalex-snapshot
Factoring Polynomials over Finite Fields using Balance Test
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.0802.2838openalex-snapshot
Factoring Polynomials over Finite Fields using Balance Test
inferred← citeshttps://doi.org/10.48550/arxiv.0811.3165openalex-snapshot
Trading GRH for algebra: algorithms for factoring polynomials and related structures
inferred← citeshttps://doi.org/10.48550/arxiv.1309.0458openalex-snapshot
Capacity of Non-Malleable Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1406.3672openalex-snapshot
Deterministic polynomial factoring under the assumption of the Extended Riemann Hypothesis (ERH)
inferred← citeshttps://doi.org/10.48550/arxiv.1602.05032openalex-snapshot
Enumerating all the Irreducible Polynomials over Finite Field
inferred← citeshttps://doi.org/10.48550/arxiv.1809.01762openalex-snapshot
Factorization of a class of composed polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1903.03278openalex-snapshot
Quadratic Probabilistic Algorithms for Normal Bases
inferred← citeshttps://doi.org/10.48550/arxiv.2002.10304openalex-snapshot
Fast In-place Algorithms for Polynomial Operations: Division, Evaluation, Interpolation
inferred← citeshttps://doi.org/10.5753/sbseg.2021.17313openalex-snapshot
Towards constant-time probabilistic root finding for code-based cryptography
inferred← citeshttps://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
inferred← citeshttps://doi.org/10.70675/2bd37edcz2b83z4cb5z97ebz3c7d221f9fa9openalex-snapshot
Efficient computation with structured matrices and arithmetic expressions
inferred← citeshttps://doi.org/10.70675/5094cdcbz9865z4674z8591z6383aef42092openalex-snapshot
Arithmétique efficace des extensions de corps finis
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.