This HTML5 document contains 34 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n7https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Micius_Quantum_Prize
dbo:wikiPageWikiLink
dbr:Conjugate_coding
Subject Item
dbr:Timeline_of_cryptography
dbo:wikiPageWikiLink
dbr:Conjugate_coding
Subject Item
dbr:Timeline_of_quantum_computing_and_communication
dbo:wikiPageWikiLink
dbr:Conjugate_coding
Subject Item
dbr:Conjugate_coding
rdf:type
dbo:Software
rdfs:label
Conjugate coding
rdfs:comment
Conjugate coding is a cryptographic tool, introduced by Stephen Wiesner 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. Conjugate coding also is a simple extension of a random number generator.
dcterms:subject
dbc:Cryptography
dbo:wikiPageID
5205299
dbo:wikiPageRevisionID
999218312
dbo:wikiPageWikiLink
dbc:Cryptography dbr:Quantum_programming dbr:Qubit dbr:Quantum_cryptography dbr:Random_number_generator dbr:Michael_O._Rabin dbr:Gilles_Brassard dbr:Oblivious_Transfer dbr:Quantum_computing dbr:Charles_H._Bennett_(computer_scientist) dbr:Stephen_Wiesner dbr:Shimon_Even dbr:Photon
owl:sameAs
n7:4iPQ9 freebase:m.0d7rs2 wikidata:Q5161153
dbp:wikiPageUsesTemplate
dbt:Short_description dbt:Crypto-stub dbt:Use_American_English
dbo:abstract
Conjugate coding is a cryptographic tool, introduced by Stephen Wiesner 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. Conjugate coding also is a simple extension of a random number generator. At the behest of Charles Bennett, 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. 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.
gold:hypernym
dbr:Tool
prov:wasDerivedFrom
wikipedia-en:Conjugate_coding?oldid=999218312&ns=0
dbo:wikiPageLength
2470
foaf:isPrimaryTopicOf
wikipedia-en:Conjugate_coding
Subject Item
wikipedia-en:Conjugate_coding
foaf:primaryTopic
dbr:Conjugate_coding