Decrypting the Ciphertexts of Rsa with Public-key
نویسنده
چکیده
The RSA is based on a trapdoor one-way function which is easy to compute but is most hard to revert without knowing the trapdoor. A cryptanalysis, presented in this paper, consists in finding a new decrypt key which plays the same role of the original trapdoor. To find this new decrypt key we must seek the maximum degree of ciphering function composition in a given modulus N. The maximum degree (d_max) is obtained by applying the ciphering function to a restricted set of residues in the modulus N. We then define the new decrypt key by (e). Thanks to this new key, we can decrypt any ciphertext for a given modulus. The interest of this cryptanalysis, contrary to factorization, is that the search of the decrypt key is independent from the modulus size.
منابع مشابه
A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes
A new attack on the RSA cryptosystem is presented. This attack assumes less than previous chosen ciphertext attacks, since the cryptanalyst has to obtain the plaintext versions of some carefully chosen ciphertexts only once, and can then proceed to decrypt further ciphertexts without further recourse to the authorized user’s decrypting facility. This attack is considerably more efficient than t...
متن کاملUniversally Anonymizable Public-Key Encryption
We first propose the notion of universally anonymizable publickey encryption. Suppose that we have the encrypted data made with the same security parameter, and that these data do not satisfy the anonymity property. Consider the situation that we would like to transform these encrypted data to those with the anonymity property without decrypting these encrypted data. In this paper, in order to ...
متن کاملLow-Exponent RSA with Related Messages
In this paper we present a new class of attacks against RSA with low encrypting exponent. The attacks enable the recovery of plaintext messages from their ciphertexts and a known polynomial relationship among the messages, provided that the ciphertexts were created using the same RSA public key with low encrypting exponent.
متن کاملStudy on Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts
Traditional broadcast encryption (BE) schemes al-low a sender to securely broadcast to any subset of members but require a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the ciphertexts encrypted under the shared encryption key, but a send...
متن کاملEfficient Encryption Schema Using Short Cipher Texts for Broadcasting
Traditional broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but require a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the ciphertexts encrypted under the shared encryption key, but a sende...
متن کامل