Cipolla's algorithm
id:
cipolla-s-algorithm-275-5571448
title:
Cipolla's algorithm
text:
In computational number theory, Cipolla's algorithm is a technique for solving a congruence of the form where x , n ∈ F p , so n is the square of x, and where p is an odd prime. Here F p denotes the finite field with p elements; { 0 , 1 , … , p − 1 } . The algorithm is named after Michele Cipolla, an Italian mathematician who discovered it in 1907. Apart from prime moduli, Cipolla's algorithm is also able to take square roots modulo prime powers.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Cipolla%27s_algorithm
date created:
date modified:
2024-01-18T21:03:22Z
main entity:
{"identifier":"Q5121280","url":"https://www.wikidata.org/entity/Q5121280"}
image:
fields total:
13
integrity:
13