Origin of MOD

The remainder of dividing one number by another number, called MOD, its meaning is the same as of the period of dinosaur demise, and the pronunciation, however, is followed on from the period of ape men making fire.

«Dharavi slum»

The story originates on after the death of all dinosaurs; every species deeply understands the lives is precious, no matter what the jungle law is going on.

These elders cluster together to set up the commandment “MO” for coexisting of next generations, that is, every creature can not be allowed to easily obtain food.

The edict thus is passed on generation after generation until ape men have been living in groups, wherein, they observe the lion, which chases the deer out of breath, is not worthy to be titled “king of the beasts”.

Moreover, they build and use tools to easily capture a bunch of food; all creatures are very angry and roaring with MO MO for protest.

They still are not willing to comply with the discipline and, all creatures fall in despair and yell with MOO---D, implied “damn your mother” for getting pissed off on human behavior.

Jordan swankienda

Modern people apply this MOD to purely mathematical calculation and to applications of data encryption, but they immovably do not want to abide by its spirit in real life.

Nevertheless, now they also have trouble in their most of constructed rules, which are almost trapping into how to rape resources trickily from other parties.

Fast Public Key Encryption

The new module is M x e mod n = C for encryption, then, C x d mod n = M for decryption.

«public key»

General speaking, a plaintext multiplying a public key obtains a ciphertext and further, the ciphertext multiplying a private key restores the plaintext under a number n.  It works even faster than before due to taking the modular multiplication just one time, and is real simple to create a cryptosystem.

Currently, having a low confidence of security in e-commerce shows RSA technology, which is encoded by M^e mod n = C and decoded by C^d mod n = M.  Although it takes “e” or “d” times of calculation to making sure the deal no error, people still doubt with its security.

The invention now is able to apply on changing the public and private keys easily which still corresponds to the same person;  moreover, this system does need not run the hash function for detecting duplicated,  and insteadly the private key may  process directly for  ID certification, paper verification, even video stream protection, etc.; you could take it as a good choice in the crypto market and ask nine.ring@msa.hinet.net for more information.

Demo as below (n: 160 digits)

n=21527411027188897018960152013128254292577735888456759801704976767781331452188591
35673011059773491059602497907111585214302079314665202840140619946994927570407753.

e=20432527709310197318354245362418050579549387636726678197587263747269515991209202
11889319689440386978659503465726551156851932909974146736938195025670844433810430.

d=38685057992879383895185024940030606925170144705852228942654788196629283318195373
9309657050648420028660647814081923279324216822545917632852350813308010494734320.