DeepAI AI Chat
Log In Sign Up

Determining the Optimal Random-padding Size for Rabin Cryptosystems

by   Masahiro Kaminaga, et al.

Rabin encryption and a secure ownership transfer protocol based on the difficulty of factorization of a public key use a small public exponent. Such encryption requires random number padding. The Coppersmith's shortpad attack works effectively on short padding, thereby allowing an adversary to extract the secret message. However, the criteria for determining the appropriate padding size remains unclear. In this paper, we derived the processing-time formula for the shortpad attack and determined the optimal random-padding size in order to achieve the desired security.


page 1

page 2

page 3

page 4


An analysis of Coggia-Couvreur attack on Loidreau's rank-metric public key encryption scheme in the general case

In this paper we show that in the case where the public-key can be disti...

Cryptographic analysis of the Modified Matrix Modular Cryptosystem

We show that the Modified Matrix Modular Cryptosystem proposed by S.K. R...

Information-theoretic Key Encapsulation and its Application to Secure Communication

A hybrid encryption scheme is a public key encryption system that consis...

RSA+: An algorithm at least as secure as RSA

The RSA algorithm has been around for nearly five decades and remains on...

How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts

We study secure and undetectable communication in a world where governme...

Advanced attribute-based protocol based on the modified secret sharing scheme

We construct a new protocol for attribute-based encryption with the use ...

SALSA PICANTE: a machine learning attack on LWE with binary secrets

The Learning With Errors (LWE) problem is one of the major hard problems...