Exercises in Python notebook to implement the RSA encryption algorithm, and figure out if huge numbers are primes via Fermat test. Explanation provided via comments in Japanese.

this is a new Sorting algorithm

The goal is to create a fast, memory efficient library for huge numbers in C

转换阿拉伯数字为中文 理论最大可转换我也数不清位

A Super-Fast C-Program for converting very huge/big numbers from one base to another base without Limitation.