In a recent paper a quite unexpected result about a new pattern in prime numbers emerged:


[Unexpected biases in the distribution of consecutive primes](http://arxiv.org/abs/1603.03720)  
by Oliver, R. J. L.; Soundararajan, K. (Submitted on 11 Mar 2016)



> 
> While the sequence of primes is very well distributed in the reduced
>  residue classes (mod $q$), the distribution of pairs of consecutive
>  primes among the permissible $ϕ(q)^2$ pairs of reduced residue classes
>  (mod $q$) is surprisingly erratic. This paper proposes a conjectural
>  explanation for this phenomenon, based on the Hardy-Littlewood
>  conjectures. The conjectures are then compared to numerical data, and
>  the observed fit is very good.
> 
> 
> 


**My question**  

Could this result have any impact on the security of encryption algorithms which are based on prime numbers?



Could this unexpected bias in the distribution of consecutive primes have any impact on the security of encryption algorithms?
This discovery is beautiful, but it's unlikely to have any impact on cryptography. Of course this lack of relevance is a matter of speculation/opinion, not proven mathematical fact, but these sorts of correlations between consecutive primes just haven't come up in cryptography to my knowledge, because there seems to be no value in using extremely close primes in any cryptosystem. It's basically orthogonal to what cryptographers care about. Of course it's always worth learning more about the primes, and it's hard to predict where it might lead in the future, but this paper raises no special cause for concern in cryptography.


