ON FINDING SOLUTIONS TO EXPONENTIAL CONGRUENCES

DOI10.1017/S0004972718001302MaRDI QIDQ5380450zbMATH OpenOpenAlexWikidataFDO

Authors Igor E. Shparlinski

Publication date 4 June 2019

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0004972718001302

zbMATH Keywords

algorithmexponential equationfinite field

Mathematics Subject Classification ID

Exponential Diophantine equations (11D61) Finite fields and commutative rings (number-theoretic aspects) (11T99) Number-theoretic algorithms; complexity (11Y16) Computer solution of Diophantine equations (11Y50)

Cites work

• Classical and Quantum Algorithms for Exponential Congruences
• scientific article; zbMATH DE number 1131801 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• scientific article; zbMATH DE number 3252237 (Why is no real title available?)
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• Information Security and Privacy
• On zeros of exponential polynomials and quantum algorithms

Cited in

(3)

• scientific article; zbMATH DE number 3143756 (Why is no real title available?)
• scientific article; zbMATH DE number 6795701 (Why is no real title available?)
• On the number of solutions of exponential congruences

This page was built for publication: ON FINDING SOLUTIONS TO EXPONENTIAL CONGRUENCES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380450)