Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле

DOI10.4213/mvk47zbMath1475.94114OpenAlexW2791564581MaRDI QIDQ4959032

A. Ya. Dorofeev

Publication date: 15 September 2021

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk47

zbMATH Keywords

sparse linear systemsLanczos algorithmparallel computationsnumber field sievestructured Gaussian eliminationdiscrete logarithms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

GPU based acceleration of parallel block Lanczos solver ⋮ The universal block Lanczos-Padé method for linear systems over large prime fields

Uses Software

• MPI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete logarithms in \(\mathrm{GF}(p)\)
• Computation of discrete logarithms in prime fields
• Load partitioning and trade-off study for large matrix-vector computations in multicast bus networks with communictaion delays
• Parallel matrix-vector product on rings with a minimum of communications
• Conjugate gradient and Lanczos methods for sparse matrices on distributed memory multiprocessors
• Preconditioned CG methods for sparse matrices on massively parallel machines
• Discrete logarithms: The past and the future
• ``Chinese & Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm
• Special prime numbers and discrete logs in finite prime fields
• The Elimination form of the Inverse and its Application to Linear Programming
• Solving sparse linear equations over finite fields
• New directions in cryptography
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Finite Element Approximation of the Parabolic p-Laplacian
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• On asymptotic complexity of computing discrete logarithms over GF(p)
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Towards a fast parallel sparse symmetric matrix-vector multiplication

This page was built for publication: Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле