Pages that link to "Item:Q5281178"
From MaRDI portal
The following pages link to Additive Fast Fourier Transforms Over Finite Fields (Q5281178):
Displaying 12 items.
- Simple algorithms for decoding systematic Reed-Solomon codes (Q356717) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- A practicable timing attack against HQC and its countermeasure (Q2158241) (← links)
- Fast transforms over finite fields of characteristic two (Q2229746) (← links)
- Fast Hermite interpolation and evaluation over finite fields of characteristic two (Q2284960) (← links)
- Fast systematic encoding of multiplicity codes (Q2422714) (← links)
- A New Algorithm for Decoding Reed-Solomon Codes (Q3448743) (← links)
- (Q5150372) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- On interactive oracle proofs for Boolean R1CS statements (Q6045202) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs (Q6104347) (← links)