Preface

System Programming is such a tough stuff to knock on its door — You have to get familiar with low-level details of bare metal, and then consider how to code for fine-grained modifications.

Great Algorithms are poetry of computation.

パケットの到着がどのように起こっているかを特徴付ける方法は二つある。一つはある時間間隔の間にいくつ到着するかを確率的に表現する方法であり、もう一つは、連続する出来事の発生間隔の長さを確率的に表現する方法である。本文は、長さtの時間区間に到着するパケット数並びにパケットの到着間隔を議論するポアソン過程を紹介する。

Talks about Deletion of Left-leaning RedBlack Binary Search Tree.

In Part1, we have shown you the proof of Euler’s Theorem and Fermat’s little Theorem. And in Part2, I would show you how they would work in cryptography and ssh(secure shell protocol).

RSA

RSA (Rivest–Shamir–Adleman) is a public-key cryptosystem that is widely used for secure data transmission. It is also one of the oldest. The acronym RSA comes from the surnames of Ron Rivest, Adi Shamir and Leonard Adleman, who publicly described the algorithm in 1977. An equivalent system was developed secretly, in 1973 at GCHQ (the British signals intelligence agency), by the English mathematician Clifford Cocks. That system was declassified in 1997.

In my Excellent_OCW Repo, I have shown you the Logic Tree to prove Euler Theorem and how to applicate it to RSA. In this post, I wanna try to prove it as possible as completely.

When I was just a high school student, I was totally crazy about physics and a big fan of Prof. Feynman, who was awarded the Nobel Prize in Physics and also famous for his humorous Lectures.