RSA: a number of formulas to improve the search for \(p+q\)
type: Item
instance of: scholarly article
title: RSA: a number of formulas to improve the search for \(p+q\)
zbMATH Open document ID: 1376.94041
author: Ahmed Mohammed
author: Abdulrahman Alkhelaifi
published in: Journal of Mathematical Cryptology
publication date: 2017-12-04T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11Y05
zbMATH DE Number: 6815256
zbMATH Keywords: RSA
zbMATH Keywords: cryptosystem
zbMATH Keywords: public key
MaRDI profile type: Publication
full work available at URL: jmc-2016-0046
OpenAlex ID: W2766106624
cites work: Breaking RSA Generically Is Equivalent to Factoring
cites work: Q4273683
cites work: Q4229172
cites work: Breaking RSA may not be equivalent to factoring
cites work: Breaking RSA may be as difficult as factoring
cites work: Cryptanalysis of RSA with small prime difference
cites work: Factoring integers with elliptic curves
cites work: Discrete logarithms: The past and the future
cites work: A method for obtaining digital signatures and public-key cryptosystems
DOI: 10.1515/JMC-2016-0046
description: scientific article; zbMATH DE number 6815256