GSRS and GLRS codes contain GRS subcodes and are distinguishable from random codes via square-code methods when m+1 < k < n - ½(m² + 3m).
In: Proceedings of the 19th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’24)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CR 3years
2026 3roles
background 1polarities
background 1representative citing papers
Evidence-based taxonomy of security properties with first-order logic definitions and ProVerif/Tamarin executable examples derived from a 2022-2025 literature review of 53 studies.
The paper synthesizes PQC implementation literature across human, organizational, and technological dimensions, identifies an imbalance favoring technology, and proposes the PQC-HOT conceptual model to guide coordinated socio-technical transitions.
citing papers explorer
-
Distinguishers for Skew and Linearized Reed-Solomon Codes
GSRS and GLRS codes contain GRS subcodes and are distinguishable from random codes via square-code methods when m+1 < k < n - ½(m² + 3m).
-
Bridging Theory and Practice: An Executable Taxonomy of Security Properties for ProVerif and Tamarin
Evidence-based taxonomy of security properties with first-order logic definitions and ProVerif/Tamarin executable examples derived from a 2022-2025 literature review of 53 studies.
-
SoK: Post-Quantum Cryptography (PQC) Implementation in Software Systems
The paper synthesizes PQC implementation literature across human, organizational, and technological dimensions, identifies an imbalance favoring technology, and proposes the PQC-HOT conceptual model to guide coordinated socio-technical transitions.