Algorithms for polynomial computation over finite fields form a crucial domain in computational mathematics, with extensive applications ranging from cryptography and ...
Multivariate cryptography and finite field algorithms are two interlocking research areas that underpin many modern cryptographic systems and computational methods. Multivariate cryptography relies on ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback