scientific article; zbMATH DE number 2124954

MaRDI QIDQ4832280zbMATH OpenFDO

Authors Daniel Panario

Publication date 4 January 2005

zbMATH Keywords

generating functionasymptotic analysisfactorizationaverage-case analysisdiscrete logarithmprobabilistic algorithmirreducibility testunivariate random polynomial

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Research exposition (monographs, survey articles) pertaining to number theory (11-02)

Recommendations

• scientific article; zbMATH DE number 1008373
• Random polynomials over a finite field
• scientific article; zbMATH DE number 1055650
• Analysis of Rabin's irreducibility test for polynomials over finite fields
• Analysis of Ben-Or's polynomial irreducibility test

Cited in

(5)

• Interval partitions and polynomial factorization
• Random polynomials over a finite field
• Estimating the number of roots of trinomials over finite fields
• On weak keys and forgery attacks against polynomial-based MAC schemes
• Splitting fields for characteristic polynomials of matrices with entries in a finite field

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4832280)