First Study for Ramp Secret Sharing Schemes Through Greatest Common Divisor of Polynomials
From MaRDI portal
Publication:3300516
DOI10.1007/978-3-030-44625-3_14OpenAlexW3033420919MaRDI QIDQ3300516
Dimitrios Triantafyllou, Gerasimos C. Meletiou, Michael N. Vrahatis
Publication date: 29 July 2020
Published in: Computational Mathematics and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-44625-3_14
Existence theories in calculus of variations and optimal control (49Jxx) Numerical analysis in abstract spaces (65Jxx)
Cites Work
- Computing real roots of real polynomials
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Factoring polynomials with rational coefficients
- Ideal ramp schemes and related combinatorial objects
- Security of Ramp Schemes
- Greatest common divisors from generalized sylvester resultant matrices
- On rank and null space computation of the generalized Sylvester matrix
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: First Study for Ramp Secret Sharing Schemes Through Greatest Common Divisor of Polynomials
