This HTML5 document contains 32 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/
n6http://www.math.uci.edu/~asilverb/bibliography/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14https://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/
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Torus_based_cryptography
dbo:wikiPageWikiLink
dbr:Torus-based_cryptography
dbo:wikiPageRedirects
dbr:Torus-based_cryptography
Subject Item
dbr:Index_of_cryptography_articles
dbo:wikiPageWikiLink
dbr:Torus-based_cryptography
Subject Item
dbr:Torus
dbo:wikiPageWikiLink
dbr:Torus-based_cryptography
Subject Item
dbr:Alice_Silverberg
dbo:wikiPageWikiLink
dbr:Torus-based_cryptography
Subject Item
dbr:Karl_Rubin
dbo:wikiPageWikiLink
dbr:Torus-based_cryptography
Subject Item
dbr:Torus-based_cryptography
rdfs:label
Torus-based cryptography
rdfs:comment
Torus-based cryptography involves using algebraic tori to construct a group for use in ciphers based on the discrete logarithm problem. This idea was first introduced by Alice Silverberg and Karl Rubin in 2003 in the form of a public key algorithm by the name of CEILIDH. It improves on conventional cryptosystems by representing some elements of large finite fields compactly and therefore transmitting fewer bits.
dcterms:subject
dbc:Public-key_cryptography
dbo:wikiPageID
563210
dbo:wikiPageRevisionID
905594875
dbo:wikiPageWikiLink
dbr:Torus dbr:Alice_Silverberg dbr:Group_(mathematics) dbr:Discrete_logarithm_problem dbr:Karl_Rubin dbc:Public-key_cryptography dbr:CEILIDH dbr:Cipher dbr:Public_key_algorithm dbr:Algebraic_torus
dbo:wikiPageExternalLink
n6:ceilidh.pdf
owl:sameAs
freebase:m.02qcpn wikidata:Q7827448 n14:4wQRs
dbp:wikiPageUsesTemplate
dbt:Crypto-stub dbt:No_footnotes
dbo:abstract
Torus-based cryptography involves using algebraic tori to construct a group for use in ciphers based on the discrete logarithm problem. This idea was first introduced by Alice Silverberg and Karl Rubin in 2003 in the form of a public key algorithm by the name of CEILIDH. It improves on conventional cryptosystems by representing some elements of large finite fields compactly and therefore transmitting fewer bits.
prov:wasDerivedFrom
wikipedia-en:Torus-based_cryptography?oldid=905594875&ns=0
dbo:wikiPageLength
870
foaf:isPrimaryTopicOf
wikipedia-en:Torus-based_cryptography
Subject Item
wikipedia-en:Torus-based_cryptography
foaf:primaryTopic
dbr:Torus-based_cryptography