2005
DOI: 10.1016/j.ffa.2005.06.005
|View full text |Cite
|
Sign up to set email alerts
|

The place of exceptional covers among all diophantine relations

Abstract: Let F q be the order q finite field. An F q cover : X → Y of absolutely irreducible normal varieties has a nonsingular locus. Then, is exceptional if it maps one-one on F q t points for ∞-ly many t over this locus. Lenstra suggested a curve Y may have an Exceptional (cover)Tower over F q Lenstra Jr. [Talk at Glasgow Conference, Finite Fields III, 1995]. We construct it, and its canonical limit group and permutation representation, in general. We know all onevariable tamely ramified rational function exceptiona… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 66 publications
0
2
0
Order By: Relevance
“…A map X → Y of (smooth, projective) algebraic curves over a finite field F q is called an exceptional cover when the induced map on F q t -points X(F q t ) → Y (F q t ) is a bijection for infinitely many values of t (necessarily including t = 1). The construction of exceptional covers is an important problem in arithmetic algebraic geometry [8], which also has applications to cryptography.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…A map X → Y of (smooth, projective) algebraic curves over a finite field F q is called an exceptional cover when the induced map on F q t -points X(F q t ) → Y (F q t ) is a bijection for infinitely many values of t (necessarily including t = 1). The construction of exceptional covers is an important problem in arithmetic algebraic geometry [8], which also has applications to cryptography.…”
Section: Introductionmentioning
confidence: 99%
“…3.5], we describe an algorithm to generate permutation rational functions of any constant prime degree ℓ ≥ 5 (which are, in fact, exceptional covers) over large finite fields and show that it is efficient and practical. We also expand upon the RSA analogy alluded to in [8] and discuss how our algorithm might indeed be used to obtain new factoring-related trapdoor permutations that behave better than the RSA trapdoor permutation against certain classes of attacks.…”
Section: Introductionmentioning
confidence: 99%