An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation (Q834951): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q501672
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2004.08.009 / rank
Normal rank
 
Property / author
 
Property / author: Hyun Sook Cho / rank
 
Normal rank
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.1016/j.ipl.2004.08.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1578834396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective recursive algorithm for computing multiplicative inverses in GF(2m) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2004.08.009 / rank
 
Normal rank

Latest revision as of 10:27, 9 December 2024

scientific article
Language Label Description Also known as
English
An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation
scientific article

    Statements

    An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 August 2009
    0 references
    algorithms
    0 references
    multiplicative inversion
    0 references
    normal basis
    0 references
    Fermat's theorem
    0 references

    Identifiers