Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
32
click to vote
SODA
1993
ACM
favorite
Email
discuss
report
105
views
Algorithms
»
more
SODA 1993
»
Fast Construction of Irreducible Polynomials over Finite Fields
13 years 9 months ago
Download
perso.univ-rennes1.fr
Victor Shoup
Real-time Traffic
Algorithms
|
SODA 1993
|
claim paper
Related Content
»
Generating series for irreducible polynomials over finite fields
»
Distribution of irreducible polynomials of small degrees over finite fields
»
Parity of the number of irreducible factors for composite polynomials
»
Constructing Tower Extensions of Finite Fields for Implementation of PairingBased Cryptogr...
»
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields
»
The 2Adic CM Method for Genus 2 Curves with Application to Cryptography
»
Hensel lifting and bivariate polynomial factorisation over finite fields
»
Cryptographic Applications of Sparse Polynomials over Finite Rings
»
Pseudorandom generators for CC0p and the Fourier spectrum of lowdegree polynomials over fi...
more »
Post Info
More Details (n/a)
Added
02 Nov 2010
Updated
02 Nov 2010
Type
Conference
Year
1993
Where
SODA
Authors
Victor Shoup
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision