scientific article; zbMATH DE number 2124954
From MaRDI portal
Publication:4832280
zbMath1080.11086MaRDI QIDQ4832280
Publication date: 4 January 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
generating functionasymptotic analysisfactorizationprobabilistic algorithmaverage-case analysisdiscrete logarithmirreducibility testunivariate random polynomial
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Polynomials over finite fields (11T06)
Related Items (4)
Estimating the number of roots of trinomials over finite fields ⋮ On weak keys and forgery attacks against polynomial-based MAC schemes ⋮ Interval partitions and polynomial factorization ⋮ Splitting fields for characteristic polynomials of matrices with entries in a finite field
This page was built for publication: