Conjugate coding is a cryptographic tool, introduced by Stephen Wiesner[1] in the late 1960s. It is part of the two applications Wiesner described for quantum coding, along with a method for creating fraud-proof banking notes. The application that the concept was based on was a method of transmitting multiple messages in such a way that reading one destroys the others. This is called quantum multiplexing and it uses photons polarized in conjugate bases as "qubits" to pass information.[2] Conjugate coding also is a simple extension of a random number generator.[3]

At the behest of Charles Bennett,[3] Wiesner published the manuscript explaining the basic idea of conjugate coding with a number of examples but it was not embraced because it was significantly ahead of its time.[4] Because its publication has been rejected, it was developed to the world of public-key cryptography in the 1980s as oblivious transfer, first by Michael Rabin and then by Shimon Even. It is used in the field of quantum computing. The initial concept of quantum cryptography developed by Bennett and Gilles Brassard was also based on this concept.[3]

References

edit
  1. ^ Wiesner, Stephen (1983). "Conjugate Coding". SIGACT News. 15 (1): 78–88. doi:10.1145/1008908.1008920. ISSN 0163-5700. S2CID 207155055.
  2. ^ Morris, Jeffrey; Grimaila, Michael; Hodson, Douglas; Jacques, David; Baumgartner, Gerald (2013). Emerging Trends in ICT Security: Chapter 9. A Survey of Quantum Key Distribution (QKD) Technologies. San Francisco, CA: Morgan Kaufmann Publishers. ISBN 9780128070666.
  3. ^ a b c Rogers, Daniel (2010). Broadband Quantum Cryptography. San Rafael, CA: Morgan & Claypool Publishers. p. 31. ISBN 9781608450596.
  4. ^ Morsch, Oliver (2008). Quantum Bits and Quantum Secrets: How Quantum Physics is Revolutionizing Codes and Computers. Berlin: John Wiley & Sons. p. 157. ISBN 9783527407101.


Stub icon

This cryptography-related article is a stub. You can help Wikipedia by adding missing information.

📚 Artikel Terkait di Wikipedia

Stephen Wiesner

Fascinating—Ideas behind IBM's Quantum Computer". Forbes. S.J. Wiesner, "Conjugate Coding", SIGACT News 15:1, pp. 78–88, 1983. Bennett, C.; Wiesner, S. J. (1992)

Conjugate gradient method

In mathematics, the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations, namely those whose

Quantum cryptography

New York, introduced the concept of quantum conjugate coding. His seminal paper titled "Conjugate Coding" was rejected by the IEEE Information Theory

Timeline of quantum computing and communication

after multiple expansions and rediscoveries. Stephen Wiesner invents conjugate coding. 13 June – James L. Park (Washington State University, Pullman)'s paper

Timeline of cryptography

states to encode information is first proposed: Stephen Wiesner invents conjugate coding and applies it to design “money physically impossible to counterfeit”

Quantum key distribution

early 1970s, introduced the concept of quantum conjugate coding. His seminal paper titled "Conjugate Coding" was rejected by IEEE Information Theory but

Oblivious transfer

Wiesner introduced a primitive called multiplexing in his seminal paper "Conjugate Coding", which was the starting point of quantum cryptography. Unfortunately

Quantum money

short time. Hidden Matching Problem Wiesner, Stephen (1983-01-01). "Conjugate Coding". SIGACT News. 15 (1): 78–88. doi:10.1145/1008908.1008920. ISSN 0163-5700