Article

On taking roots in finite fields

Authors:

Leonard Adleman,

Kenneth Manders, and

Gary MillerAuthors Info & Claims

SFCS '77: Proceedings of the 18th Annual Symposium on Foundations of Computer Science

September 1977

Pages 175 - 178

https://doi.org/10.1109/SFCS.1977.18

Published: 30 September 1977 Publication History

Publisher Site

Abstract

No abstract available.

Cited By

View all

Goldwasser SMicali S(2019)Probabilistic encryption & how to play mental poker keeping secret all partial informationProviding Sound Foundations for Cryptography10.1145/3335741.3335749(173-201)Online publication date: 4-Oct-2019
https://dl.acm.org/doi/10.1145/3335741.3335749
Cho GGo BKim CKoo NKwon S(2019)On the Cipolla---Lehmer type algorithms in finite fieldsApplicable Algebra in Engineering, Communication and Computing10.1007/s00200-018-0362-230:2(135-145)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/s00200-018-0362-2
Ivanyos GKarpinski MSantha MSaxena NShparlinski I(2018)Polynomial Interpolation and Identity Testing from High Powers Over Finite FieldsAlgorithmica10.1007/s00453-016-0273-180:2(560-575)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s00453-016-0273-1
Show More Cited By

Index Terms

On taking roots in finite fields
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations in finite fields
  2. Mathematical software

Index terms have been assigned to the content through auto-classification.

Recommendations

Oblivious two-way finite automata: Decidability and complexity

We investigate the descriptional complexity and decidability of obliviousness for two-way finite automata. In particular, we consider the simulation of two-way deterministic finite automata (2DFAs) by oblivious 2DFAs, the simulation of oblivious 2DFAs ...
Read More
Alternating finite automata and related problems
Read More
Complementing two-way finite automata

We study the relationship between the sizes of two-way finite automata accepting a language and its complement. In the deterministic case, for a given automaton (2dfa) with n states, we build an automaton accepting the complement with at most 4n states, ...
Read More

Comments

Information & Contributors

Information

Published In

SFCS '77: Proceedings of the 18th Annual Symposium on Foundations of Computer Science

September 1977

269 pages

Publisher

IEEE Computer Society

United States

Publication History

Published: 30 September 1977

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

View all

Goldwasser SMicali S(2019)Probabilistic encryption & how to play mental poker keeping secret all partial informationProviding Sound Foundations for Cryptography10.1145/3335741.3335749(173-201)Online publication date: 4-Oct-2019
https://dl.acm.org/doi/10.1145/3335741.3335749
Cho GGo BKim CKoo NKwon S(2019)On the Cipolla---Lehmer type algorithms in finite fieldsApplicable Algebra in Engineering, Communication and Computing10.1007/s00200-018-0362-230:2(135-145)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/s00200-018-0362-2
Ivanyos GKarpinski MSantha MSaxena NShparlinski I(2018)Polynomial Interpolation and Identity Testing from High Powers Over Finite FieldsAlgorithmica10.1007/s00453-016-0273-180:2(560-575)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s00453-016-0273-1
Roh DKim IHahn S(2018)The l-th power Diffie---Hellman problem and the l-th root Diffie---Hellman problemApplicable Algebra in Engineering, Communication and Computing10.1007/s00200-017-0321-329:1(41-57)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1007/s00200-017-0321-3
Bhargava VIvanyos GMittal RSaxena NYap CEl Din M(2017)Irreducibility and Deterministic r-th Root Finding over Finite FieldsProceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation10.1145/3087604.3087620(37-44)Online publication date: 23-Jul-2017
https://dl.acm.org/doi/10.1145/3087604.3087620
Ivanyos GSantha M(2017)Solving systems of diagonal polynomial equations over finite fieldsTheoretical Computer Science10.1016/j.tcs.2016.04.045657:PA(73-85)Online publication date: 2-Jan-2017
https://dl.acm.org/doi/10.1016/j.tcs.2016.04.045
Kim SCheon J(2015)Fixed argument pairing inversion on elliptic curvesDesigns, Codes and Cryptography10.1007/s10623-014-9993-x77:1(143-152)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1007/s10623-014-9993-x
Cho GKoo NHa EKwon S(2015)New cube root algorithm based on the third order linear recurrence relations in finite fieldsDesigns, Codes and Cryptography10.1007/s10623-013-9910-875:3(483-495)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1007/s10623-013-9910-8
Jerschow YMauve M(2013)Modular square root puzzlesComputers and Security10.1016/j.cose.2012.11.00835(25-36)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1016/j.cose.2012.11.008
Harasawa RSueyoshi YKudo A(2012)Improving the berlekamp algorithm for binomials x-aProceedings of the 4th international conference on Arithmetic of Finite Fields10.1007/978-3-642-31662-3_16(225-235)Online publication date: 16-Jul-2012
https://dl.acm.org/doi/10.1007/978-3-642-31662-3_16
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Oblivious two-way finite automata: Decidability and complexity

Alternating finite automata and related problems

Complementing two-way finite automata

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations