Presentation 2007-11-22
Comparative study of uniquely decipherable Rabin encryption and RSA encryption
Kensuke TAKAMURA, Akira HAYASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The Rabin cryptosystem is a public key system that is proven to be as intractable as integer factoring. One of its features is the greater speed compared with RSA encryption owing to its simpler encryption function. However, the original system proposed by M. O. Rabin has a drawback that it does not possess uniquely decipherability property. There have been several proposed variants with unique decipherability property. We implemented one such variant of the Rabin system on a computer, and investigated processing speed of encryption and decryption to compare with RSA. We show that it is much faster than RSA in encryption, and is as fast as RSA with Quisquater-Couvereur decryption algorithm.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Rabin cryptosystem / public key cryptosystem / RSA cryptosystem
Paper # ISEC2007-101,OIS2007-73
Date of Issue

Conference Information
Committee ISEC
Conference Date 2007/11/15(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Comparative study of uniquely decipherable Rabin encryption and RSA encryption
Sub Title (in English)
Keyword(1) Rabin cryptosystem
Keyword(2) public key cryptosystem
Keyword(3) RSA cryptosystem
1st Author's Name Kensuke TAKAMURA
1st Author's Affiliation Kanazawa Institute of Technology()
2nd Author's Name Akira HAYASHI
2nd Author's Affiliation Kanazawa Institute of Technology
Date 2007-11-22
Paper # ISEC2007-101,OIS2007-73
Volume (vol) vol.107
Number (no) 346
Page pp.pp.-
#Pages 3
Date of Issue