How to make RSA and some other encryptions probabilistic
نویسنده
چکیده
A new scheme of probabilistic subgroup-related encryption is introduced. Some applications of this scheme based on the RSA, Diffie-Hellman and ElGamal encryption algorithms are described. Security assumptions and main advantages of this scheme are discussed. We outline that this scheme is potentially semantically secure under reasonable cryptographic assumptions. 1. Some algorithmic problems for finite fields and modular
منابع مشابه
Finding a Small Root of a Univariate Modular Equation
We show how to solve a polynomial equation (mod N ) of degree k in a single variable z, as long as there is a solution smaller than “Ik. We give two applications to RSA encryption with exponent 3. First, knowledge of all the ciphertext and 2/3 of the plaintext bits for a single message reveals that message. Second, if messages are padded with truly random padding and then encrypted with an expo...
متن کاملA Complete Public-Key Cryptosystem
We present a cryptosystem which is complete for the class of probabilistic public-key cryptosystems with bounded error. Besides traditional encryption schemes such as RSA and El Gamal, this class contains probabilistic encryption of Goldwasser-Micali as well as Ajtai-Dwork and NTRU cryptosystems. The latter two are known to make errors with some small positive probability. To our best knowledge...
متن کاملNotes on Two Methods for Direct Construction of Probabilistic Lfsr Sequences of Third Order Lhoussain El Fadil and Danilo Gligoroski
In [4], the authors give two public key encryptions based on third order linear sequences modulo n, where n = pq is an RSA integer. In their scheme (3), there are two mistakes in the decryption procedure: (1) The owner of the private key does not know the value of m such that C1 = sm(a, b) and C2 = s−m(a, b), and thus he/she can not compute L(C1, C2). (2) If sλ(a, b) = 3 modulo n , then L(a, b)...
متن کاملP-157: TLR5 Gene Expression in Endometrium of Women with Unexplained Recurrent Spontaneous Abortion
Background: Recurrent spontaneous abortion (RSA) is usually defined as three or more consecutive pregnancy losses before 20th week of gestation. Although different factors are considered as etiology of RSA but in some cases, despite of extensive work up, the cause of RSA remains unknown which called unexplained RSA. Immunological factors are suggested as etiological factors of unexplained RSA. ...
متن کاملExtension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1603.02031 شماره
صفحات -
تاریخ انتشار 2016