Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1465057> ?p ?o }
Showing triples 1 to 25 of
25
with 100 triples per page.
- Q1465057 subject Q8376561.
- Q1465057 abstract "In cryptography, a Schnorr signature is a digital signature produced by the Schnorr signature algorithm. Its security is based on the intractability of certain discrete logarithm problems. The Schnorr signature is considered the simplest digital signature scheme to be provably secure in a random oracle model. It is efficient and generates short signatures. It is covered by U.S. Patent 4,995,082, which expired in February 2008.".
- Q1465057 wikiPageExternalLink draft-hao-schnorr-01.
- Q1465057 wikiPageExternalLink schnorr.smartcardsig.1991.ps.
- Q1465057 wikiPageWikiLink Q1169249.
- Q1465057 wikiPageWikiLink Q1224829.
- Q1465057 wikiPageWikiLink Q1328731.
- Q1465057 wikiPageWikiLink Q16966748.
- Q1465057 wikiPageWikiLink Q1779448.
- Q1465057 wikiPageWikiLink Q220849.
- Q1465057 wikiPageWikiLink Q228184.
- Q1465057 wikiPageWikiLink Q319400.
- Q1465057 wikiPageWikiLink Q477202.
- Q1465057 wikiPageWikiLink Q5446341.
- Q1465057 wikiPageWikiLink Q5469821.
- Q1465057 wikiPageWikiLink Q5532673.
- Q1465057 wikiPageWikiLink Q7431918.
- Q1465057 wikiPageWikiLink Q83478.
- Q1465057 wikiPageWikiLink Q8376561.
- Q1465057 wikiPageWikiLink Q864003.
- Q1465057 wikiPageWikiLink Q868169.
- Q1465057 wikiPageWikiLink Q8789.
- Q1465057 wikiPageWikiLink Q924044.
- Q1465057 comment "In cryptography, a Schnorr signature is a digital signature produced by the Schnorr signature algorithm. Its security is based on the intractability of certain discrete logarithm problems. The Schnorr signature is considered the simplest digital signature scheme to be provably secure in a random oracle model. It is efficient and generates short signatures. It is covered by U.S. Patent 4,995,082, which expired in February 2008.".
- Q1465057 label "Schnorr signature".