1986•Theory and Application of Cryptographic TechniquesRequires access

A Simple an Fast Probabilistic Algorithm for Computing Square Roots Modulo a Prime Number.

René Peralta, Jeroen van de Graaf

Open publisher page 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Modulo, Probabilistic logic, Simple (philosophy), Algorithm, Probabilistic analysis of algorithms, Prime (order theory), Primitive root modulo n, Computer science

Back to paper search Browse research topics Original source

A Simple an Fast Probabilistic Algorithm for Computing Square Roots Modulo a Prime Number. — Research Paper | ScholarLens