Cryptanalysis of the Dickson-scheme
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Solving simultaneous modular equations of low degree
SIAM Journal on Computing - Special issue on cryptography
On cyclotomic generator of order r
Information Processing Letters
Modern computer algebra
Polynomial Interpolation of the Discrete Logarithm
Designs, Codes and Cryptography
Handbook of Applied Cryptography
Handbook of Applied Cryptography
On the Linear Complexity of the Power Generator
Designs, Codes and Cryptography
Linear Complexity of the Discrete Logarithm
Designs, Codes and Cryptography
Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
IFIP/Sec '93 Proceedings of the IFIP TC11, Ninth International Conference on Information Security: Computer Security
Additive Complexity and Roots of Polynomials over Number Fields and \mathfrak{p} -adic Fields
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Discrete Logarithms and Factoring
Discrete Logarithms and Factoring
Discrete Applied Mathematics - Special issue: Coding and cryptography
Finding a small root of a univariate modular equation
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Interpolation of the elliptic curve Diffie-Hellman mapping
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On degrees of polynomial interpolations related to elliptic curve cryptography
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
On the linear complexity profile of the power generator
IEEE Transactions on Information Theory
Lower bounds on the linear complexity of the discrete logarithm in finite fields
IEEE Transactions on Information Theory
Some notes on the two-prime generator of order 2
IEEE Transactions on Information Theory
Linear Complexity of Generalized Cyclotomic Binary Sequences of Order 2
Finite Fields and Their Applications
Incomplete Character Sums and Polynomial Interpolation of the Discrete Logarithm
Finite Fields and Their Applications
Interpolation of the Double Discrete Logarithm
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Polynomial Interpolation of the k-th Root of the Discrete Logarithm
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Polynomial representations of the Lucas logarithm
Finite Fields and Their Applications
| Hi-index | 0.01 |
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of hardness of this number theoretic problem. We obtain lower bounds on degree, weight, and additive complexity of polynomials interpolating functions related to the integer factoring problem, including Euler's totient function, the divisor sum functions, Carmichael's function, and the RSA-function. These investigations are motivated by earlier results of the same flavour on the interpolation of discrete logarithm and Diffie-Hellman mapping.