Cryptanalysis of an RSA variant with moduli N=prql
In this paper we study an RSA variant with moduli of the form N=prql{N=p^{r}q^{l}} (r>l≥2{r>l\geq 2}). This variant was mentioned by Boneh, Durfee and Howgrave-Graham [2]. Later Lim, Kim, Yie and Lee [11] showed that this variant is much faster than the standard RSA moduli in the step of decryption...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
De Gruyter
2017-06-01
|
| Edice: | Journal of Mathematical Cryptology |
| Témata: | |
| On-line přístup: | https://doi.org/10.1515/jmc-2016-0025 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|