Algebraic-group factorisation algorithm
Algebraic-group factorisation algorithms are algorithms for factoring an integer N by working in an algebraic group defined modulo N whose group structure is the direct sum of the 'reduced groups' obtained by performing the equations defining the group arithmetic modulo the unknown prime factors p1, p2, ... By the Chinese remainder theorem, arithmetic modulo N corresponds to arithmetic in all the reduced groups simultaneously.
primaryTopic
Algebraic-group factorisation algorithm
Algebraic-group factorisation algorithms are algorithms for factoring an integer N by working in an algebraic group defined modulo N whose group structure is the direct sum of the 'reduced groups' obtained by performing the equations defining the group arithmetic modulo the unknown prime factors p1, p2, ... By the Chinese remainder theorem, arithmetic modulo N corresponds to arithmetic in all the reduced groups simultaneously.
has abstract
Algebraic-group factorisation ...... made for a one-sided identity.
@en
Link from a Wikipage to an external page
Wikipage page ID
14,573,391
page length (characters) of wiki page
Wikipage revision ID
994,038,110
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
Algebraic-group factorisation ...... reduced groups simultaneously.
@en
label
Algebraic-group factorisation algorithm
@en