Pages that link to "Item:Q694568"

The following pages link to Polynomial evaluation over finite fields: new algorithms and complexity bounds (Q694568):

Displaying 8 items.

• Enhanced public key security for the McEliece cryptosystem (Q271573) (← links)
• New polynomial-time algorithms for Camion bases (Q856883) (← links)
• Lower bounds of complexity for polarized polynomials over finite fields (Q2002473) (← links)
• On evaluating multivariate polynomials over finite fields (Q5233898) (← links)
• Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields (Q5301629) (← links)
• (Q5446299) (← links)
• Trace-based cryptanalysis of cyclotomic \(R_{q, 0} \times R_q\)-PLWE for the non-split case (Q6594641) (← links)
• Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping (Q6605318) (← links)