Pages that link to "Item:Q694568"
From MaRDI portal
The following pages link to Polynomial evaluation over finite fields: new algorithms and complexity bounds (Q694568):
Displaying 4 items.
- Enhanced public key security for the McEliece cryptosystem (Q271573) (← links)
- On evaluating multivariate polynomials over finite fields (Q5233898) (← 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)