Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ASIACRYPT
/
Paper
Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields.
Antoine Joux
,
Ccile Pierrot
Venue
A
ASIACRYPT
Year
2014
Proceedings
ASIACRYPT (1)
DBLP record
conf/asiacrypt/JouxP14 ↗
Browse the full
ASIACRYPT paper archive
.