Babcock University Research Portal

A Modular-Arithmetic-Based Encryption Scheme

Authors: OKOLIE Samuel

Publication Type: Journal article

Journal:

ISSN Number:

Downloads

Views

Abstract

This paper considers a scenario in which a sender who holds a k-bit to k-bit trapdoor permutation f wants to transmit a message x to a receiver who holds the inverse permutation f-1; with the condition that encryption should require just one computation of f, decryption should require just one computation of f-1, the length of the enciphered text should be precisely k and the length n of the text x that can be encrypted is close to k. Our scheme takes the encryption of x to be f(rx), which is a simple probabilistic encoding of x. Assuming an ideal hash function and an arbitrary trapdoor permutation, we describe and prove secure a simple invertible enmesh scheme that is bit-optimal in that the length of the string x that can be encrypted by f(rx is almost k. Our scheme achieves semantic security, which implies adaptive chosenciphertext security and non-malleability

Access to Documents

External Link
Download
Digital Object Identifier

Keywords

OKOLIE,S. . (0000). A Modular-Arithmetic-Based Encryption Scheme, 0 (), 0-0.

OKOLIE,S. . "A Modular-Arithmetic-Based Encryption Scheme" 0, no (), (0000): 0-0.

OKOLIE,S. and . (0000). A Modular-Arithmetic-Based Encryption Scheme, 0 (), pp0-0.

OKOLIES, . A Modular-Arithmetic-Based Encryption Scheme. 0000, 0 ():0-0.

OKOLIE,Samuel , . "A Modular-Arithmetic-Based Encryption Scheme", 0 . (0000) : 0-0.

O.Samuel , "A Modular-Arithmetic-Based Encryption Scheme" vol.0, no., pp. 0-0, 0000.

Access to Documents

Keywords

About Us

Admissions

Contact Us

Policies

ALUMNI

STUDENT POPULATION