타원곡선 알고리즘 이해하기

blog.cloudflare.com/a-relatively-easy-to-understand-primer-on-elliptic-curve-cryptography/

A (Relatively Easy To Understand) Primer on Elliptic Curve Cryptography

 

medium.com/onther-tech/%EB%B8%94%EB%A1%9D%EC%B2%B4%EC%9D%B8-%EA%B3%B5%EB%B6%80-%EC%9E%90%EB%A3%8C-%EC%A0%95%EB%A6%AC-v0-9-acd011ef8399

블록체인 공부 자료 정리 v0.9

 

The history of cryptography can be split into two eras: the classical era and the modern era. The turning point between the two occurred in 1977, when both the RSA algorithm and the Diffie-Hellman key exchange algorithm were introduced.

These new algorithms were revolutionary because they represented the first viable cryptographic schemes where security was based on the theory of numbers; it was the first to enable secure communication between two parties without a shared secret. Cryptography went from being about securely transporting secret codebooks around the world to being able to have provably secure communication between any two parties without worrying about someone listening in on the key exchange.

 

암호학의 역사는 RSA,DH 이전과 이후로 나뉜다. 이전에는 메시지를 주고받는 개인들이 공유하는 비밀메시지블록에 대한 합의를 미리 가지고 있었어야 했다면 그 이후에는 그러한 사전에 미리 정해둔 합의없이 원문의 메시지를 주고 받으면서 3자가 열람하는 것에대해 걱정하지 않는다

 

Modern cryptography is founded on the idea that the key that you use to encrypt your data can be made public while the key that is used to to decrypt your data can be kept private. As such, these systems are known as public key cryptographic systems. The first, and still most widely used of these systems, is known as RSA — named after the initials of the three men who first publicly described the algorithm: Ron Rivest, Adi Shamir and Leonard Adleman.

 

현대의 암호학은 암호화시키는 public key는 공개되고 해독하는 private key는 본인만 알고있다

 

What you need for a public key cryptographic system to work is a set of algorithms that is easy to process in one direction, but difficult to undo. In the case of RSA, the easy algorithm multiplies two prime numbers. If multiplication is the easy algorithm, its difficult pair algorithm is factoring the product of the multiplication into its two component primes. Algorithms that have this characteristic — easy in one direction, hard the other — are known as Trap door Functions. Finding a good Trapdoor Function is critical to making a secure public key cryptographic system. Simplistically: the bigger the spread between the difficulty of going one direction in a Trapdoor Function and going the other, the more secure a cryptographic system based on it will be.

 

한쪽 방향으로 계산하기는 매우 쉬우나 그 결과값을 다시 인풋값으로 변환시키기는 매우 어려운 함수를 Trap door Function이라 부르고 이는 암호학에서 매우 핵심적인 요소이다.