An unbreakable cryptosystem for common people

Arindam MitraarXiv 2006 · arXiv

Introduction

Traditional cryptographic systems often present a paradox for the average user: they provide high levels of security but rely on complex mathematical foundations—such as the difficulty of factoring large primes—or require the mediation of trusted third-party certificate authorities. For the "common person," establishing a truly secure communication channel without specialized hardware or deep technical expertise remains a significant hurdle.

This paper proposes a novel approach to bridge this gap. By leveraging a specific algorithm designed to generate high-entropy keys from simple, manual inputs (like coin tosses), the author, Arindam Mitra, suggests a method for achieving information-theoretic security on classical computing hardware. The goal is to democratize high-level encryption, moving it away from "black box" corporate technologies and into the hands of individuals.

Methodology

The proposed system is built upon the premise that true randomness can be harnessed and expanded through a deterministic algorithm. The process follows a structured four-step workflow:

  1. Manual Entropy Generation: Two parties wishing to communicate must first generate three initial sequences of random numbers. The author emphasizes that this can be done using accessible methods, such as flipping a coin, ensuring that the source of entropy is entirely under the user's control.
  2. Key Derivation: These three sequences are processed by a specific algorithm (referenced as "Algorithm [3]" in the author's broader work) to produce a common $n$-bit cryptographic key.
  3. Encryption: The resulting $n$-bit key is used to encrypt an $n$-bit message, effectively functioning as a stream cipher.
  4. Recursive Security: To defend against plaintext attacks—where an eavesdropper might attempt to reverse-engineer the secret keys from intercepted messages—the system employs a recursive technique. New, independent keys are encrypted using the current key and transmitted to refresh the system for future communications.

Security Analysis

Combinatorial Complexity

The security of this system is not based on the computational difficulty of a mathematical problem, but rather on the sheer scale of the input state space. To successfully execute a plaintext attack, an adversary would need to test approximately $2^{2n} (2^{2n} - 1) (2^{2n} - 2)$ combinations of input sequences.

For a practical key size of $n = 500$, the number of possible combinations exceeds $2^{500}$, a figure that surpasses the estimated number of atoms in the observable universe. This combinatorial explosion renders brute-force attacks practically impossible, even for adversaries with near-infinite computing power.

Information-Theoretic Security

The author classifies this system as "information-theoretically secure." This is the highest standard of cryptography, shared by the One-Time Pad (OTP). In such a system, the ciphertext provides no information about the plaintext without the key, regardless of the attacker's resources. The probability of an eavesdropper successfully guessing an $n$-bit key or message is mathematically fixed at $1/2^n$.

Discussion and Limitations

While the proposal offers a compelling vision for accessible encryption, it faces several theoretical and practical challenges:

  • The Initial Exchange: Like all symmetric-key systems, the security of the entire chain depends on the initial, secret exchange of the three random sequences. The paper assumes this exchange happens securely but does not provide a protocol for doing so without an existing secure channel.
  • The Nature of Randomness: A central and provocative claim of the paper is that a classical, deterministic algorithm can generate "true" random numbers. In standard computer science, algorithmic outputs are typically classified as pseudo-random. Validating the author's claim would require rigorous empirical testing using standardized suites like NIST or Dieharder to ensure the output is statistically indistinguishable from hardware-generated entropy.
  • Algorithmic Transparency: The specific logic of the underlying algorithm is not detailed in this summary, necessitating a review of the author's previous technical publications to fully audit the security claims.

Conclusion

The proposed cryptosystem represents a shift toward user-centric security. By utilizing manual entropy and an algorithm that scales that entropy into a massive state space, the system aims to provide "unbreakable" protection for common users. If the author's claims regarding classical true randomness hold under scrutiny, this method could offer a viable alternative to current infrastructure-heavy cryptographic standards, placing the power of information-theoretic security directly in the hands of the individual.

Summary updated

BibTeX
@misc{mitra2006unbreakable,
  author = {Arindam Mitra},
  title = {{An unbreakable cryptosystem for common people}},
  year = {2006},
  eprint = {cs/0610152},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/cs/0610152},
}
Figure