{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:03:34Z","timestamp":1761487414736},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1007\/bf01810847","type":"journal-article","created":{"date-parts":[[2005,6,27]],"date-time":"2005-06-27T19:33:01Z","timestamp":1119900781000},"page":"55-57","source":"Crossref","is-referenced-by-count":20,"title":["A short proof for explicit formulas for discrete logarithms in finite fields"],"prefix":"10.1007","volume":"1","author":[{"given":"Harald","family":"Niederreiter","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01810847_CR1","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Computing13, 850\u2013864 (1984)","journal-title":"SIAM J. Computing"},{"key":"BF01810847_CR2","first-page":"54","volume-title":"Lecture Notes in Computer Science, Vol.196","author":"B. Chor","year":"1985","unstructured":"Chor, B., Rivest, R. L.: A knapsack type public key cryptosystem based on arithmetic in finite fields. Proc. CRYPTO 84, pp. 54\u201365. Lecture Notes in Computer Science, Vol.196. Berlin, Heidelberg, New York: Springer 1985"},{"key":"BF01810847_CR3","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1109\/18.21214","volume":"34","author":"B. Chor","year":"1988","unstructured":"Chor, B., Rivest, R. L.: A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inform. Theory34, 901\u2013909 (1988)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"BF01810847_CR4","first-page":"24","volume-title":"Applications of Discrete Mathematics","author":"D. Coppersmith","year":"1988","unstructured":"Coppersmith, D.: Methods and results in cryptography. Applications of Discrete Mathematics. Ringeisen, R. D., Roberts, F. S. (eds.), pp. 24\u201331. Philadelphia: SIAM 1988"},{"key":"BF01810847_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01840433","volume":"1","author":"D. Coppersmith","year":"1986","unstructured":"Coppersmith, D., Odlyzko, A. M., Schroeppel, R.: Discrete logarithms in GF(p). Algorithmica1, 1\u201315 (1986)","journal-title":"Algorithmica"},{"key":"BF01810847_CR6","volume-title":"Finite fields","author":"R. Lidl","year":"1983","unstructured":"Lidl, R., Niederreiter, H.: Finite fields. Reading, MA: Addison-Wesley 1983"},{"key":"BF01810847_CR7","volume-title":"Introduction to finite fields and their applications","author":"R. Lidl","year":"1986","unstructured":"Lidl, R., Niederreiter, H.: Introduction to finite fields and their applications. Cambridge: Cambridge University Press 1986"},{"key":"BF01810847_CR8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.4064\/aa-47-3-255-261","volume":"47","author":"G. L. Mullen","year":"1986","unstructured":"Mullen, G. L., White, D.: A polynomial representation for logarithms in GF(q). Acta Arith.47, 255\u2013261 (1986)","journal-title":"Acta Arith."},{"key":"BF01810847_CR9","first-page":"224","volume-title":"Lecture Notes in Computer Science, Vol.209","author":"A. M. Odlyzko","year":"1985","unstructured":"Odlyzko, A. M.: Discrete logarithms in finite fields and their cryptographic significance. Proc. EUROCRYPT 84, pp. 224\u2013314. Lecture Notes in Computer Science, Vol.209. Berlin, Heidelberg, New York: Springer 1985"},{"key":"BF01810847_CR10","first-page":"119","volume-title":"Fast, rigorous factorization and discrete logarithm algorithms. Discrete Algorithms and Complexity (Proc. Japan\u2014US Joint Seminar, Kyoto, 1986)","author":"C. Pomerance","year":"1987","unstructured":"Pomerance, C.: Fast, rigorous factorization and discrete logarithm algorithms. Discrete Algorithms and Complexity (Proc. Japan\u2014US Joint Seminar, Kyoto, 1986), pp. 119\u2013143. Boston: Academic Press 1987"},{"key":"BF01810847_CR11","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1109\/TIT.1984.1056986","volume":"30","author":"A. L. Wells Jr.","year":"1984","unstructured":"Wells, A. L., Jr.: A polynomial form for logarithms modulo a prime. IEEE Trans. Inform. Theory30, 845\u2013846 (1984)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01810847.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01810847\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01810847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T13:50:37Z","timestamp":1557496237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01810847"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["BF01810847"],"URL":"https:\/\/doi.org\/10.1007\/bf01810847","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}