Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2012, Volume 3, Issue 1, Pages 5–51
DOI: https://doi.org/10.4213/mvk47 (Mi mvk47) 		 
This article is cited in 5 scientific papers (total in 5 papers)

Solving systems of linear equations arising in the computation of logarithms in a finite prime field

A. Ya. Dorofeev

SUE RDI "Kvant", Moscow
Full-text PDF (467 kB) Citations (5)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mvk47
Abstract: Empirical investigations of the computational complexity of algorithms for solving sparse linear systems was conducted for systems appeared in the computation of discrete logarithms in finite prime fields $GF(p)$, $p<10^{135}$.
Key words: discrete logarithms, number field sieve, sparse linear systems, structured Gaussian elimination, Lanczos algorithm, parallel computations.
Received 05.V.2010
Document Type: Article
UDC: 511.53+519.712.45
Language: Russian
Citation: A. Ya. Dorofeev, “Solving systems of linear equations arising in the computation of logarithms in a finite prime field”, Mat. Vopr. Kriptogr., 3:1 (2012), 5–51
Citation in format AMSBIB
\Bibitem{Dor12}
\by A.~Ya.~Dorofeev
\paper Solving systems of linear equations arising in the computation of logarithms in a~finite prime field
\jour Mat. Vopr. Kriptogr.
\yr 2012
\vol 3
\issue 1
\pages 5--51
\mathnet{http://mi.mathnet.ru/mvk47}
\crossref{https://doi.org/10.4213/mvk47}
Linking options:
  • https://www.mathnet.ru/eng/mvk47
  • https://doi.org/10.4213/mvk47
  • https://www.mathnet.ru/eng/mvk/v3/i1/p5
    • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:1586
    Full-text PDF :569
    References:106
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024