Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Schnorr_group> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Schnorr_group abstract "A Schnorr group, proposed by Claus P. Schnorr, is a large prime-order subgroup of , the multiplicative group of integers modulo for some prime . To generate such a group, generate , , such thatwith , prime. Then choose any in the range until you find one such that.This valueis a generator of a subgroup of of order .Schnorr groups are useful in discrete log based cryptosystems including Schnorr signatures and DSA. In such applications, typically is chosen to be large enough to resist index-calculus and related methods of solving the discrete-log problem (perhaps 1024 to 3072 bits), while is large enough to resist the birthday attack on discrete log problems, which works in any group (perhaps 160 to 256 bits). Because the Schnorr group is of prime order, it has no non-trivial proper subgroups, thwarting confinement attacks due to small subgroups. Implementations of protocols that use Schnorr groups must verify where appropriate that integers supplied by other parties are in fact members of the Schnorr group; is a member of the group if and . Any member of the group except the element is also a generator of the group.".
- Schnorr_group wikiPageID "1190979".
- Schnorr_group wikiPageRevisionID "525515200".
- Schnorr_group hasPhotoCollection Schnorr_group.
- Schnorr_group subject Category:Asymmetric-key_algorithms.
- Schnorr_group subject Category:Group_theory.
- Schnorr_group subject Category:Number_theory.
- Schnorr_group type Abstraction100002137.
- Schnorr_group type Act100030358.
- Schnorr_group type Activity100407535.
- Schnorr_group type Algorithm105847438.
- Schnorr_group type Asymmetric-keyAlgorithms.
- Schnorr_group type Event100029378.
- Schnorr_group type Procedure101023820.
- Schnorr_group type PsychologicalFeature100023100.
- Schnorr_group type Rule105846932.
- Schnorr_group type YagoPermanentlyLocatedEntity.
- Schnorr_group comment "A Schnorr group, proposed by Claus P. Schnorr, is a large prime-order subgroup of , the multiplicative group of integers modulo for some prime . To generate such a group, generate , , such thatwith , prime. Then choose any in the range until you find one such that.This valueis a generator of a subgroup of of order .Schnorr groups are useful in discrete log based cryptosystems including Schnorr signatures and DSA.".
- Schnorr_group label "Schnorr group".
- Schnorr_group sameAs m.04fzn2.
- Schnorr_group sameAs Q7431918.
- Schnorr_group sameAs Q7431918.
- Schnorr_group sameAs Schnorr_group.
- Schnorr_group wasDerivedFrom Schnorr_group?oldid=525515200.
- Schnorr_group isPrimaryTopicOf Schnorr_group.