Improved generalized Atkin algorithm for computing square roots in finite fields (Q844143): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3139838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of square roots in finite fields / 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: A note on square roots in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing special powers in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Fast Exponentiation Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting points on elliptic curves over finite fields / rank
 
Normal rank

Revision as of 09:00, 2 July 2024

scientific article
Language Label Description Also known as
English
Improved generalized Atkin algorithm for computing square roots in finite fields
scientific article

    Statements

    Improved generalized Atkin algorithm for computing square roots in finite fields (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 January 2010
    0 references
    square roots
    0 references
    finite field arithmetic
    0 references
    computational complexity
    0 references
    cryptography
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references