Conference paper
Byzantine-Robust Decentralized Federated Learning
Minghong Fang, Zifan Zhang, et al.
CCS 2024
We explain how factoring polynomials over finite fields can be used in computing logarithms in fields of characteristic two, and how this has applications in cryptography. This letter describes work which is described in more detail in Coppersmith (1984)—here we concentrate on the use of computer algebra, in particular the new SCRATCHPAD system (Jenks, 1984). © 1985, Academic Press Inc. (London) Ltd.. All rights reserved.
Minghong Fang, Zifan Zhang, et al.
CCS 2024
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002