Show simple item record

dc.contributor.authorJiménez Urroz, Jorge
dc.contributor.authorDieulefait, Luis Victor
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.date.accessioned2014-03-17T13:51:54Z
dc.date.available2014-03-17T13:51:54Z
dc.date.created2012
dc.date.issued2012
dc.identifier.citationJimenez, J.; Dieulefait, L.V. Small primitive roots and malleability of RSA. A: International Conference on Symbolic Computation and Cryptography. "Extended abstracts of the third Workshop on Mathematical Cryptology (WMC 2012) and the third international conference on Symbolic Computation and Cryptography (SCC 2012), Castro Urdiales, Spain, 9-13 July 2012". Castro Urdiales: 2012, p. 13-18.
dc.identifier.urihttp://hdl.handle.net/2117/22162
dc.description.abstractIn their paper [9], P. Paillier and J. Villar make a conjectur e about the malleability of an RSA modulus. In this paper we present an ex plicit algo- rithm refuting the conjecture. Concretely we can factorize an RSA modulus n using very little information on the factorization of a conc rete n ′ coprime to n . However, we believe the conjecture might be true, when impo sing some extra conditions on the auxiliary n ′ allowed to be used. In particular, the paper shows how subtle the notion of malleability is
dc.format.extent6 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica aplicada a les ciències
dc.subject.lcshInformation theory
dc.subject.lcshCoding theory
dc.titleSmall primitive roots and malleability of RSA
dc.typeConference report
dc.subject.lemacCircuits
dc.contributor.groupUniversitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia
dc.description.peerreviewedPeer Reviewed
dc.subject.ams94C Circuits, networks
dc.relation.publisherversionhttp://wmc2012.unican.es/SCC_WMC_2012.pdf
dc.rights.accessOpen Access
drac.iddocument11608996
dc.description.versionPostprint (published version)
upcommons.citation.authorJimenez, J.; Dieulefait, L.V.
upcommons.citation.contributorInternational Conference on Symbolic Computation and Cryptography
upcommons.citation.pubplaceCastro Urdiales
upcommons.citation.publishedtrue
upcommons.citation.publicationNameExtended abstracts of the third Workshop on Mathematical Cryptology (WMC 2012) and the third international conference on Symbolic Computation and Cryptography (SCC 2012), Castro Urdiales, Spain, 9-13 July 2012
upcommons.citation.startingPage13
upcommons.citation.endingPage18


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain