The Miller–Rabin test with randomized exponents

DOI10.1515/JMC.2009.019zbMATH Open1185.11080MaRDI QIDQ3558749FDOQ3558749

Authors: Gebhard Böckle 

Publication date: 6 May 2010

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Recommendations

• A simplified substantiation of the probabilistic Miller-Rabin primality test
• The error probability of the Miller-Rabin primality test
• Verification of the Miller-Rabin probabilistic primality test.
• On practical aspects of the Miller-Rabin primality test
• Tests of randomness by the gambler's ruin algorithm
• Radix- b extensions to some common empirical tests for pseudorandom number generators
• Asymptotically most powerful tests for random number generators
• Miller's primality test
• On Marsaglia's lattice test for pseudorandom numbers

zbMATH Keywords

Miller-Rabin testside channel attackssecure prime generation

Mathematics Subject Classification ID

Cryptography (94A60) Primality (11Y11)

Cites Work

• Probabilistic algorithm for testing primality
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• Average Case Error Estimates for the Strong Probable Prime Test
• Further investigations with the strong probable prime test

Cited In (2)

• Infinitely many Carmichael numbers for a modified Miller-Rabin prime test
• Public Key Cryptography - PKC 2005

This page was built for publication: The Miller–Rabin test with randomized exponents

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