Thirty years after RSA was first publicized, it remains an active research area. Although
several good surveys exist, they are either slightly outdated or only focus on one type of …

Several algorithms have been proposed for factoring RSA modulus N when attackers know
the most or the least significant (β-δ)\log N bits of secret exponents d< N^ β. The attacks are …

The RSA cryptosystem, named after its inventors, Rivest, Shamir and Adleman, is the most
widely known and widely used public-key cryptosystem in the world today. Compared to …

Thus far, partial key exposure attacks on RSA have been intensively studied using lattice
based Coppersmith's methods. In the context, attackers are given partial information of a …

The security on many public key encryption schemes relied on the intractability of finding the
integer factoring problem such as RSA scheme. However, there are great deals of …

Partial key exposure attacks on RSA have been intensively studied by using lattice-based
Coppersmith's methods. Ernst et al.(Eurocrypt'05) studied the problem by considering three …

Primary Examiner-David Garcia Cervetti (74) Attorney, Agent, or Firm—Capitol Patent &
Trademark Law Firm, PLLC (57) ABSTRACT Temporal key generation devices and methods …

Signcryption is an authenticated encryption technique that concurrently establishes
message confidentiality, authenticity, integrity and non-repudiation. In this paper, we …

We show that the attack of de Weger on RSA using continued fractions extends to Multi-
Prime RSA. Let (n, e) be a Multi-Prime RSA public-key with private key d, where n= p 1 p 2⋯ …

Brakerski showed that linearly decryptable fully homomorphic encryption (FHE) schemes
cannot be secure in the chosen plaintext attack (CPA) model. In this paper, we show that …