写在前面

在今年的8月4日至8月21日，笔者花费了18天的时间，自泰国的曼谷出发，一路向南，以飞机，车船联运，大巴与火车为主要交通手段，草草纵贯了马来半岛。

沿途欣赏东南亚的奇秀风光之余，对那里的人们，社会文化，产业发展和种种现象，也产生了复杂的情感和思考。尤其我自陆路纵贯了泰国，马来西亚和新加坡三个国家，这三个国家截然不同的政治体制，以及由此所带来的贫富之差令笔者印象尤为深刻。

转眼匆匆，近20天的旅程仿佛还在昨天，所谓“读万卷书，行万里路”，当真的踏上旅途，才对这句话中的滋味更有一番实感。

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.