RSA Cryptography and Prime Numbers

Author(s):  
Lindsay N. Childs
Cryptography ◽  
2020 ◽  
pp. 120-128
Author(s):  
Prerna Mohit ◽  
G. P. Biswas

This paper addresses the modification of RSA cryptography namely Symmetric-RSA, which seem to be equally useful for different cryptographic applications such as encryption, digital signature, etc. In order to design Symmetric-RSA, two prime numbers are negotiated using Diffie-Hellman key exchange protocol followed by RSA algorithm. As the new scheme uses Diffie-Hellman and RSA algorithm, the security of the overall system depends on discrete logarithm as well as factorization problem and thus, its security is more than public-key RSA. Finally, some new cryptographic applications of the proposed modifications are described that certainly extend the applications of the existing RSA.


Author(s):  
Prerna Mohit ◽  
G. P. Biswas

This paper addresses the modification of RSA cryptography namely Symmetric-RSA, which seem to be equally useful for different cryptographic applications such as encryption, digital signature, etc. In order to design Symmetric-RSA, two prime numbers are negotiated using Diffie-Hellman key exchange protocol followed by RSA algorithm. As the new scheme uses Diffie-Hellman and RSA algorithm, the security of the overall system depends on discrete logarithm as well as factorization problem and thus, its security is more than public-key RSA. Finally, some new cryptographic applications of the proposed modifications are described that certainly extend the applications of the existing RSA.


2004 ◽  
Vol 41 (3) ◽  
pp. 309-324
Author(s):  
C. Bauer
Keyword(s):  

Let pi, 2 ≤ i ≤ 5 be prime numbers. It is proved that all but ≪ x23027/23040+ε even integers N ≤ x can be written as N = p21 + p32 + p43 + p45.


1977 ◽  
Vol 1 (S2) ◽  
pp. 7-19 ◽  
Author(s):  
Don Zagier
Keyword(s):  

2020 ◽  
Vol 70 (3) ◽  
pp. 657-666
Author(s):  
Bingzhe Hou ◽  
Yue Xin ◽  
Aihua Zhang

AbstractLet x = $\begin{array}{} \displaystyle \{x_n\}_{n=1}^{\infty} \end{array}$ be a sequence of positive numbers, and 𝓙x be the collection of all subsets A ⊆ ℕ such that $\begin{array}{} \displaystyle \sum_{k\in A} \end{array}$xk < +∞. The aim of this article is to study how large the summable subsequence could be. We define the upper density of summable subsequences of x as the supremum of the upper asymptotic densities over 𝓙x, SUD in brief, and we denote it by D*(x). Similarly, the lower density of summable subsequences of x is defined as the supremum of the lower asymptotic densities over 𝓙x, SLD in brief, and we denote it by D*(x). We study the properties of SUD and SLD, and also give some examples. One of our main results is that the SUD of a non-increasing sequence of positive numbers tending to zero is either 0 or 1. Furthermore, we obtain that for a non-increasing sequence, D*(x) = 1 if and only if $\begin{array}{} \displaystyle \liminf_{k\to\infty}nx_n=0, \end{array}$ which is an analogue of Cauchy condensation test. In particular, we prove that the SUD of the sequence of the reciprocals of all prime numbers is 1 and its SLD is 0. Moreover, we apply the results in this topic to improve some results for distributionally chaotic linear operators.


2019 ◽  
Vol 19 (02) ◽  
pp. 2050036
Author(s):  
Morteza Baniasad Azad ◽  
Behrooz Khosravi

In this paper, we prove that the direct product [Formula: see text], where [Formula: see text] are distinct numbers, is uniquely determined by its complex group algebra. Particularly, we show that the direct product [Formula: see text], where [Formula: see text]’s are distinct odd prime numbers, is uniquely determined by its order and three irreducible character degrees.


1996 ◽  
Vol 39 (4) ◽  
pp. 402-407 ◽  
Author(s):  
Jean-Luc Chabert
Keyword(s):  

AbstractWe give a characterization of polynomials with rational coefficients which take integral values on the prime numbers: to test a polynomial of degree n, it is enough to consider its values on the integers from 1 to 2n —1.


2020 ◽  
Vol 30 (1) ◽  
pp. 175-192
Author(s):  
NathanaËl Fijalkow

Abstract This paper studies the complexity of languages of finite words using automata theory. To go beyond the class of regular languages, we consider infinite automata and the notion of state complexity defined by Karp. Motivated by the seminal paper of Rabin from 1963 introducing probabilistic automata, we study the (deterministic) state complexity of probabilistic languages and prove that probabilistic languages can have arbitrarily high deterministic state complexity. We then look at alternating automata as introduced by Chandra, Kozen and Stockmeyer: such machines run independent computations on the word and gather their answers through boolean combinations. We devise a lower bound technique relying on boundedly generated lattices of languages, and give two applications of this technique. The first is a hierarchy theorem, stating that there are languages of arbitrarily high polynomial alternating state complexity, and the second is a linear lower bound on the alternating state complexity of the prime numbers written in binary. This second result strengthens a result of Hartmanis and Shank from 1968, which implies an exponentially worse lower bound for the same model.


Sign in / Sign up

Export Citation Format

Share Document