Cubic sieve congruence of the discrete logarithm problem, and fractional part sequences
DOI10.1016/J.JSC.2013.12.004zbMATH Open1372.11115OpenAlexW2093867684MaRDI QIDQ2437317FDOQ2437317
Authors: Srinivas Vivek, C. E. Veni Madhavan 
Publication date: 3 March 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2013.12.004
Recommendations
- On the cubic sieve method for computing discrete logarithms over prime fields
- An algorithm for evaluation of discrete logarithms in some nonprime finite fields
- New series of rational approximations and some of their applications
- scientific article; zbMATH DE number 1522937
- Special prime numbers and discrete logs in finite prime fields
discrete logarithm problemcryptanalysisDiophantine equationcomputational number theoryfractional part sequence
Data encryption (aspects in computer science) (68P25) Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Continued fractions.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Title not available (Why is that?)
- On the cubic sieve method for computing discrete logarithms over prime fields
- Title not available (Why is that?)
- Gaps in the sequence \(n^ 2\vartheta \,(mod\,1)\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Gap problems for integer part and fractional part sequences
Cited In (1)
This page was built for publication: Cubic sieve congruence of the discrete logarithm problem, and fractional part sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437317)
