Small primitive roots and malleability of RSA

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/22162

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.contributor	Universitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia
dc.contributor.author	Jiménez Urroz, Jorge
dc.contributor.author	Dieulefait, Luis Victor
dc.date	2012
dc.identifier.citation	Jimenez, 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.uri	http://hdl.handle.net/2117/22162
dc.language.iso	eng
dc.relation	http://wmc2012.unican.es/SCC_WMC_2012.pdf
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://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	Information theory
dc.subject	Coding theory
dc.subject	Circuits
dc.subject	94C Circuits, networks
dc.title	Small primitive roots and malleability of RSA
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.abstract	In 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.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author