On the public citation graph

Faster Implementation of Ideal Lattice-Based Cryptography Using AVX512

0 signed · 33 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11681878_8openalex-snapshot
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
inferredcites →https://doi.org/10.1007/978-3-319-47560-8_12openalex-snapshot
Speeding up R-LWE Post-quantum Key Exchange
inferredcites →https://doi.org/10.1007/978-3-319-48965-0_8openalex-snapshot
Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography
inferredcites →https://doi.org/10.1007/s10623-014-9938-4openalex-snapshot
Worst-case to average-case reductions for module lattices
inferredcites →https://doi.org/10.1090/s0025-5718-1965-0178586-1openalex-snapshot
An Algorithm for the Machine Calculation of Complex Fourier Series
inferredcites →https://doi.org/10.1090/s0025-5718-1971-0301966-0openalex-snapshot
The Fast Fourier Transform in a Finite Field
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/access.2021.3138807openalex-snapshot
A Survey of Polynomial Multiplication With RSA-ECC Coprocessors and Implementations of NIST PQC Round3 KEM Algorithms in Exynos2100
inferredcites →https://doi.org/10.1137/s0036144598347011openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1145/1568318.1568324openalex-snapshot
On lattices, learning with errors, random linear codes, and cryptography
inferredcites →https://doi.org/10.1145/2633600openalex-snapshot
(Leveled) Fully Homomorphic Encryption without Bootstrapping
inferredcites →https://doi.org/10.1145/3005344openalex-snapshot
Faster Polynomial Multiplication over Finite Fields
inferredcites →https://doi.org/10.1145/3447812openalex-snapshot
A Software/Hardware Co-Design of Crystals-Dilithium Signature Scheme
inferredcites →https://doi.org/10.1145/3465481.3465756openalex-snapshot
Implementing CRYSTALS-Dilithium Signature Scheme on FPGAs
inferredcites →https://doi.org/10.1145/3618260openalex-snapshot
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
inferredcites →https://doi.org/10.1145/800205.806332openalex-snapshot
Practical fast polynomial multiplication
inferredcites →https://doi.org/10.46586/tches.v2018.i1.238-268openalex-snapshot
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme
inferredcites →https://doi.org/10.46586/tches.v2018.i3.243-266openalex-snapshot
Saber on ARM
inferredcites →https://doi.org/10.46586/tches.v2020.i3.219-242openalex-snapshot
ISA Extensions for Finite Field Arithmetic
inferredcites →https://doi.org/10.46586/tches.v2020.i3.336-357openalex-snapshot
Cortex-M4 optimizations for {R,M} LWE schemes
inferredcites →https://doi.org/10.46586/tches.v2020.i4.239-280openalex-snapshot
RISQ-V: Tightly Coupled RISC-V Accelerators for Post-Quantum Cryptography
inferredcites →https://doi.org/10.6028/nist.fips.202openalex-snapshot
SHA-3 standard :
inferredcites →https://doi.org/10.6028/nist.ir.8105openalex-snapshot
Report on Post-Quantum Cryptography

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-70890-9_7openalex-snapshot
Faster Post-quantum TLS 1.3 Based on ML-KEM: Implementation and Assessment
inferred← citeshttps://doi.org/10.1007/978-3-032-01806-9_9openalex-snapshot
PQMagic: Towards Secure and Efficient Post Quantum Cryptography Implementations
inferred← citeshttps://doi.org/10.1007/s11227-025-07179-wopenalex-snapshot
Parallel implementation of OCB using VAES and GPUs
inferred← citeshttps://doi.org/10.1007/s11276-025-03906-6openalex-snapshot
A survey on isogeny-based cryptographic protocols
inferred← citeshttps://doi.org/10.1109/jiot.2025.3579456openalex-snapshot
MUSI-PQC: A Post-Quantum Cryptographic Protocol for Reliable and Trustworthy 6G-IoT Music Systems
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3575915openalex-snapshot
Optimized Vectorization Implementation of CRYSTALS-Dilithium
inferred← citeshttps://doi.org/10.1145/3687309openalex-snapshot
Optimizing Dilithium Implementation with AVX2/-512
inferred← citeshttps://doi.org/10.1145/3715328openalex-snapshot
PUF-Dilithium: Design of a PUF-Based Dilithium Architecture Benchmarked on ARM Processors
inferred← citeshttps://doi.org/10.1145/3733820.3764681openalex-snapshot
Beyond the Breaker: Evaluating Post-Quantum Cryptographic Algorithms for Practical Smart Grid Deployment
inferred← citeshttps://doi.org/10.4018/979-8-3693-7076-6.ch012openalex-snapshot
Pre-Quantum to Post-Quantum Cryptography Transition
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.