Adleman, Leonard M.; Huang, Ming-Deh A. Function field sieve method for discrete logarithms over finite fields. (English) Zbl 1006.11078 Inf. Comput. 151, No. 1-2, 5-16 (1999). MSC: 11Y16 68P25 11T71 PDFBibTeX XMLCite \textit{L. M. Adleman} and \textit{M.-D. A. Huang}, Inf. Comput. 151, No. 1--2, 5--16 (1999; Zbl 1006.11078) Full Text: DOI Link
Gao, Shuhong; Howell, Jason A general polynomial sieve. (English) Zbl 1112.11310 Des. Codes Cryptography 18, No. 1-3, 149-157 (1999). MSC: 11Y16 11T06 PDFBibTeX XMLCite \textit{S. Gao} and \textit{J. Howell}, Des. Codes Cryptography 18, No. 1--3, 149--157 (1999; Zbl 1112.11310) Full Text: DOI
Das, Abhijit; Veni Madhavan, C. E. Performance comparison of linear sieve and cubic sieve algorithms for discrete logarithms over prime fields. (English) Zbl 1007.11081 Aggarwal, Alok (ed.) et al., Algorithms and computation. 10th international symposium, ISAAC’ 99, Chennai, India, December 16-18, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1741, 295-306 (1999). MSC: 11Y16 11T71 PDFBibTeX XMLCite \textit{A. Das} and \textit{C. E. Veni Madhavan}, Lect. Notes Comput. Sci. 1741, 295--306 (1999; Zbl 1007.11081)
Adleman, Leonard M.; DeMarrais, Jonathan; Huang, Ming-Deh A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over \(\text{GF}(q)\). (English) Zbl 1007.11080 Theor. Comput. Sci. 226, No. 1-2, 7-18 (1999). MSC: 11Y16 11T71 14G50 PDFBibTeX XMLCite \textit{L. M. Adleman} et al., Theor. Comput. Sci. 226, No. 1--2, 7--18 (1999; Zbl 1007.11080) Full Text: DOI
Beaver, Cheryl L.; Gemmell, Peter S.; Johnston, Anna M.; Neumann, William On the cryptographic value of the \(q^{th}\) root problem. (English) Zbl 1014.94553 Varadharajan, Vijay (ed.) et al., Information and communication security. 2nd international conference, ICICS ’99, Sydney, Australia, November 9-11, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1726, 135-142 (1999). MSC: 94A60 11Y16 PDFBibTeX XMLCite \textit{C. L. Beaver} et al., Lect. Notes Comput. Sci. 1726, 135--142 (1999; Zbl 1014.94553)
Boudot, Fabrice; Traoré, Jacques Efficient publicly verifiable secret sharing schemes with fast or delayed recovery. (English) Zbl 0982.94019 Varadharajan, Vijay (ed.) et al., Information and communication security. 2nd international conference, ICICS ’99, Sydney, Australia, November 9-11, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1726, 87-102 (1999). MSC: 94A62 PDFBibTeX XMLCite \textit{F. Boudot} and \textit{J. Traoré}, Lect. Notes Comput. Sci. 1726, 87--102 (1999; Zbl 0982.94019)
Camenisch, Jan; Michels, Markus Separability and efficiency for generic group signature schemes. (Extended abstract). (English) Zbl 0942.94033 Wiener, Michael (ed.), Advances in cryptology - CRYPTO ’99. 19th annual international cryptology conference Santa Barbara, CA, USA, August 15-19, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1666, 413-430 (1999). MSC: 94A62 68P25 PDFBibTeX XMLCite \textit{J. Camenisch} and \textit{M. Michels}, Lect. Notes Comput. Sci. 1666, 413--430 (1999; Zbl 0942.94033)
Maurer, Ueli M.; Wolf, Stefan The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms. (English) Zbl 1053.94014 SIAM J. Comput. 28, No. 5, 1689-1721 (1999). MSC: 94A60 11Y16 11T71 68Q15 PDFBibTeX XMLCite \textit{U. M. Maurer} and \textit{S. Wolf}, SIAM J. Comput. 28, No. 5, 1689--1721 (1999; Zbl 1053.94014) Full Text: DOI
Shor, Peter W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. (English) Zbl 1005.11507 SIAM Rev. 41, No. 2, 303-332 (1999). MSC: 11Y05 81P68 68Q05 03D10 PDFBibTeX XMLCite \textit{P. W. Shor}, SIAM Rev. 41, No. 2, 303--332 (1999; Zbl 1005.11507) Full Text: DOI
Shparlinski, Igor Number theoretic methods in cryptography. Complexity lower bounds. (English) Zbl 0912.11057 Progress in Computer Science and Applied Logic. 17. Basel: Birkhäuser. viii, 180 p. (1999). Reviewer: Ian F.Blake (Palo Alto) MSC: 11Y16 94A60 94-02 11-02 68Q25 11T23 11T71 PDFBibTeX XMLCite \textit{I. Shparlinski}, Number theoretic methods in cryptography. Complexity lower bounds. Basel: Birkhäuser (1999; Zbl 0912.11057)