7 Results Found

Prime Power RSA is a variant of the RSA scheme due to Takagi with modulus $N=p^{r}q$ for $r⩾2$, where $p,q$ are of the same bit-size. In this paper, we concentrate on one type of Prime Power RSA which assumes $e·d\equiv 1\mathrm{mod}{p}^{r-1}(p-1)($...

RSA key pairs are normally generated from two large primes p and q. We consider what happens if they are generated from two integers s and r, where r is prime, but unbeknownst to the user, s is not. Under most circumstances, the correctness of encryp...

In this paper, we propose a new scheme based on ephemeral elliptic curves over a finite ring with an RSA modulus. The new scheme is a variant of both the RSA and the KMOV cryptosystems and can be used for both signature and encryption. We study the s...

A distributed binary hypothesis testing (HT) problem involving two parties, a remote observer and a detector, is studied. The remote observer has access to a discrete memoryless source, and communicates its observations to the detector via a rate-lim...

In certain variants of the RSA cryptosystem with a modulus $N=pq$, the public exponent e and the private exponent d are related by the equation $ed\equiv 1\left(\mathrm{mod}{\phi }_n\left(N\right)\right)$ or $ed\equiv 1\left(\mathrm{mod}{\psi }_n\left(N\right)\right)$, where ${\phi }_n\left(N\right)=(p^n-1)(q^n-1)$ and ${\psi }_n\left(N\right)$...

This paper describes an attack on the Rivest, Shamir and Adleman (RSA) cryptosystem utilizing the modulus $N=p^{2}q$ where p and q are two large balanced primes. Let $e_1,e_2<N^{\gamma }$ be the integers such that $d_1,d_2<N^{\delta }$ be their multiplicative inverses. Based...

Tax-benefit policy acts most directly on whether adults work. We show that the response-threshold rule by which social insects divide labour and the extensive-margin participation curve share one functional form when the private cost of working is ad...