Elliptic curve cryptography arithmetic in terms of one variable polynomial division (Q5034523): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/09720529.2019.1702754 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3009424940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4906196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5430106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curve Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3718617 / rank
 
Normal rank

Latest revision as of 01:29, 28 July 2024

scientific article; zbMATH DE number 7476976
Language Label Description Also known as
English
Elliptic curve cryptography arithmetic in terms of one variable polynomial division
scientific article; zbMATH DE number 7476976

    Statements

    Elliptic curve cryptography arithmetic in terms of one variable polynomial division (English)
    0 references
    0 references
    0 references
    0 references
    18 February 2022
    0 references
    elliptic curve
    0 references
    finite field
    0 references
    polynomial division
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers