Testing numbers of the form N = 2kpm − 1 for primality

DOI10.1515/156939206777344610zbMath1126.11071OpenAlexW1985214674MaRDI QIDQ5424045

E. V. Sadovnik

Publication date: 2 November 2007

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/156939206777344610

zbMATH Keywords

complexityLucas sequencesdeterministic primality testsnumbers of the form \(N=2kp^m-1\)

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Factorization; primality (11A51) Primality (11Y11)

Related Items (1)

A primality test for \(4Kp^n-1\) numbers

Cites Work

• PRIMES is in P
• Unnamed Item
• Unnamed Item

This page was built for publication: Testing numbers of the form N = 2kpm − 1 for primality