English
Related papers

Related papers: Shannon Perfect Secrecy in a Discrete Hilbert Spac…

200 papers

In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system,also popularly known as the One-Time Pad (OTP). Since then, it has been believed that the perfectly random and uncompressible OTP which is transmitted needs to…

Cryptography and Security · Computer Science 2007-05-23 Nithin Nagaraj , Vivek Vaidya , Prabhakar G Vaidya

In this letter, we prove that the perfectly secure One-Time Pad (OTP) encryption can be seen as finding the initial condition on the binary map under a random switch based on the perfectly random pad. This turns out to be a special case of…

Chaotic Dynamics · Physics 2008-03-04 Nithin Nagaraj , Prabhakar G. Vaidya

Shannon's perfect-secrecy theorem states that a perfect encryption system that yields zero information to the adversary must be a one-time pad (OTP) with the keys randomly generated and never reused. In this work we design the first…

Quantum Physics · Physics 2025-01-23 Zixuan Hu , Zhenyu Li

In response to the evolving landscape of quantum computing and the escalating vulnerabilities in classical cryptographic systems, our paper introduces a unified cryptographic framework. Rooted in the innovative work of Kuang et al., we…

Cryptography and Security · Computer Science 2024-02-08 Randy Kuang

Secure communication is the cornerstone of modern infrastructures, yet achieving unconditional security -resistant to any computational attack- remains a fundamental challenge. The One-Time Pad (OTP), proven by Shannon to offer perfect…

A process for the secure transmission of data is presented that has to a certain degree the advantages of the one-time pad (OTP) cipher, that is, simplicity, speed, and information-theoretically security, but overcomes its fundamental…

Cryptography and Security · Computer Science 2016-08-22 Uwe Starossek

A one-time pad (OTP) based cipher to insure both data protection and integrity when mobile code arrives to a remote host is presented. Data protection is required when a mobile agent could retrieve confidential information that would be…

Cryptography and Security · Computer Science 2007-05-23 Igor Sobrado

Shannon showed that to achieve perfect secrecy in point-to-point communication, the message rate cannot exceed the shared secret key rate giving rise to the simple one-time pad encryption scheme. In this paper, we extend this work from…

Information Theory · Computer Science 2020-05-29 Hongchao Zhou , Abbas El Gamal

As quantum computing matures into a practical paradigm, the need for secure and private quantum computation on untrusted hardware becomes increasingly urgent. While classical fully homomorphic encryption has enabled computation over…

Quantum Physics · Physics 2026-04-22 Jon Hernández-Bueno , Oscar Lage , Marivi Higuero , Jasone Astorga

We present a new construction of a One Time Pad (OTP) with inherent diffusive properties and a redundancy injection mechanism that benefits from them. The construction is based on interpreting the plaintext and key as members of a…

Cryptography and Security · Computer Science 2025-05-19 Alex Shafarenko

In this paper, we investigate the index coding problem in the presence of an eavesdropper. Messages are to be sent from one transmitter to a number of legitimate receivers who have side information about the messages, and share a set of…

Information Theory · Computer Science 2016-11-17 Mohammad Mahdi Mojahedian , Mohammad Reza Aref , Amin Gohari

The famous Shannon impossibility result says that any encryption scheme with perfect secrecy requires a secret key at least as long as the message. In this paper we provide its quantum analogue with imperfect secrecy and imperfect…

Information Theory · Computer Science 2019-01-08 Ching-Yi Lai , Kai-Min Chung

Cryptanalysis increases the level of confidence in cryptographic algorithms. We analyze the security of a symmetric cryptographic algorithm - quantum permutation pad (QPP) [8]. We found the instances of ciphertext the same as plaintext even…

Cryptography and Security · Computer Science 2023-04-24 Avval Amil , Shashank Gupta

Quantum secure direct communication is the direct communication of secret messages without first producing a shared secret key. It maybe used in some urgent circumstances. Here we propose a quantum secure direct communication protocol using…

Quantum Physics · Physics 2009-11-10 Fu-Guo Deng , Gui Lu Long

Among the problems to guarantee secrecy for in-transit information, the difficulties involved in renewing cryptographic keys in a secure way using couriers, the perfect secrecy encryption method known as One-Time-Pad (OTP) became almost…

Cryptography and Security · Computer Science 2020-06-02 Geraldo A Barbosa

We advocate a new approach of addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the Hidden Symmetry Subgroup Problem (HSSP), which is a generalization of the well-studied Hidden…

Quantum Physics · Physics 2014-07-11 Thomas Decker , Gábor Ivanyos , Miklos Santha , Pawel Wocjan

Shannon introduced the classic model of a cryptosystem in 1949, where Eve has access to an identical copy of the cyphertext that Alice sends to Bob. Shannon defined perfect secrecy to be the case when the mutual information between the…

Information Theory · Computer Science 2024-09-10 Angeles Vazquez-Castro , Masahito Hayashi

Isolated qubits are a special class of quantum devices, which can be used to implement tamper-resistant cryptographic hardware such as one-time memories (OTM's). Unfortunately, these OTM constructions leak some information, and standard…

Quantum Physics · Physics 2015-05-14 Yi-Kai Liu

We show how 1+1-dimensional fermionic symmetry-protected topological states (SPTs, i.e. nontrivial short-range entangled gapped phases of quantum matter whose boundary exhibits 't Hooft anomaly and whose bulk cannot be deformed into a…

Strongly Correlated Electrons · Physics 2021-02-23 Abhishodh Prakash , Juven Wang

One-time memories (OTM's) are simple, tamper-resistant cryptographic devices, which can be used to implement sophisticated functionalities such as one-time programs. Can one construct OTM's whose security follows from some physical…

Quantum Physics · Physics 2014-10-16 Yi-Kai Liu
‹ Prev 1 2 3 10 Next ›