Paper 2014/946
On a new fast public key cryptosystem
Samir Bouftass and Abdelhak Azhari
Abstract
This paper presents a new fast public key cryptosystem namely : a key exchange algorithm, a public key encryption algorithm and a digital signature algorithm, based on the difficulty to invert the following function : F(x) = (a * x)Mod(2 power p)Div(2 power q) . Mod is modulo operation , Div is integer division operation , a , p and q are integers where (p > q) . In this paper we also evaluate the hardness of this problem by reducing it to SAT .
Note: Some refinements and adjustements.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- key exchangepublic key encryptiondigital signatureboolean satisfability problemMultivariate polynomials over F(2) .
- Contact author(s)
-
crypticator @ gmail com
aazhari2001 @ yahoo fr - History
- 2015-10-29: last of 8 revisions
- 2014-11-19: received
- See all versions
- Short URL
- https://ia.cr/2014/946
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/946,
author = {Samir Bouftass and Abdelhak Azhari},
title = {On a new fast public key cryptosystem},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/946},
year = {2014},
url = {https://eprint.iacr.org/2014/946}
}
