Primality testing and integer factorization in public-key cryptography

MaRDI QIDQ1418120zbMATH OpenFDO

Authors Song Yuan Yan

Publication date 8 January 2004

Published in Advances in Information Security (Search for Journal in Brave)

zbMATH Keywords

public-key cryptographyfactoringprimality tests

Mathematics Subject Classification ID

Cryptography (94A60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Factorization (11Y05) Primality (11Y11)

Recommendations

• scientific article; zbMATH DE number 4057589
• Public Key Cryptography
• Number-theoretic algorithms in cryptography. Transl. from the Russian by A. Martsinkovsky
• Numbers and cryptography
• scientific article; zbMATH DE number 44444

Cited in

(8)

• Topics in computational number theory inspired by Peter L. Montgomery
• Quantum computational number theory
• Prime simplicity
• Integer algorithms in cryptology and information assurance
• Primality tests, linear recurrent sequences and the Pell equation
• scientific article; zbMATH DE number 1845044 (Why is no real title available?)
• A new quantum algorithm for computing RSA ciphertext period
• Integer factorization and twin primes verification algorithms

Describes a project that uses

Uses Software

• NTRU

This page was built for publication: Primality testing and integer factorization in public-key cryptography

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