Bitcoin crisis era of hegemony and quantum (a) after the share Shu technology

This article is reproduced from the public No. Trias: "After sharing technology and quantum era Shu Bitcoin hegemony crisis (a)."

introduction

Reports emphasized the central block chain technology eighteenth collective learning, the media industry have been given sufficient attention. However, another important reports of people but then after two days did not show the attention it deserves.

This report is October 26, Thirteenth Fourteenth Meeting of the NPC Standing Committee voted by 26 pm "People's Republic of China cryptography", which is effective from 1 January 2020.

Carried out from the center of the learning block chain technology, the block chain technology to be recognized at the strategic level, the formal introduction of cryptography, occasionally also contains inevitable.

Block chain technology distributed, tamper-resistant, traceable benefits already well known, but all the so-called Aioi, proved difficult from the block chain technology and cryptography alone, for two reasons:

First, the traditional thinking of different techniques, block chain technology has greatly weakened the single control center, data security is inseparable from the parties involved in the protection of cryptography. Bitcoin was born more than a decade, under appropriate safeguards cryptography, decentralized Bitcoin has maintained a relatively stable and safe operation.

Second, in practice, many participating nodes do not want their data to be fully made public, and therefore do not want the data link, which obviously limits the application of the floor block chain technology. How to maintain the privacy of the data chain has become a major problem block chain applications, cryptography is greatly beneficial to provide this supplement.

Speaking block chain, it is not open around Bitcoin, more inseparable from cryptography. This article aims to explore the origin of elliptical encryption algorithm (hereinafter referred to as ECC) as the representative of cryptography, value, status, and future prospects in quantum cryptography in the computer age.

From RSA to ECC

The most famous block chain applied credits than bits, as bit bouncer currency, the value of the block chain which is quite significant ECC Elliptic Curve Digital Signature Algorithm (hereinafter referred to as the ECDSA) based. It can be said, ECC and block chain can be described as solidarity. Before talking about ECC, we first introduce the RSA algorithm.

This password is World War II movies and television have an important theme. For belligerent, the country is not heavy artillery tanks, nor is gold and silver money, not even an aircraft carrier, but not from the eyes of the codebook.

In 1942, an important turning point in the Pacific naval battle - the Battle of Midway, the reason why the US military victory, an important factor is the US military access to encrypted files in Japan, and Japan is about to decipher the important information attack Midway.

 

(Japan combined fleet suffered heavy losses in the Battle of Midway)

 

In 1943, the Japanese Combined Fleet commander, Admiral Yamamoto during his inspection of troops, the US military plane was shot down and killed, the direct reason is that the US military communications code was cracked.

Before and after World War II, like numerous examples. Even to the Cold War, to decipher the secret power is a major work of Soviet intelligence services. To 1977, Rivest, Shamir and Adleman three professors with the first letter of the name of naming a new algorithm: RSA. Unlike conventional symmetric encryption cipher requires thick, RSA algorithm is an asymmetric encryption. The so-called asymmetric encryption means into the public and private keys, public and private key pairs must be present, can not be generated separately. Anyone know the public key for encryption; only the private person to receive information in order to know for decryption.

RSA's birth can be described as a historic breakthrough, called the watershed of classic and modern cryptography. As long as a sufficiently large prime number RSA decryption will force a costly and time count, it is difficult to break the short term.

But the so-called fortune or misfortune to dependency, in pursuit of security, RSA requires a very large prime numbers as a basis, extend the encryption keys will greatly increase the cost and reduce the speed. Even worse, RSA algorithm in dealing with the threat of a quantum computer is quite powerless.

At this time, ECC came into being. ECC in 1985 Koblitz and Miller invented by two professors. As with the RSA algorithm, belonging to the same ECC asymmetric encryption, but the use of ECC in convenience and safety is greatly stronger than RSA.

ECC What is it? It may very interested in this point.

