Multi-asymmetric cryptographic RSA scheme

Ahmad Mansour; Andrew Davis; Mathew Wagner; Richard Bassous; Huirong Fu; Ye Zhu

doi:10.1145/3064814.3064820

Multi-asymmetric cryptographic RSA scheme

Ahmad Mansour
, Andrew Davis
, Mathew Wagner
, Richard Bassous
, Huirong Fu
, Ye Zhu

Oakland University
The University of Michigan-Flint
Missouri University of Science and Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Abstract

In this paper, we propose a version of RSA encryption that uses the Chinese Remainder Teorem (CRT) for the purpose of concealing multiple plain-texts in one cipher-text. Tis scheme allows the sender to possibly send diferent information to multiple receivers, and each receiver is only able to decrypt the message intended for him. We prove the algorithm mathematically. Furthermore, we prove our algorithm secure against the chosen plain-text (CPA) atack. We also compare textbook RSA against our algorithm and show the security and size advantages. The new algorithm can also take advantage of current methods that speed up the decryption process of RSA. This scheme will become a basis for further one to many public key cryptosystems.

Original language	English
Title of host publication	ACM International Conference Proceeding Series
Place of Publication	usa
Publisher	Association for Computing [email protected]
ISBN (Electronic)	9781450348553
DOIs	https://doi.org/10.1145/3064814.3064820
State	Published - Apr 4 2017
Event	12th Annual Cyber and Information Security Research Conference, CISRC 2017 - Oak Ridge, United States Duration: Apr 4 2017 → Apr 6 2017

Conference

Conference	12th Annual Cyber and Information Security Research Conference, CISRC 2017
Country/Territory	United States
City	Oak Ridge
Period	04/4/17 → 04/6/17

Keywords

Asymmetric cryptography
Chinese remainder teorem
Chosen plain-text atack
Multi-encryption
Multicast
RSA

Access to Document

10.1145/3064814.3064820

Cite this

@inproceedings{3d521efa8f5441cf92f4617d03e66d3c,

title = "Multi-asymmetric cryptographic RSA scheme",

abstract = "In this paper, we propose a version of RSA encryption that uses the Chinese Remainder Teorem (CRT) for the purpose of concealing multiple plain-texts in one cipher-text. Tis scheme allows the sender to possibly send diferent information to multiple receivers, and each receiver is only able to decrypt the message intended for him. We prove the algorithm mathematically. Furthermore, we prove our algorithm secure against the chosen plain-text (CPA) atack. We also compare textbook RSA against our algorithm and show the security and size advantages. The new algorithm can also take advantage of current methods that speed up the decryption process of RSA. This scheme will become a basis for further one to many public key cryptosystems.",

keywords = "Asymmetric cryptography, Chinese remainder teorem, Chosen plain-text atack, Multi-encryption, Multicast, RSA",

author = "Ahmad Mansour and Andrew Davis and Mathew Wagner and Richard Bassous and Huirong Fu and Ye Zhu",

year = "2017",

month = apr,

day = "4",

doi = "10.1145/3064814.3064820",

language = "English",

booktitle = "ACM International Conference Proceeding Series",

publisher = "Association for Computing [email protected]",

note = "12th Annual Cyber and Information Security Research Conference, CISRC 2017 ; Conference date: 04-04-2017 Through 06-04-2017",

}

TY - GEN

T1 - Multi-asymmetric cryptographic RSA scheme

AU - Mansour, Ahmad

AU - Davis, Andrew

AU - Wagner, Mathew

AU - Bassous, Richard

AU - Fu, Huirong

AU - Zhu, Ye

PY - 2017/4/4

Y1 - 2017/4/4

N2 - In this paper, we propose a version of RSA encryption that uses the Chinese Remainder Teorem (CRT) for the purpose of concealing multiple plain-texts in one cipher-text. Tis scheme allows the sender to possibly send diferent information to multiple receivers, and each receiver is only able to decrypt the message intended for him. We prove the algorithm mathematically. Furthermore, we prove our algorithm secure against the chosen plain-text (CPA) atack. We also compare textbook RSA against our algorithm and show the security and size advantages. The new algorithm can also take advantage of current methods that speed up the decryption process of RSA. This scheme will become a basis for further one to many public key cryptosystems.

AB - In this paper, we propose a version of RSA encryption that uses the Chinese Remainder Teorem (CRT) for the purpose of concealing multiple plain-texts in one cipher-text. Tis scheme allows the sender to possibly send diferent information to multiple receivers, and each receiver is only able to decrypt the message intended for him. We prove the algorithm mathematically. Furthermore, we prove our algorithm secure against the chosen plain-text (CPA) atack. We also compare textbook RSA against our algorithm and show the security and size advantages. The new algorithm can also take advantage of current methods that speed up the decryption process of RSA. This scheme will become a basis for further one to many public key cryptosystems.

KW - Asymmetric cryptography

KW - Chinese remainder teorem

KW - Chosen plain-text atack

KW - Multi-encryption

KW - Multicast

KW - RSA

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85018245422&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=85018245422&origin=inward

U2 - 10.1145/3064814.3064820

DO - 10.1145/3064814.3064820

M3 - Conference contribution

BT - ACM International Conference Proceeding Series

PB - Association for Computing [email protected]

CY - usa

T2 - 12th Annual Cyber and Information Security Research Conference, CISRC 2017

Y2 - 4 April 2017 through 6 April 2017

ER -

Multi-asymmetric cryptographic RSA scheme

Abstract

Conference

Keywords

Access to Document

Other files and links

Cite this