Algebraic-group factorisation algorithm
id:
algebraic-group-factorisation-algorithm-194-8741102
title:
Algebraic-group factorisation algorithm
text:
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. The aim is to find an element which is not the identity of the group
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Algebraic-group_factorisation_algorithm
date created:
date modified:
2024-02-04T20:21:05Z
main entity:
{"identifier":"Q4723979","url":"https://www.wikidata.org/entity/Q4723979"}
image:
fields total:
13
integrity:
13