We define parallel lines meet at infinity point P∞, so that all are unified as a straight line on a flat surface with a unique point of intersection, and the point different from the infinite point on the original plane is the usual point. Through the point at infinity and the usual point we can introduce the concept of projective plane.

Projective plane: the plane of infinity in all configured with all the usual point of the projective plane.

The elliptic curve, refers to the satisfaction Wells Atlas equation (the Weierstrass) set of all points on the projective plane, and all points on the curve are nonsingular.

 

The so-called non-singular, refers to any point on the curve partial derivatives are not simultaneously 0.

明白了椭圆曲线的由来,我们再来看椭圆曲线在密码学上应用的方案。首先面对的问题就是椭圆曲线是连续的,并不适合用于加密。因此,椭圆曲线密码学的第一要务就是把椭圆曲线定义在有限域上,(有限域Fp ,p为素数),并提出一条适于加密的曲线:y2=x3+ax+b (modp)。

相比起在商业中被广泛采用的RSA加密算法,ECC优势是可以使用更短的密钥,来实现与RSA相当或更高级别的安全。

通过下图我们清楚的发现,160位ECC加密安全性相当于1024位RSA加密,而210位ECC加密安全性甚至相当于2048位RSA加密。ECC中256位数的密钥与RSA算法中3072位数密钥所提供的安全强度相同。

因此,ECC具备计算量更小,处理速度更快,占据存储空间更小的优点,在资源、算力有限的前提下,ECC比RSA具备显著的优势。这些优势已经使得ECC逐渐完成了对RSA的取代,成为了新一代的通用公钥加密算法。

如今,ECC早已无处不在:我们的第二代身份证都基于ECC,美国政府部门也用ECC加密内部通信,FireFox和Chrome浏览器、苹果的iMessage服务都使用ECC。

那么,ECC、ECDSA等密码技术在应用过程中有哪些值得关注的地方呢?另外,近期火热的“量子霸权”讲的又是什么,它会对密码学产生什么影响呢?

在后续的系列文章中,我们将会继续对其展开讨论。

 

推荐阅读

 

RSA的基本原理 

 

我在此前的文章写道,密码学问题,本质上是数学问题。RSA算法自然也不例外,其原理并不复杂,几个数字即可讲明白。

我们先引入三个中学数学概念,质数,互质、取模。

质数:指在大于1的自然数中,除了1和它本身以外不再有其他因数的自然数。比如,2、3、5、7…

互质:是指公约数只有1的两个数。比如,2和3,3和5,4和5均互质。

取模:指求余运算,运算符是mod,比如4 ÷ 3 = 1余1,所以,4mod 3 = 1。

在明白上述概念后,我们来看一组简单的RSA加密方案:

1、找到一组互质数,P和Q,相乘后得到N

2、将P和Q分别减去1,再次相乘,得到M

3、确定加密公钥E,使得E与M互质

4、确定解密私钥D,使得D乘以E除以M余1,即(D × E) mod M = 1

比如,挑两个互质数,P=5和Q=8,N=P*Q=40,M=(P-1)*(Q-1)=28

随机选取公钥E=5,则私钥D=45.

从这里,我们可以设计出一对公钥私钥,加密公钥KU={E,N}={5,40},解密私钥KR={D,N}={45,40}。

1、在加密过程中,需要将加密数字自乘(E-1)次,当自乘结果超过N时,需要将结果取模后再乘,最后得到安全密文。

2、在解密过程中,用密文自乘(D-1)次,同样,当自乘结果超过N时,需要将结果取模后再乘,最后得到加密数字。

感兴趣的朋友可以通过我们给出的加密方案来对一些简单的数字进行加密,由于秘钥数字P和Q很小,用纸笔或者简易的计算器就能够计算出来。

 

BlockMania还将上线更多AMA交流与问答活动,邀请加密行业内各专家一同对话,欢迎把您的问题、建议及意见通过公众号留言给我们,感谢您的关注!

发布了27 篇原创文章 · 获赞 0 · 访问量 1739

Guess you like

Origin blog.csdn.net/BlockMania/article/details/103451604