Weil descent of Jacobians. (Q1811101): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61914069, #quickstatements; #temporary_batch_1705098335825
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sieving in Function Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2764233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive and destructive facets of Weil descent on elliptic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperelliptic cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic function fields and codes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:29, 5 June 2024

scientific article
Language Label Description Also known as
English
Weil descent of Jacobians.
scientific article

    Statements

    Weil descent of Jacobians. (English)
    0 references
    10 June 2003
    0 references
    The paper considers Weil restrictions as a means to solve the discrete logarithm problem in elliptic curves. In particular, it considers the Jacobian of a genus \(g>1\) curve \(C\) over a finite field \(\mathbb{F}_{q^n}\), where \(q\) is a prime and \(n>1\). The paper shows that in this case the discrete logarithm problem can be reduced to an computationally easier problem.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    elliptic curves
    0 references
    Weil restrictions
    0 references
    discrete logarithm problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references