Published file metadata, source observations, indicators, and research history in one bounded catalog.
64Reachable catalog records
2 / 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: Indistinguishability Lifting for Keyed Oracles, Compressed Ideal Cipher, and More Applications Ritam Bhaumik, Yu-Hsuan Huang Cryptographic security proofs often involve an adversary interacting with a larger, keyed oracle that consists of (potentially exponentially) many independent instances of a smaller, base oracle. Examples include ideal ciphers, which provide access to an indep
First reported Oct 05, 2026 18:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: N2SF-Based Post-Quantum Cryptography Migration Framework for Data in National and Public Institutions Do-Yun Park, Yu-Lim Hyoung, Hwa-Jeong Seo This paper proposes post-quantum cryptography (PQC) migration decision criteria for data in national and public institutions, based on the protection requirements of the National Network Security Framework (N2SF) and the cryptographic depend
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Optimized LLL Algorithm Zhengjun Cao, Lihua Liu The LLL algorithm involves reductions and swaps, corresponding to projection and ordering conditions. But the transformation $\vec{b}'_i\leftarrow \vec{b}_i- \lfloor\mu_{i,k} \rceil\vec{b}_k$ is not a general size-reduction, where $\mu_{i,k}=\frac{\langle \vec{b}_i, \vec{b}_k^* \rangle}{\langle \vec{b}_k^*, \vec{b}_k^* \rangle} $, $\ve
First reported Oct 07, 2026 01:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: When Masking Preimage Computation Isn’t Enough: A Power Analysis Attack on Masked Implementations of Falcon Keng-Yu Chen In this paper, we present a novel power analysis attack targeting a Falcon implementation protected by a masked preimage computation. By analyzing the ratio between the real and imaginary parts of the public hash polynomial, we demonstrate that the leakage during
First reported Oct 04, 2026 21:48 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Multiparty Homomorphic Secret Sharing From Distributed Discrete Logarithm Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl Homomorphic secret sharing (HSS) enables non-interactive distributed evaluation of functions on secret-shared inputs. While two-party HSS is well understood, multiparty constructions remain limited in expressiveness and efficiency. We present a general
First reported Oct 04, 2026 21:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Glimpsing the Leakage Flow for Deep Learning-Based Side-Channel Analysis using Stochastic Leakage Model Trevor Yap, Shivam Bhasin Deep learning has become the dominant method for profiled Side-Channel Analysis (SCA), successfully recovering secret keys even in the presence of strong countermeasures. Despite its efficacy, Deep Neural Networks (DNNs) are predominantly black-box in nat
First reported Oct 07, 2026 01:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Optimized NEON Implementation of MAYO on Apple M1 Minwoo Lee, Minjoo Sim, Siwoo Eum, Hwajeong Seo MAYO is one of nine third-round candidates in NIST’s process for additional post-quantum signatures. Its third-round specification of August 2026 changed the level-1 parameters and added a hash-derived linear term Λ to the verification equation, so earlier optimised implementations no l
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: One-Round Threshold XMSS and SPHINCS+ from Fully Homomorphic Encryption Jung Hee Cheon, Kevin Choi, Hyeoncheol Joo, Taeseong Kim While hash-based signatures such as XMSS and SPHINCS$^+$ are well-established and play a key role in post-quantum cryptography, thresholdizing them to enable use in distributed systems remains a challenge. In particular, their lack of exploitable structure
First reported Oct 07, 2026 01:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Beyond Mosca’s Heuristic: Supported Is Not Protected in Post-Quantum Migration Abdoul Ahad FALL Post-quantum (PQ) migration is usually tracked per asset, with Mosca’s inequality and a share of “migrated” systems. For a flow of sensitive data, the relevant questions are different: is every session that carries it keyed by a quantum-safe secret, what evidence supports that claim, and
First reported Oct 05, 2026 17:36 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Three-Move Blind Signatures from DL Rutchathon Chairattana-Apirom, Michael Reichle, Stefano Tessaro This paper considers the problem of building blind signatures in pairing-free groups. We provide the first three-move blind signature which is provably one-more unforgeable, in the random-oracle model, under the minimal assumption that the discrete logarithm (DL) problem is hard. Our
First reported Oct 04, 2026 21:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Comparative Evaluation of Open-Source Gröbner Basis Implementations for Small-Scale AES Polynomial Systems over GF(2) Pavel Holý, Martin Jureček The practical performance of Gröbner basis implementations depends on the polynomial systems being solved. This work evaluates 20 open-source imple- mentations with Magma as a proprietary reference on systems derived from small-scale AES ov
First reported Oct 07, 2026 01:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Explicit Nonlinear Functions beyond the Fourier bound Swastik Kopparty, Rishabh Kothary, Shanthanu S. Rai We study the problem of constructing highly nonlinear vectorial maps $F: \mathbb{F}_2^n \to \mathbb{F}_2^m$. Concretely, we want an $F$ and an $A = A(m,n)>0$ as small as possible, so that for every affine map $L: \mathbb{F}_2^n \to \mathbb{F}_2^m$ (of the form $L(x) = Mx + b$) w
First reported Oct 05, 2026 17:36 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Processing-Time Effects on PQC-Based Over-the-Air Rekeying over CCSDS TC/TM Links Ha-Gyeong Kim, Hwa-Jeong Seo When post-quantum cryptography (PQC)-based over-the-air rekeying (OTAR) is evaluated over CCSDS Telecommand (TC) and Telemetry (TM) links, omitting endpoint processing time can change not only the final transport outcome but also the protocol execution path shaped by COP-1
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Mechanized Proofs of ORAM Correctness, Security, and Failure Bounds Manuel Barbosa, Gilles Barthe, Gustavo Delerue, Benjamin Gregoire, Pierre-Yves Strub, Xingyu Xie ORAM is a fundamental cryptographic technique that permits outsourcing memory storage while probabilistically hiding memory access patterns of client programs. We use the EasyCrypt proof assistant to obtain fully mechani
First reported Oct 05, 2026 17:48 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: ATLAS: A Compact Module-LWR Signature Scheme Karthick Srivatsan, Debranjan Pal, Anindya Ganguly, Suparna Kundu, Abhinava De, Puja Mondal, Harry Hart, Quinten Norga, Prajna Mahadev, Supriya Adhikary, Debayan Das, Chaoyun Li, Angshuman Karmakar We present $\mathsf{ATLAS}$, a lattice-based digital signature scheme built on the Fiat--Shamir with aborts paradigm, with security based on t
First reported Oct 05, 2026 18:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Randomness-Anchored Runtime Discovery of Cryptographic Operations on Linux Using eBPF Sumin Jeong, Yulim Hyoung, Hagyeong Kim, Huiju Kang, Hwajeong Seo Migration to post-quantum cryptography requires knowing not only which cryptographic libraries are present on a system, but which algorithms are actually executed at runtime. Static binary analysis answers the former question; the la
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Trapdoor Projective Sampling and Identity-Based Anonymous Broadcast Gaspard Meunier, Duong Hieu Phan In anonymous broadcast encryption, a ciphertext hides both the message and the set of recipients. In the general case, a lower bound of Kiayias and Samari forces the ciphertext to grow linearly with the number of recipients, a bound already met by the trivial per-recipient solution.
First reported Oct 05, 2026 19:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Automorphism-Compatible NTT and its Application to Homomorphic Encryption Charanjit S. Jutla, Nathan Manohar, Guy Moshkowich For $N$ a power of $2$, the negacyclic number-theoretic transform (NTT) maps a degree $N-1$ polynomial to its evaluations at the $N$ primitive $2N$th roots of unity. In-place butterfly algorithms such as Cooley-Tukey and Gentleman-Sande compute the negacyclic
First reported Oct 05, 2026 18:48 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Post-Quantum Command Authentication for Unmanned Systems: A KpqC Feasibility Study under Real-Time and Bandwidth Constraints Yulim Hyoung, Daeun Lim, Jiwon Bang, Doyun Park, Hagyeong Kim, Hwajeong Seo The command and authentication channels of unmanned systems (UAVs and UGVs) still rely on classical public-key cryptography, which large-scale quantum computers threaten. Migrating the
First reported Oct 07, 2026 01:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: On the Instantiability of the Fujisaki–Okamoto Transform for Trapdoor Functions Carter Luck, Xinyu Mao, Adam O'Neill The Fujisaki--Okamoto (FO) transform (Journal of Cryptology, 2013) is the standard route from weakly secure public-key encryption to chosen-ciphertext security, and it underlies many practical post-quantum key-encapsulation schemes, including ML-KEM. Security proofs f
First reported Oct 07, 2026 01:24 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Query-Limited RAM Programs and their Applications Jiahui Liu, Justin Raizes, Bhaskar Roberts, Omri Shmueli Quantum one-time programs (Broadbent, Gutoski and Stebila, CRYPTO 2013) or OTPs for short, enable a functionality to be encoded into a quantum token that can be evaluated on a single chosen input and then becomes unusable. While powerful, this primitive is inherently stateless
First reported Oct 05, 2026 19:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Bitwise-Optimal Cryptography: From One-Wayness to Pseudorandomness and Target Collision Resistance Benny applebaum We study cryptographic primitives that are both locally computable (i.e., in $\mathrm{NC}^0$) and exponentially secure. For pseudorandom generators (PRGs) and universal one-way hash functions (UOWHFs), we further require linear stretch and linear compression, respective
First reported Oct 05, 2026 19:12 UTCCatalog metadata updated Oct 08, 2026 03:46 UTCOpen evidence record
ePrint Report: Low-Latency Parallel Digit Decomposition and Sign Evaluation for CKKS Jung Hee Cheon, Kyungah Cho, Junyoung Jung, Junho Lim Nonlinear functions such as sign, comparison, and ReLU are commonly evaluated in CKKS by approximating them with polynomials. The sign jumps at zero, so inputs on the two sides of zero, however close, must be mapped to outputs that differ by a constant. Compari
First reported Oct 07, 2026 01:24 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.