L. M. Adleman and K. S. McCurley; "Open problems in number theoretic complexity, II" proceedings of ANTS-I, LNCS 877, (1994), pp.291-322. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Digital Signature and Public Key Cryptosystem in a Prime Order.. - Boyd (1997) (5 citations) (Correct)
....Key: n; g) Private Key: r The private key r is the order of the public element g. Finding the private key from the public key alone is then the problem of finding the order of a specific element modulo n. In general this problem is random polynomial time equivalent to the factorisation problem [1]. It is not difficult to see that an oracle that returns the order of elements modulo n can be used to find OE(n) which is sufficient to factorise n. Clearly factorisation of the modulus leads to knowledge of p Gamma 1, which can then be factorised (if n has been) to find r. Thus finding the ....
L. M. Adleman and K. S. McCurley, "Open Problems in Number Theoretic Complexity, II", Algorithmic Number Theory, Lecture Notes in Computer Science Vol.877, Springer-Verlag, 1994.
The Role of Reductions in Cryptography - Morin (Correct)
....work is the validity of the Phi strength assumption on the stream cipher S. Ongoing research in this area involves showing that CSPRB generators are indeed Phi strong. There are many open problems in this area. Adleman and McCurley give a list of open problems in number theoretic complexity in [AdMc] including a number of reduction problems. Another major open problem is the question of whether cryptographic protocols or systems can be constructed such that breaking them is an NP hard problem. However, more important than open problems to do with reductions are the applications of reductions. ....
L. Adleman, K. McCurley, "Open Problems in Number Theoretic Complexity, II," in Proceedings of ANTS-I.
A New Public-Key Cryptosystem over Quadratic Orders with.. - Paulus, Takagi (1999) (Correct)
No context found.
L. M. Adleman and K. S. McCurley; "Open problems in number theoretic complexity, II" proceedings of ANTS-I, LNCS 877, (1994), pp.291-322.
A New Public-Key Cryptosystem over Quadratic Orders with.. - Paulus, Takagi (2000) (Correct)
No context found.
L. M. Adleman and K. S. McCurley; "Open problems in number theoretic complexity, II" proceedings of ANTS-I, LNCS 877, (1994), pp.291-322.
NICE - New Ideal Coset Encryption - Hartmann, Paulus, Takagi (1999) (Correct)
No context found.
L. M. Adleman and K. S. McCurley, "Open problems in number theoretic complexity, II" proceedings of ANTS-I, LNCS 877, (1994), pp.291-322.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC