Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
type: Item
instance of: scholarly article
title: Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
zbMATH Open document ID: 1115.68074
author: Alexander May
author: Jean-Sébastien Coron
published in: Journal of Cryptology
publication date: 2007-05-24T00:00:00Z
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 5156897
zbMATH Keywords: Coppersmith's technique
describes a project that uses: NTL
MaRDI profile type: Publication
full work available at URL: s00145-006-0433-6
OpenAlex ID: W2101059923
DOI: 10.1007/S00145-006-0433-6
description: scientific article; zbMATH DE number 5156897