How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields (Q1999182)

From MaRDI portal
Revision as of 21:14, 4 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127113133, #quickstatements; #temporary_batch_1722802475495)





scientific article
Language Label Description Also known as
English
How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
scientific article

    Statements

    How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 March 2021
    0 references
    cloud computing
    0 references
    computation outsourcing
    0 references
    unimodular matrix transformation
    0 references
    extended Euclidean algorithm
    0 references
    large-scale polynomials
    0 references

    Identifiers

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