Описывается алгоритм, сводящий с полиномиальной сложностью задачу дискретного логарифмирования в конечномерной алгебре к задаче дискретного логарифмирования над
Keywords:
Discrete logarithm Finite field Logarithm Mathematics Field (mathematics) Pure mathematics Algebra over a field Mathematical analysis Discrete mathematics Computer science
Metrics
1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
1
Refs
0.30
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Polynomial and algebraic computation
Physical Sciences → Computer Science → Computational Theory and Mathematics
Journal: Bulletin of the South Ural State University Series Mathematical Modelling Programming and Computer Software Year: 2019 Vol: 12 (1)Pages: 66-81