Výsledky vyhledávání - "polynomial factorization algorithm"

Verifiable outsourced computation over encrypted data

Autoři: Yu, Xixun Yan, Zheng Zhang a další

Přispěvatelé: Yu, Xixun Yan, Zheng Zhang a další

Zdroj: Information Sciences. 479:372-385

Témata: ta113, 0202 electrical engineering, electronic engineering, information engineering, Fully homomorphic encryption, Verifiability, 02 engineering and technology, Outsourced computation, Polynomial factorization algorithm, Privacy preservation

Popis souboru: application/pdf

Přístupová URL adresa: https://research.aalto.fi/files/30824595/ELEC_Yu_et_al_Verifiable_Outsourced_Computation.pdf
https://www.sciencedirect.com/science/article/pii/S0020025518309721
https://research.aalto.fi/fi/publications/verifiable-outsourced-computation-over-encrypted-data(1520c839-f71f-4c58-b9dd-e67fac7bb797).html
https://doi.org/10.1016/j.ins.2018.12.022
https://dblp.uni-trier.de/db/journals/isci/isci479.html#YuYZ19
https://aaltodoc.aalto.fi/handle/123456789/35908

The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields: The complete analysis of a polynomial factorization algorithm over finite fields

Autoři: Daniel Panario Xavier Gourdon Philippe Flajolet

Zdroj: Journal of Algorithms. 40:37-81

Témata: polynomial factorization algorithm, algorithm, algebraic complexity, Computational aspects of field theory and polynomials, 0102 computer and information sciences, finite fields, 0101 mathematics, Nonnumerical algorithms, 01 natural sciences, Number-theoretic algorithms, complexity, Polynomials over finite fields

Popis souboru: application/xml

Přístupová URL adresa: https://hal.inria.fr/inria-00073319/file/RR-3370.pdf
https://zbmath.org/1656033
https://doi.org/10.1006/jagm.2001.1158
http://algo.inria.fr/flajolet/Publications/FlGoPa01.pdf
https://www.cs.auckland.ac.nz/~mcw/Teaching/refs/misc/factorization.pdf
https://hal.inria.fr/inria-00073319/document
https://dl.acm.org/doi/10.1006/jagm.2001.1158
https://dblp.uni-trier.de/db/journals/jal/jal40.html#FlajoletGP01
https://core.ac.uk/display/22936951

A New Polynomial Factorization Algorithm and its Implementation: A new polynomial factorization algorithm and its implementation

Autoři: Victor Shoup

Zdroj: Journal of Symbolic Computation. 20:363-397

Témata: polynomial factorization algorithm, Algebra and Number Theory, 0102 computer and information sciences, Symbolic computation and algebraic computation, 01 natural sciences, baby step/giant step factoring method, Polynomials over finite fields, Computational Mathematics, univariate polynomials, Parallel algorithms in computer science, 0101 mathematics, implementation, finite field, Number-theoretic algorithms, complexity

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/884780
https://doi.org/10.1006/jsco.1995.1055
https://www.sciencedirect.com/science/article/abs/pii/S0747717185710553
https://nyuscholars.nyu.edu/en/publications/a-new-polynomial-factorization-algorithm-and-its-implementation
https://www.sciencedirect.com/science/article/pii/S0747717185710553
https://dl.acm.org/doi/10.1006/jsco.1995.1055
https://dl.acm.org/citation.cfm?id=226280
https://core.ac.uk/display/82184310