Name
Abstract | ||
|---|---|---|
Let N be an arbitrary integer with unknown factorization. In Asiacrypt 2012, Kakvi et al. proposed an algorithm that, given prime (e ge N^{frac{1}{4}}+epsilon ), certifies whether the RSA function (text {RSA}_{N,e}(x):=x^e bmod N) defines a permutation over (mathbb {Z}^{*}_N) or not. In this paper, we extend Kakvi et al.’s work by considering the case with generalized moduli (N=prod _{i=1}^{n}p_i^{z_i}). Surprisingly, when (text {min}{z_1,ldots ,z_n}ge 2), we show that it can be efficiently decided whether the RSA function defines a permutation over (mathbb {Z}^{*}_N) or not even for the prime (eu003c N^{frac{1}{4}}). Our result can be viewed as an extension of Kakvi et al.’s result. |
Year | Venue | Field |
|---|---|---|
2018 | ICICS | Integer,Prime (order theory),Combinatorics,Lattice (order),Computer science,Permutation,Public key cryptosystem,Factorization,Moduli,Distributed computing |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
8 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yao Lu | 1 | 28 | 6.78 |
| Noboru Kunihiro | 2 | 425 | 45.72 |
| Rui Zhang | 3 | 17 | 3.21 |
| Liqiang Peng | 4 | 38 | 8.37 |
| Hui Ma | 5 | 20 | 4.05 |