Danbooru
Login Posts Comments Notes Artists Tags Pools Wiki Forum More » Listing Upload Hot Changes Help

Search

Blacklisted (help)

  • guro
  • scat
  • furry -rating:g
Disable all Re-enable all

Artist

  • ? azel (laevateinn495) 168

Copyright

  • ? touhou 940k

Characters

  • ? flandre scarlet 54k
  • ? koakuma 15k

General

  • ? 2girls 1.1M
  • ? blonde hair 1.7M
  • ? book 152k
  • ? chibi 275k
  • ? educational 190
  • ? hat 1.3M
  • ? head wings 71k
  • ? long hair 4.8M
  • ? math 1.2k
  • ? mouth hold 86k
  • ? multiple girls 1.7M
  • ? open mouth 2.7M
  • ? red eyes 1.4M
  • ? red hair 584k
  • ? smile 3.2M
  • ? text focus 18k
  • ? wall of text 1.3k
  • ? wings 480k

Meta

  • ? bad id 1.3M
  • ? ↳ bad pixiv id 981k
  • ? commentary request 3.6M
  • ? highres 6.0M
  • ? photoshop (medium) 707k
  • ? translation request 611k
  • ? ↳ check translation 38k

Information

  • ID: 1053554
  • Uploader: henmere »
  • Date: over 13 years ago
  • Size: 460 KB .jpg (1296x1812) »
  • Source: pixiv.net/artworks/21484864 »
  • Rating: Sensitive
  • Score: 0
  • Favorites: 2
  • Status: Deleted

Options

  • Resize to window
  • View smaller
  • View original
  • Find similar
  • Download

History

  • Tags
  • Pools
  • Notes
  • Moderation
  • Commentary

This post was deleted for the following reason:

Unapproved in three days (over 13 years ago)
Resized to 65% of original (view original)
flandre scarlet and koakuma (touhou) drawn by azel_(laevateinn495)

Artist's commentary

  • Original
  • 例大祭SP新刊サンプル

    フランちゃんの家庭教師2-初等整数論(下)-
    前回の例大祭の続きの内容になります。

    次に作る科目何にしようかなー

    ミスがあるかもしれないので当日までに確認して修正ペーパー用意します。

    • ‹ prev Search: user:henmere status:deleted next ›
    • « ‹ prev Pool: Touhou - Tutoring Flan-chan ~Elementary Number Theory~ (Fujii Tatsuya) next › »
  • Comments
  • underscoreCF
    over 13 years ago
    [hidden]

    While I can't read kanji, I'll forever remember Algebra and its application on the RSA cryptography. Good thing Flandre is actually a centuries old vampire, because this is not for kids :P

  • 0
  • Reply
    • Copy ID
    • Copy Link
    Shadowflames
    over 13 years ago
    [hidden]

    FINALLY, SOMETHING I'VE STUDIED IN DETAIL!

    *sigh* Fujii Tatsuya, I hate you.
    *sees book-eating Flan* Fuji Tatsuya, I love you.

    EDIT:
    Done. Please check it over; it's been a while since I did something with RSA.

  • 1
  • Reply
    • Copy ID
    • Copy Link
    p=7, q=13, n=91, phi(n)=72. We have x^11 mod 91 = 5. Since phi(n)=72, we'll find the private key of 11 by computing a in 11a+72b=1, and we have a=59. Then we have x mod 91 = 5^59, and calculate x mod 91 = 73.
    Wow. Even with small primes like 7 and 13, we ended up having to do a lot of calculation. If you have a PC, it can be pretty fun using the calculator functions X^Y and MOD. (Choose the Scientific Calculator option from the calculator's menu.)
    Because you have a scientific calculator on your PC, manual calculations aren't necessary. Try decrypting the ciphertext on the next page.
    RSA Cryptography
    [What is RSA Cryptography?] RSA Cryptography is an example of a Public Key Cryptographical Algorithm, where two extremely large prime numbers p and q are used. In order for the sender and receiver to communicate with each other, the sender calculates pq = n. We have a message x, and phi(n)=(p-1)(q-1). We choose public key e such that e is coprime with phi(n), and compute ciphertext x^e. The only information available to the sender is the message x, public key e, and n. The receiver has a private key d such that ed mod phi(n) = 1, and raise the ciphertext to its dth power (according to Euler's Theorem, x^(ed) mod n = x) to obtain the original plaintext. Since phi(n) can be obtained easily by factoring n through heuristics, in practice extremely large numbers of p and q (2048-bit long) are used to prevent the factorizaion from being completed in a practical timeframe. This is how RSA stays secure. Let's see an example with some really small prime numbers.
    Column [RSA Cryptography] Today I'll be the instructor. Number theory has a large number of practical applications. For example, number theory is an important member in cryptography. I'll introduce that with an example.
    Terms / Privacy / Upgrade / Contact /