{'fraction_non_alphanumeric': 0.0282574568288854, 'fraction_numerical': 0.012558869701726845, 'mean_word_length': 4.361344537815126, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On the conventional public key in identification-based encryption: the case of RSA

This paper relies on the traditional method RSA-OAEP with an identification-based encryption. Firstly, we make a little change in the basic idea Boneh et al., 2002; Ding and Tsudik, 2003 in order to create a scheme with which we can sign and crypt at same time. A simple comparison prove that our signature is equivalent to the signature of Shamir. Then, we propose a new approach, which conserve properly the RSA classic. In this paper we will also respond to the question of Xuhua Ding and Gene Tsudik, to propose a convenient exponent for an RSA-IBE.