ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2605.21118v2· 19 results

cs.CRmath.FARecentMay 3, 2026

Limit Properties at Critical Indices of Linear Canonical Riesz Potentials and Their Applications to Security of Multi-Image Encryption

Zunwei Fu, Dachun Yang, Shuhui Yang

The paper introduces the linear canonical Riesz potential (LCRP) and analyzes its convergence properties, leveraging these findings to propose a novel, secure, and efficient asymmetric cascaded LCRP m…

View →
cs.CRcs.MMeess.IVRecentMay 15, 2026

A Method for Securely Transmitting Large Video Files Using Chaotic Compression and Encryption

Shiladitya Bhattacharjee, Subha Bhattacharya, Arnab Chatterjee, Sulabh Bansal +1 more

This paper proposes a novel Simultaneous Data Compression and Encryption (SDCE) system that combines chaotic map-based encryption with Huffman encoding to securely and efficiently transmit large video…

View →
cs.CRRecentMar 21, 2026

A chaotic flux cipher based on the random cubic family $f_{c_n}(z)=z^3+c_n z$

Pouya Mehdipour, Alexandre Miranda Alves, Gerardo Honorato, Mostafa Salarinoghabi

The paper proposes a novel symmetric stream cipher utilizing the chaotic dynamics of random cubic mappings in the complex plane to generate highly random and secure key streams.

View →
cs.CRRecentApr 9, 2026

Anamorphic Encryption with CCA Security: A Standard Model Construction

Shujun Wang, Jianting Ning, Qinyi Li, Leo Yu Zhang

The paper proposes a generic, standard model construction for Anamorphic Key Encapsulation Mechanisms (AKEM) that achieves strong IND-CCA security, addressing a major gap in covert communication crypt…

View →
cs.CRcs.CVRecentMay 7, 2026

Secure Seed-Based Multi-bit Watermarking for Diffusion Models from First Principles

Enoal Gesny, Eva Giboulot

The paper introduces a theoretically grounded evaluation framework for watermarking generative models, proposing a novel method (SSB) that allows for systematic design across all security-robustness-f…

View →
cs.CRRecentMay 20, 2026

Graph Structure of Chebyshev Permutation Polynomials over Binary and Ternary Adic Rings

Xiaoxiong Lu, Yuling Dai, Chengqing Li

This paper characterizes the graph structure, including cycle and path lengths, of Chebyshev permutation polynomials over the ring $\mathbb{Z}_{2^{k_1}3^{k_2}}$, demonstrating strong regularities desp…

View →
cs.CRRecentMay 29, 2026

When Entropy Is Not Enough: Multi-Modal Classification of Encrypted and Compressed Data Fragments

Fabio De Gaspari, Dorjan Hitaj, Samuele Salaris, Luigi V. Mancini

The paper proposes Triumvir, a multi-modal ensemble architecture that significantly improves the classification of small, raw data fragments to distinguish between encrypted and compressed data, outpe…

View →
cs.CVcs.AIRecentJun 1, 2026

Order within Chaos: Capturing Intrinsic Energy Anomalies for AI-Manipulated Image Forgery Localization

Yiming Wang, Baiqi Wu, Qingming Li, Jiahao Chen +2 more

The paper proposes FLAME, a novel framework that detects AI-generated image forgeries by identifying intrinsic energy anomalies caused by the diffusion process, achieving state-of-the-art localization…

View →
cs.CRRecentJun 2, 2026

Privacy-Preserving High-Resolution Image Gradient Computation Based on Fully Homomorphic Encryption

Yufei Zhou

The paper proposes a multi-ciphertext privacy-preserving framework to efficiently compute high-resolution image gradients using Fully Homomorphic Encryption (FHE) by dividing the large image into smal…

View →
cs.CRcs.ITRecentMar 24, 2026

Canonical Byte-String Encoding for Finite-Ring Cryptosystems

Kyrylo Riabov, Serhii Kryvyi

The paper introduces the base-m length codec, a canonical and robust encoding scheme that maps byte strings to lists of residues modulo m, essential for finite-ring cryptosystems.

View →
cs.CRRecentApr 14, 2026

Neural Stringology Based Cryptanalysis of EChaCha20

Victor Kebande

The paper introduces a Neural Stringology Cryptanalysis (NSC) framework that uses machine learning to detect subtle structural patterns in stream cipher keystreams, demonstrating its potential for eva…

View →
quant-phcs.CRRecentMay 6, 2026

Fundamental Limitations of Post-Quantum Cryptographic Architectures

Jiho Jung, Donghwa Ji, Mingyu Lee, Kabgyun Jeong

The paper argues that current lattice-based post-quantum cryptography, which relies on injecting noise, is not unconditionally secure because advanced quantum error correction and learning techniques…

View →
cs.CRRecentMay 26, 2026

Analyzing Linear Layers in Related-Differential Cryptanalysis

Yogesh Kumar, Akshay Ankush Yadav, Susanta Samanta

The paper systematically investigates the conditions under which linear layers in AES-like ciphers avoid related-differential structures, proving that the MDS property is necessary and identifying spe…

View →
cs.CRcs.ITRecentApr 20, 2026

Subcodes of Lambda-Gabidulin Codes for Compact-Ciphertext Cryptography

Freddy Lendé Metouké, Hervé Talé Kalachi, Hermann Tchatchiem Kamche, Ousmane Ndiaye +1 more

The paper analyzes subcodes of lambda-Gabidulin codes to construct highly efficient McEliece-like and Niederreiter-like cryptosystems, demonstrating that random subcodes of classical Gabidulin codes y…

View →
cs.CRmath.CORecentMay 21, 2026

Exact Hidden Paths in Noisy High Dimensional Path Spaces

Victor Duarte Melo

The paper introduces a mathematical and cryptographic framework for exactly recovering a single, noisy, high-dimensional discrete path from aggregated and incomplete observable data.

View →
cs.CRRecentMay 6, 2026

A Pragmatic Comparison of Cryptographic Computation Technologies for Machine Learning

Marcus Taubert, Adam Skuta, Thomas Loruenser

This paper provides a comparative analysis and benchmarking of Secure Multi-Party Computation (SMPC) and Fully Homomorphic Encryption (FHE) for machine learning, finding that the optimal choice depend…

View →
cs.CReess.SYRecentMay 14, 2026

On the (non-)resilience of encrypted controllers to covert attacks

Philipp Binfet, Janis Adamek, Moritz Schulze Darup

The paper demonstrates that standard homomorphic encryption (HE) schemes are insufficient to guarantee integrity in networked control systems (NCS) against covert attacks, proposing instead a verifiab…

View →
cs.CRmath.NTRecentApr 6, 2026

Cryptanalysis of the Legendre Pseudorandom Function over Extension Fields

Daksh Pandey

This paper provides the first comprehensive cryptanalysis of the Legendre Pseudorandom Function over extension fields, demonstrating key recovery attacks under both passive and active threat models.

View →
cs.CRcs.CVRecentMar 27, 2026

Privacy-Preserving Iris Recognition: Performance Challenges and Outlook

Christina Karakosta, Lian Alhedaithy, William J. Knottenbelt

The paper proposes a scalable, privacy-preserving framework for iris recognition using Fully Homomorphic Encryption (FHE), achieving accuracy comparable to cleartext while identifying the computationa…

View →