Pages that link to "Item:Q1801194"
From MaRDI portal
The following pages link to Speeding up the number theoretic transform for faster ideal lattice-based cryptography (Q1801194):
Displaying 17 items.
- Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM (Q832329) (← links)
- Secure number theoretic transform and speed record for Ring-LWE encryption on embedded processors (Q1642452) (← links)
- Post-quantum key exchange for the Internet and the open quantum safe project (Q1698609) (← links)
- A note on the implementation of the number theoretic transform (Q1744861) (← links)
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes (Q1746962) (← links)
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption (Q1746967) (← links)
- NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
- FFT program generation for ring LWE-based cryptography (Q2128754) (← links)
- On using RSA/ECC coprocessor for ideal lattice-based key exchange (Q2145301) (← links)
- A monolithic hardware implementation of Kyber: comparing apples to apples in PQC candidates (Q2146081) (← links)
- Faster homomorphic encryption over GPGPUs via hierarchical DGT (Q2147259) (← links)
- Unified program generation and verification: a case study on number-theoretic transform (Q2163165) (← links)
- SLAP: simpler, improved private stream aggregation from ring learning with errors (Q2693220) (← links)
- The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs (Q2827724) (← links)
- Efficient Multiplication of Somewhat Small Integers Using Number-Theoretic Transforms (Q6487413) (← links)
- Implementing lattice-based PQC on resource-constrained processors: a case study for Kyber/Saber's polynomial multiplication on ARM Cortex-M0/M0+ (Q6623351) (← links)
- Exploring the advantages and challenges of Fermat NTT in FHE acceleration (Q6652893) (← links)
