scholarly journals Complexity of Polynomial Multiplication over Finite Fields

Author(s):  
Michael Kaminski
2017 ◽  
Vol 63 (6) ◽  
pp. 1-23 ◽  
Author(s):  
David Harvey ◽  
Joris Van Der Hoeven ◽  
Grégoire Lecerf

Mathematics ◽  
2020 ◽  
Vol 8 (8) ◽  
pp. 1200
Author(s):  
Selda Çalkavur ◽  
Patrick Solé ◽  
Alexis Bonnecaze

In this paper, we examine a secret sharing scheme based on polynomials over finite fields. In the presented scheme, the shares can be used for the reconstruction of the secret using polynomial multiplication. This scheme is both ideal and perfect.


1989 ◽  
Vol 36 (1) ◽  
pp. 150-170 ◽  
Author(s):  
Michael Kaminski ◽  
Nader H. Bshouty

2019 ◽  
Vol 10 (3) ◽  
pp. 197-210 ◽  
Author(s):  
Alessandro De Piccoli ◽  
Andrea Visconti ◽  
Ottavio Giulio Rizzo

Sign in / Sign up

Export Citation Format

Share Document