On the public citation graph
An Experimental Study of Building Blocks of Lattice-Based NIST Post-Quantum Cryptographic Algorithms
0 signed · 53 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-48059-5openalex-snapshot
Cryptographic Hardware and Embedded Systems
inferredcites →https://doi.org/10.1007/3-540-48059-5_9openalex-snapshot
Montgomery’s Multiplication Technique: How to Make It Smaller and Faster
inferredcites →https://doi.org/10.1007/978-3-319-48965-0openalex-snapshot
Cryptology and Network Security
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/978-3-540-73074-3openalex-snapshot
Arithmetic of Finite Fields
inferredcites →https://doi.org/10.1007/978-3-540-73074-3_10openalex-snapshot
Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
inferredcites →https://doi.org/10.1007/978-3-642-40041-4openalex-snapshot
Advances in Cryptology – CRYPTO 2013
inferredcites →https://doi.org/10.1007/978-3-642-40041-4_4openalex-snapshot
Learning with Rounding, Revisited
inferredcites →https://doi.org/10.1016/j.jsc.2013.09.002openalex-snapshot
Faster arithmetic for number-theoretic transforms
inferredcites →https://doi.org/10.1109/access.2018.2876401openalex-snapshot
An Efficient Algorithm for the Shortest Vector Problem
inferredcites →https://doi.org/10.1109/c-code.2017.7918952openalex-snapshot
Architectural review of polynomial bases finite field multipliers over GF(2m)
inferredcites →https://doi.org/10.1109/hpca.2019.00052openalex-snapshot
FPGA-Based High-Performance Parallel Architecture for Homomorphic Computing on Encrypted Data
inferredcites →https://doi.org/10.1109/iccd46524.2019.00054openalex-snapshot
Power, Area, Speed, and Security (PASS) Trade-Offs of NIST PQC Signature Candidates Using a C to ASIC Design Flow
inferredcites →https://doi.org/10.1109/tc.2017.2677426openalex-snapshot
Evaluation of Large Integer Multiplication Methods on Hardware
inferredcites →https://doi.org/10.1109/tcsi.2020.2983185openalex-snapshot
VPQC: A Domain-Specific Vector Processor for Post-Quantum Cryptography Based on RISC-V Architecture
inferredcites →https://doi.org/10.1109/tvlsi.2019.2922999openalex-snapshot
Optimized Schoolbook Polynomial Multiplication for Compact Lattice-Based Cryptography on FPGA
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.1137/s0097539795293172openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1145/3194554.3194616openalex-snapshot
Physical Protection of Lattice-Based Cryptography
inferredcites →https://doi.org/10.1587/transcom.2016ebp3189openalex-snapshot
Fast Montgomery Modular Multiplication and Squaring on Embedded Processors
inferredcites →https://doi.org/10.23919/eleco47770.2019.8990437openalex-snapshot
A Hardware Efficient Elliptic Curve Accelerator for FPGA Based Cryptographic Applications
inferredcites →https://doi.org/10.46586/tches.v2019.i4.17-61openalex-snapshot
Sapphire: A Configurable Crypto-Processor for Post-Quantum Lattice-based Protocols
inferredcites →https://doi.org/10.46586/tches.v2020.i1.123-151openalex-snapshot
Power Analysis on NTRU Prime
inferredcites →https://doi.org/10.46586/tches.v2020.i2.49-72openalex-snapshot
Highly Efficient Architecture of NewHope-NIST on FPGA using Low-Complexity NTT/INTT
inferredcites →https://doi.org/10.46586/tches.v2020.i3.269-306openalex-snapshot
Parameterized Hardware Accelerators for Lattice-Based Cryptography and Their Application to the HW/SW Co-Design of qTESLA
inferredcites →https://doi.org/10.6028/nist.ir.8105openalex-snapshot
Report on Post-Quantum Cryptography
inferredcites →https://doi.org/10.6028/nist.ir.8309openalex-snapshot
Status report on the second round of the NIST post-quantum cryptography standardization process
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-46077-7_22openalex-snapshot
A Survey of Software Implementations for the Number Theoretic Transform
inferred← citeshttps://doi.org/10.1007/978-981-97-8602-2_43openalex-snapshot
Post Quantum Cryptography: A Gentle Introduction of Lattice-Based Cryptography (Kyber, NTRUCrypto)
inferred← citeshttps://doi.org/10.1007/s41635-023-00134-2openalex-snapshot
A Versatile and Flexible Multiplier Generator for Large Integer Polynomials
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2024.109826openalex-snapshot
Evaluation of hardware and software implementations for NIST finalist and fourth-round post-quantum cryptography KEMs
inferred← citeshttps://doi.org/10.1016/j.heliyon.2024.e25470openalex-snapshot
A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem
inferred← citeshttps://doi.org/10.1016/j.knosys.2022.109543openalex-snapshot
Signature based Merkle Hash Multiplication algorithm to secure the communication in IoT devices
inferred← citeshttps://doi.org/10.1016/j.procs.2022.12.086openalex-snapshot
A Review of the Present Cryptographic Arsenal to Deal with Post-Quantum Threats
inferred← citeshttps://doi.org/10.1051/e3sconf/202338907013openalex-snapshot
Development of modification of the post-quantum public-key cryptosystem NTRUENCRYPT
inferred← citeshttps://doi.org/10.1051/e3sconf/202453103015openalex-snapshot
Problematics of protection of information resources of the enterprise
inferred← citeshttps://doi.org/10.1109/access.2024.3425813openalex-snapshot
Unif-NTT: A Unified Hardware Design of Forward and Inverse NTT for PQC Algorithms
inferred← citeshttps://doi.org/10.1109/ddecs52668.2021.9417065openalex-snapshot
An Open-source Library of Large Integer Polynomial Multipliers
inferred← citeshttps://doi.org/10.1109/nqcomp68334.2026.11497709openalex-snapshot
A Cross-Layer Survey on Lattice-Based Post-Quantum Cryptography: Side-Channel Security, Hardware Design, and Secure IoT Protocol Integration
inferred← citeshttps://doi.org/10.26565/2519-2310-2021-1-02openalex-snapshot
Research of implementation of candidates of the second round of NIST PQC competition focused on FPGA Xilinx family
inferred← citeshttps://doi.org/10.3390/app12094312openalex-snapshot
A Scalable Digit-Parallel Polynomial Multiplier Architecture for NIST-Standardized Binary Elliptic Curves
inferred← citeshttps://doi.org/10.3390/app13127018openalex-snapshot
Area-Efficient Realization of Binary Elliptic Curve Point Multiplication Processor for Cryptographic Applications
inferred← citeshttps://doi.org/10.3390/app14083323openalex-snapshot
A Flexible Hardware Accelerator for Booth Polynomial Multiplier
inferred← citeshttps://doi.org/10.3390/axioms12030304openalex-snapshot
An IND-CPA Analysis of a Cryptosystem Based on Bivariate Polynomial Reconstruction Problem
inferred← citeshttps://doi.org/10.3390/cryptography7020029openalex-snapshot
Timing-Attack-Resistant Acceleration of NTRU Round 3 Encryption on Resource-Constrained Embedded Systems
inferred← citeshttps://doi.org/10.3390/electronics11071131openalex-snapshot
An Efficient Crypto Processor Architecture for Side-Channel Resistant Binary Huff Curves on FPGA
inferred← citeshttps://doi.org/10.3390/electronics14112122openalex-snapshot
Accelerating CRYSTALS-Kyber: High-Speed NTT Design with Optimized Pipelining and Modular Reduction
inferred← citeshttps://doi.org/10.3390/electronics15030513openalex-snapshot
Deeply Pipelined NTT Accelerator with Ping-Pong Memory and LUT-Only Barrett Reduction for Post-Quantum Cryptography
inferred← citeshttps://doi.org/10.3390/iot2010005openalex-snapshot
Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms
inferred← citeshttps://doi.org/10.3390/s22052057openalex-snapshot
Multi-Unit Serial Polynomial Multiplier to Accelerate NTRU-Based Cryptographic Schemes in IoT Embedded Systems
inferred← citeshttps://doi.org/10.62056/anxrdkmolopenalex-snapshot
How to Benchmark Post-Quantum Accelerators
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.