MRSA — a new public key encryption method

1993 ◽  
pp. 341-348
Author(s):  
Reinhard Posch
Author(s):  
Mechal Fheed Alslman, Nassr Aldin Ide, Ahmad Zakzak Mechal Fheed Alslman, Nassr Aldin Ide, Ahmad Zakzak

In this paper, we introduce a method for building matrices that verify the commutative property of multiplication on the basis of circular matrices, as each of these matrices can be divided into four circular matrices, and we can also build matrices that verify the commutative property of multiplication from higher order and are not necessarily divided into circular matrices. Using these matrixes, we provide a way to securely exchange a secret encryption key, which is a square matrix, over open communication channels, and then use this key to exchange encrypted messages between two sides or two parties. Moreover, using these matrixes we also offer a public-key encryption method, whereby the two parties exchange encrypted messages without previously agreeing on a common secret key between them.


2016 ◽  
Vol 15 (14) ◽  
pp. 7423-7434
Author(s):  
FAIROUZ SHER ALI ◽  
SONG FENG LU

Searchable encryption allows a remote server to search over encrypted documents without knowing the sensitive data contents. Prior searchable symmetric encryption schemes focus on single keyword search. Conjunctive Keyword Searches (CKS) schemes improve system usability by retrieving the matched documents. In this type of search, the user has to repeatedly perform the search protocol for many times. Most of existent (CKS) schemes use conjunctive keyword searches with fixed position keyword fields, this type of search is not useful for many applications, such as unstructured text. In our paper, we propose a new public key encryption scheme based on bilinear pairings, the scheme supports conjunctive keyword search queries on encrypted data without needing to specify the positions of the keywords where the keywords can be in any arbitrary order. Instead of giving the server one trapdoor for each keyword in the conjunction set, we use a bilinear map per a set of combined keywords to make them regarded as one keyword. In another meaning, the proposed method will retrieve the data in one round of communication between the user and server. Furthermore, the search process could not reveal any information about the number of keywords in the query expression. Through analysis section we determine how such scheme could be used to guarantee fast and secure access to the database.


2020 ◽  
Vol 14 (1) ◽  
pp. 218-223
Author(s):  
Jean-Sébastien Coron ◽  
Agnese Gini

AbstractAt Crypto 2018, Aggarwal, Joux, Prakash and Santha (AJPS) described a new public-key encryption scheme based on Mersenne numbers. Shortly after the publication of the cryptosystem, Beunardeau et al. described an attack with complexity 𝓞(22h). In this paper, we describe an improved attack with complexity 𝓞(21.75h).


Author(s):  
Kaibin Huang ◽  
Raylin Tso ◽  
Yu-Chi Chen ◽  
Wangyu Li ◽  
Hung-Min Sun

Sign in / Sign up

Export Citation Format

Share Document