搜索结果: 1-15 共查到“Primes”相关记录38条 . 查询时间(0.046 秒)
Post-Quantum Provably-Secure Authentication and MAC from Mersenne Primes
secret-key cryptography MERS
2019/4/23
This paper presents a novel, yet efficient secret-key authentication and MAC, which provide post-quantum security promise, whose security is reduced to the quantum-safe conjectured hardness of Mersenn...
On inversion modulo pseudo-Mersenne primes
Elliptic Curves side-channel secure modular inversion
2018/11/2
It is well established that the method of choice for implementing a side-channel secure modular inversion, is to use Fermat's little theorem. So 1/x=xp−2modp1/x=xp−2modp. This can be calcu...
Scalar Blinding on Elliptic Curves based on Primes with Special Structure
public-key cryptography elliptic curve cryptosystem
2015/12/24
This paper shows how scalar blinding can provide protection against side channel
attacks when performing elliptic curve operations with modest cost, even if the
characteristic of the field has a spa...
The distributive law of odd primes in the natural numbers Even number E≥6 can be expressed as the sum of two odd primes
Goldbach hypothesis odd prime infimum
2015/6/2
1. This paper provided the distributive law of odd primes in the natural numbers. 2. Given a mathematical model of two opposite directional sequences of natural numbers： ︳Omin ,…，…,…，Omax ︳ ︳Omax ,…, ...
The distributive law of primes in the natural numbers Even numbers 2x≥6 can be expressed as the sum of two primes
Goldbach hypothesis prime infimum
2015/6/2
Find out the distributive law of primes in the natural numbers. By means of the distributive law of primes we show that even numbers 2x≥6 can be expressed as the sum of two primes.
Congruences of Multipartition Functions Modulo Powers of Primes
modular form partition multipartition Ramanujan-type congruence
2014/6/3
Let pr(n) denote the number of r-component multipartitions of n, and let Sγ λ be the space spanned by η(24z)γφ(24z), where η(z) is the Dedekind’s eta function and η(z) is a holomorphic modular form i...
The distributive law of primes and the proof of Goldbach hypothesis
Goldbach hypothesis supremum infimum prime in pairs p1＋p2
2015/6/2
This paper concerns a graph of (3≤x≤2500, N) orthogonal coordinate system. 1. Distributive law of primes, (x/㏒x)㏒e＜π(x)≤(x/㏒x)㏒199/19, (3≤x＜∞); 2. ①. Folding expression of odd numbers, (x＝2n－1), ︱x,…,...
Proof of hypothesis of twin primes (important step: choosing a suitable interval)
Twin primes supremum infimum
2015/6/2
1. Distributive law of primes: (x/㏒x)㏒e＜π(x)≤(x/㏒x) ㏒11330／113, (11≤x＜∞); 2. Shortest suitable interval, [11, 19]; 3. Expression of twin odd numbers, ︱2x－11,…,…,…,4x－27︱ ︱2x－ 9,…,…,…,4x－25︱, Number of...
Fast Prime Field Elliptic Curve Cryptography with 256 Bit Primes
Elliptic Curve Cryptography
2014/3/5
This paper studies software optimization of Elliptic Curve Cryptography with 256-bit prime fields. We propose a constant-time implementation of the NIST and SECG standardized curve P-256, that can be ...
In this paper we bring into attention an old subject in number theory. Fermat showed that a prime can be written as a sum of two squares if and only if it is a multiple of four plus one and the decomp...
A Diophantine problem with a prime and three squares of primes
Goldbach-type theorems Hardy-Littlewood method diophantine inequalities
2012/6/14
We prove that if $\lambda_1$, $\lambda_2$, $\lambda_3$ and $\lambda_4$ are non-zero real numbers, not all of the same sign, $\lambda_1 / \lambda_2$ is irrational, and $\varpi$ is any real number then,...
In the present work we investigate the largest possible gaps between consecutive numbers which can be written as the difference of two primes. The best known upper bounds are the same as those concern...
Mersenne Primes in Real Quadratic Fields
Mersenne Primes Real Quadratic Fields Number Theory
2012/5/24
The concept of Mersenne primes is studied in real quadratic fields of class number 1. Computational results are given. The field $Q(\sqrt{2})$ is studied in detail with a focus on representing Mersenn...
Every prime larger than 3 is arithmetic mean of other two primes
prime distribution of primes arithmetic progression Goldbach conjecture
2011/9/21
In this paper a new stronger proposition has been advanced and shown, that is, every prime larger than 3 is arithmetic mean of other two primes, and other important propositions that there are infinit...
The irregular distribution of primes up to 300,000 in the sequence of odd numbers
prime distribution of primes
2011/9/19
In this paper we listed a sequence of odd numbers up to 300,000 by a computer calculating and it could be find that the density of prime numbers is decreased as odd number increases and that there exi...