On RSA moduli with half of the bits prescribed
type: Item
instance of: scholarly article
title: On RSA moduli with half of the bits prescribed
zbMATH Open document ID: 1277.11116
published in: Journal of Number Theory
publication date: 2012-11-23T00:00:00Z
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11Y11
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6110182
zbMATH Keywords: RSA
zbMATH Keywords: bit pattern
zbMATH Keywords: sparse integer
author: Xian Meng Meng
MaRDI profile type: Publication
full work available at URL: j.jnt.2012.07.008
OpenAlex ID: W2028904165
cites work: On RSA moduli with almost half of the bits prescribed
cites work: Q4830109
cites work: Q4249250
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: On RSA moduli with prescribed bit patterns
cites work: Short RSA keys and their generation
DOI: 10.1016/J.JNT.2012.07.008
Recommended article: On RSA moduli with almost half of the bits prescribed
Recommended article: On RSA moduli with prescribed bit patterns
Recommended article: RSA Moduli with a Predetermined Portion: Techniques and Applications
Recommended article: Factoring RSA moduli with primes sharing bits in the middle
Recommended article: Q3374895
Recommended article: Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
Recommended article: Q4249250
Recommended article: Advances in Cryptology - ASIACRYPT 2003
Recommended article: Factorization of a 768-Bit RSA Modulus
Recommended article: Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
description: scientific article; zbMATH DE number 6110182