A low complexity probabilistic test for integer multiplication
type: Item
instance of: scholarly article
title: A low complexity probabilistic test for integer multiplication
zbMATH Open document ID: 1196.68104
author: Gérald Tenenbaum
author: Dima Grigoriev
published in: Journal of Complexity
publication date: 2010-08-03T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 5763692
zbMATH Keywords: probabilistic test
zbMATH Keywords: integer multiplication
zbMATH Keywords: small divisors
MaRDI profile type: Publication
full work available at URL: j.jco.2009.12.002
OpenAlex ID: W2048881613
cites work: Q4091421
cites work: Designing programs that check their work
cites work: Q4195937
cites work: Q3549597
cites work: LOCAL DENSITIES OVER INTEGERS FREE OF LARGE PRIME FACTORS
cites work: Fast multiplication of large numbers
DOI: 10.1016/J.JCO.2009.12.002
Recommended article: Q4293690
Recommended article: A new probabilistic primality test
Recommended article: A simplified substantiation of the probabilistic Miller-Rabin primality test
Recommended article: Q3072835
Recommended article: Verification of the Miller-Rabin probabilistic primality test.
Recommended article: A Fast Monte-Carlo Test for Primality
Recommended article: Q3786518
Recommended article: Information Security Practice and Experience
Recommended article: Non-interactive Proofs for Integer Multiplication
Recommended article: Primality testing with fewer random bits
description: scientific article; zbMATH DE number 5763692