scientific article; zbMATH DE number 5845877

MaRDI QIDQ3072835zbMATH OpenFDO

Authors Yanqi Wang, Kunqi Liu, Yichao He

Publication date 5 February 2011

zbMATH Keywords

primality testprobabilistic algorithmrecursion techniquesLehmann algorithm

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Cryptography (94A60)

Recommendations

• A Fast Monte-Carlo Test for Primality
• A new probabilistic primality test
• scientific article; zbMATH DE number 579167
• A note on monte carlo primality tests and algorithmic information theory
• A faster pseudo-primality test
• Deterministic and probabilistic primality tests
• An $O(n^{1/10.89))$ Primality Testing Algorithm,$
• scientific article; zbMATH DE number 4215363
• scientific article; zbMATH DE number 4039974

Cited in

(6)

• A low complexity probabilistic test for integer multiplication
• Fast Primality Tests for Numbers Less Than 50 ⋅10 9
• A Performance Analysis of a Simple Prime-Testing Algorithm
• scientific article; zbMATH DE number 579167 (Why is no real title available?)
• A Fast Monte-Carlo Test for Primality
• A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3072835)