Published file metadata, source observations, indicators, and research history in one bounded catalog.
64Reachable catalog records
1 / 3Current catalog page
24Maximum records per page
0Samples downloaded by this page
Feed collection status
Sources represented on this page. Publication and observation dates describe the content; successful batch dates describe local collection. A recent batch does not certify complete coverage or current provider availability.
src_e53adb99e40ae66258Collection status unverifiedLast successful batch: Unverified
Stale means older than twice the recorded collection interval, with a minimum of one hour; without an interval, the threshold is 24 hours. Cached content remains available while a feed is stale, paused, or unverified.
64 MATCHING RECORDSMETADATA ONLY / SOURCE ATTRIBUTION PRESERVED
ePrint Report: Deploying Native-Rust KpqC: Pluggable Post-Quantum KEMs and Signatures across TLS, Space Links, and the OQS Ecosystem Yulim Hyoung, Doyun Park, Hyunji Kim, Hwajeong Seo Post-quantum migration is no longer only an algorithm problem but a deployment problem: standardized schemes must be dropped into real protocol stacks, on real (often resource-constrained) targets, without giving up
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Simple Extremely Lossy Functions from Small-Exponent Hashing Damiano Abram, Agni Datta, Archisman Dutta, Lawrence Roy Extremely Lossy Functions (ELFs) are a standard model primitive that captures many useful properties of random oracles (Zhandry, Crypto 2016). While there are many variations of ELFs with additional properties, every construction (excluding obfuscation) has followed
First reported Oct 07, 2026 01:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: It Takes Two: Proofs of Work for Fiat–Shamir Benedikt Bünz, Jessica Chen, Ziyi Guan In the random oracle model (ROM), proof of work (PoW) serves two roles in the Fiat–Shamir transformation. First, in challenge grinding, the prover must solve a puzzle for each candidate challenge, which amplifies soundness and reduces proof size and verifier time. This requires a non-amortizing PoW:
First reported Oct 05, 2026 18:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Fast Linear Codes over Large Fields: Addition-Only and Small-Coefficient Encoders Stanislav Peceny, Peter Rindal We construct fast linear codes over large fields using addition-only encoders and variants with small integer coefficients. A local precode is followed by rounds of a random permutation and a scan, a linear recurrence with a short feedback window. At dimension $2^{20}$, r
First reported Oct 04, 2026 22:00 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: What Makes Lattice Key Generation Expensive? Controlled Cost Attribution with Structured LWR, ML-KEM, and HAETAE on Cortex-M4 Yan Zhang, Meizi Li, Liang Tan End-to-end cycle counts quantify lattice key-generation time on a microcontroller, but not which implementation decisions create that cost. We develop a controlled attribution method for public structure, candidate admission, an
First reported Oct 05, 2026 19:00 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: MiniSHAKE Guido Bertoni, Joan Daemen, Seth Hoffert, Silvia Mella, Michaël Peeters, Gilles Van Assche, Ronny Van Keer The overwhelming majority of the Keccak instances standardized and used in practice today make use of the Keccak-$f$ [1600] permutation or reduced-round versions of it. There are a few use cases where using a smaller permutation width would be beneficial, notably when
First reported Oct 07, 2026 01:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: SPIN: Fast Codes for Correlation Generation and Polynomial Commitments Stanislav Peceny, Rahul Rachuri, Srinivasan Raghuraman, Peter Rindal Binary codes used in correlation generation and proof systems need strong distance, fast ordinary and transposed encoding, and regular memory access. We introduce Single-Permutation INterleaved (SPIN) codes, combining a blockwise outer encoder,
First reported Oct 04, 2026 22:00 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: X-Wing on Cortex-M85: Architecture-Aware Integration and End-to-End Evaluation Do-Yun Park, Hwa-Jeong Seo X-Wing combines ML-KEM-768 and X25519 for hybrid key establishment. On Cortex-M85, we adapted the coefficient representation and storage order of an MVE NTT to the existing ML-KEM path and optimized data-format transformations and X25519 arithmetic while preserving draft-10. Dur
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Understanding Sigma Protocols via MPC-in-the-Head Haiyang Xue In this paper, we propose an understanding of classical Sigma protocols (as denoted by $\Sigma$-protocols in the literature) through the lens of the MPC-in-the-head (MPCitH) paradigm. We seek not to construct new schemes, but to build a formal bridge connecting these two foundational areas. While many elegant yet foundati
First reported Oct 05, 2026 18:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Extract-Amplify-Measure: Single-Sided and Tight O2H with Applications to CCA Security in the Quantum Random Oracle Model Jiangxia Ge, Kang Yang, Yu Yu The One-Way-to-Hiding (O2H) theorem is a useful tool for analyzing reprogramming in the quantum random oracle model (QROM). It bounds the distinguishing advantage by the probability $\epsilon$ that a one-wayness attacker finds the rep
First reported Oct 07, 2026 05:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Public-coin Differing-input Obfuscation from KOALA and iO Liyan Chen, Vinod Vaikuntanathan We show that the recent construction of witness encryption (Hair and Sahai, arXiv:2609.18275v1) is a public-coin extractable witness encryption scheme under the Knowledge of Orthogonality Assumption, or KOALA for short (Buellens-Wee, PKC 2019). As an immediate application, we obtain public-coi
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: The Power of Permutable PRPs: Towards Trapdoor Permutations with Full Key and Message Domains Shany Ben-David, Eylon Yogev Shmueli and Zhandry introduced permutable pseudorandom permutations (PRPs) and used them to construct trapdoor permutations with a full message domain but a sparse public-key space. We extend this approach to construct puncturable trapdoor permutations with full
First reported Oct 05, 2026 19:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Rotate Once, Read Many Times: on the Output Noise of Multi-Value Bootstrapping Philippe Chartier, Michel Koskas, Mohammed Lemou In FHEW/TFHE, a programmable bootstrap evaluates an arbitrary function of the encrypted message, encoded as the \emph{test polynomial} of a blind rotation. We work in a prime-power cyclotomic ring whose prime is the plaintext modulus $p$ (a \emph{design cho
First reported Oct 05, 2026 19:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: The Humbert Form of Discriminant 36, and What It Says About Splitting Detection Tony Shaska Explicit equations for the locus $\mathcal{L}_n$ of genus-two curves with a maximal degree-$n$ elliptic subcover have been computed only for $n \le 5$, and by elimination, whose cost is not predictable in advance. The degree formula of [22] changes this. It gives $\deg_w F_n = k(H_{n^2}) - 10
First reported Oct 05, 2026 18:48 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Batched LSH on ARMv8 NEON and Its Application to K-SPHINCS+ Ji-Won Bang, Su-Been Cho, Yu-Lim Hyoung, Ha-Gyeong Kim, Hwa-Jeong Seo With FIPS 205 standardizing post-quantum signatures and ARMv8 spanning mobile, embedded, and server platforms, fast hash-based signing on ARM has become a pressing need. Since these schemes are dominated by hash calls, hash optimization largely determines
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Enhancing One-Way to Hiding Theorems with Amplitude Amplification Bohang Chen, Shuai Han, Geng Wang, Xinyi Huang The one-way to hiding (O2H) theorem and its variants, which bound the distinguishing advantage in terms of the one-way advantage, are widely used in security proofs in the quantum random oracle model (QROM), particularly for key encapsulation mechanisms (KEMs). However, e
First reported Oct 05, 2026 19:00 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Area-Efficient Hardware Architecture of the Post-Quantum HQC Cryptosystem with Side-Channel Protection Kamal Raj, Peizhou Gan, Sayan Das, Anupam Chattopadhyay The Hamming-Quasi Cyclic (HQC) is the Post-Quantum Cryptography (PQC) Key Encapsulation Mechanism (KEM) algorithm recently selected by the National Institute of Standards and Technology (NIST) for standardization as an alterna
First reported Oct 07, 2026 01:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Measuring Parallel Execution of Classical–PQC Component Pairs in Hybrid TLS 1.3 Siwoo Eum, Minho Song, Seung-Won Lee, Hwajeong Seo Hybrid key exchange and Composite ML-DSA signatures in TLS 1.3 split one operation into a classical component and a post-quantum cryptography (PQC) component that do not depend on each other. Using a cryptographic workload of the TLS handshake rather tha
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Ziren: Succinct Arguments for MIPS32 Execution Stephen Duan A succinct argument for machine execution convinces a verifier that a program compiled for a real instruction set ran correctly, with a proof far shorter than the execution and a check far cheaper than replaying it. We present Ziren, a production zkVM for MIPS32: it proves 77 user-mode integer instructions of MIPS32r2 and h
First reported Oct 05, 2026 19:00 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: BOLT-FHE: An Efficient Unified Framework for GPU-based TFHE Bootstrapping via On-Chip Local Tiling Strategies Yanren Chen, Fangyu Zheng, Guang Fan, Jiankuo Dong, Wenxu Tang, Tian Zhou, Jingqiang Lin, Jiwu Jing Bootstrapping is the main performance bottleneck in bitwise Fully Homomorphic Encryption (FHE), and practical acceleration requires careful orchestration of the blind rotation
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Rare-Event Decorrelation for Linear Tests of Low-Complexity Pseudorandom Functions Nikolas Melissaris Linear tests are a basic obstacle to pseudorandom functions built from low-depth circuits and secret linear or affine maps. Ball, Ducros, Erabelli, Kohl, Resch, and Scholl left open whether their bounded-query strong-PRF candidate in $\mathrm{AC}^0[2]$ resists general non-adaptive l
First reported Oct 07, 2026 01:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: An Input-Fed AES-Round Family for Fixed-Length Hashing Peter Rindal Secure computation often hashes high-entropy fixed-length values in inner loops. A public permutation with terminal Davies--Meyer feed-forward can expose the permutation value when an application applies another feed-forward step. We study an input-fed alternative that injects the input after every AES round. The ba
First reported Oct 04, 2026 22:00 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: HyBind: Structural Analysis of PQ/T Hybrid Cryptographic Usage Jongbeom Ahn, Minseo Kim, Moonsun Heo, Subeen Cho, Hwajeong Seo The quantum threat to traditional public-key cryptography makes migration to post-quantum cryptography necessary. During migration, the presence of both post-quantum and traditional (PQ/T) algorithms does not establish that their outputs jointly determine a
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: ECLIPSE: Strongly Unforgeable Isogeny Signatures from the Prime-Degree Variant of PRISM Dustin Ray ECLIPSE is the prime-degree signature construction that the PRISM authors describe next to their salted scheme, with that salt, implemented. It exists because a two-dimensional isogeny signature carries an auxiliary isogeny that the hash does not bind: the SQIsign round-3 specification
First reported Oct 04, 2026 21:48 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
A filename, label, or report mention alone does not establish maliciousness. Observation dates describe cited sources; collection dates describe this local metadata catalog. No malware samples are stored, fetched, or executed by these pages.