Explicit form for the discrete logarithm over the field
Archivum Mathematicum (1993)
- Volume: 029, Issue: 1-2, page 25-28
- ISSN: 0044-8753
Access Full Article
topAbstract
topHow to cite
topReferences
top- A subexponential algorithm for the discrete logarithm problem, with applications to cryptography, Proc. 20th IEEE Found. Comp. Sci. Symp. (1979), 55-60. (1979)
- New directions in cryptography, IEEE Trans. Inform. Theory, IT-22 (1976), 644-654. (1976) MR0437208
- Discrete logarithms in finite fields and their cryptographic significance, Proc. of the Eurocrypt ’84. Zbl0594.94016
- An improved algorithm for computing logarithms over and its cryptographic significance, IEEE Trans. Inform. Theory, IT-24 (1978), 106-110. (1978) MR0484737
- The fast Fourier transform in a finite field, Mathematics of computation 25 (1971), 365-374. (1971) Zbl0221.12015MR0301966
- A polynomial form for logarithms modulo a prime, IEEE Trans.Inform. Theory, IT-30 (1984), 845-846. (1984) Zbl0558.12009
- The art of computer programming, Reading MA III (1969), Addison Wesley. (1969) Zbl0191.18001MR0378456