Determining the Optimal Random-padding Size for Rabin Cryptosystems

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...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2018-07
Main Authors: Kaminaga, Masahiro, Suzuki, Toshinori, Fukase, Masaharu
Format: Article
Language:English
Subjects:
Computer systems
Cryptography
Encryption
Random numbers
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422