The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem (original) (raw)
Related papers
Civilized Software Technical reportr, 2023
The General Chinese Remainder Theorem
The American Mathematical Monthly, 1952
On Some Algebraic Properties of the Chinese Remainder Theorem with Applications to Real Life
Journal of Applied Mathematics and Computation, 2021
A generalization of the Chinese remainder theorem
2001
On the cubic sieve method for computing discrete logarithms over prime fields
International Journal of Computer Mathematics, 2005
Multivariable Chinese remainder theorem
Resonance, 2015
A Survey of Discrete Logarithm Algorithms in Finite Fields
2019
On the reduction in multiplicative complexity achieved by the polynomial residue number system
IEEE Transactions on Signal Processing, 1992
The complexity of the Chinese Remainder Theorem
arXiv (Cornell University), 2023
RSA algorithm and the Chinese Remainder Problem
AN APPROACH TO ELLIPTIC CURVES AND DISCRETE LOGARITHMIC PROBLEM.
2016
Elliptic divisibility sequences and the elliptic curve discrete logarithm problem
Optimising the New Chinese Remainder Theorem 1 for the Moduli Set
International Journal of Computer Applications, 2016
Further results on Chinese remaindering
1997
On the Complexity of Generalized Discrete Logarithm Problem
arXiv (Cornell University), 2022
A multivariable Chinese remainder theorem
2003
Some applications of linear congruence from number theory
International Research Journal of Science, Technology, Education, and Management, 2023
On some computational and applications of finite fields
2020
On the complexity of the discrete logarithm and Diffie–Hellman problems
Journal of Complexity, 2004
Algebraic Algorithm for Solving Linear Congruences: Its Application To Cryptography
Asia Pacific Journal of Education Perspective
Asia Pacific Journal of Education, Arts and Sciences, 2014
On finding small solutions of modular multivariate polynomial equations
Lecture Notes in Computer Science, 1998
THE DISCRETE LOG PROBLEM AND ELLIPTIC CURVE CRYPTOGRAPHY
Rational representation of modular numbers
Matemática Contemporânea, 1999
Another look at some fast modular arithmetic methods
Journal of Mathematical Cryptology, 2009
ALGORITHMS FOR SOLVING LINEAR CONGRUENCES AND SYSTEMS OF LINEAR CONGRUENCES
The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm
Lecture Notes in Computer Science, 2002
New solvability conditions for congruence ax≡b (mod n)
Tatra Mountains Mathematical Publications, 2015
Lower bounds on the linear complexity of the discrete logarithm in finite fields
IEEE Transactions on Information Theory, 2001
2000
On the genericity of the modular polynomial GCD algorithm
1999
A Computational Introduction to Number Theory and Algebra (Version 2