2010•Unpublished venueRequires access

As opposed to prime factorization, primality testing is determining whether a given number is a prime, without necessarily computing its factorization. This lecture will study in details Solovay-Strassen algorithm for primality testing, discuss random primes generation and present one of its applications to cryptography.

Baljak Valentina

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: Primality test, Strassen algorithm, Prime (order theory), Factorization, Computer science, Mathematics, Prime number, Algorithm

Back to paper search Browse research topics Original source

As opposed to prime factorization, primality testing is determining whether a given number is a prime, without necessarily computing its factorization. This lecture will study in details Solovay-Strassen algorithm for primality testing, discuss random primes generation and present one of its applications to cryptography. — Research Paper | ScholarLens