[B! information] kenzan8000のブックマーク

kenzan8000 id:kenzan8000

informationに関するkenzan8000のブックマーク (17)

RSA encryption: Step 4 | Journey into cryptography | Computer Science | Khan Academy
kenzan8000 2020/04/25
Alice: create a public key by two random prime numbers multiplication, get the phi, create exponent for another public key(create a private key), and send two public keys. Bob: create encrypted message by the public keys and a new private key, and send it. Alice: decrypt message by the private key.

rsa

cryptography

computer science

information
リンク
Diffie-hellman key exchange | Journey into cryptography | Computer Science | Khan Academy
kenzan8000 2020/04/25
encryption used shared private key and public keys and discrete logarithm problem. easy to perform between Alice and Bob but hard for Eve to reverse because so many numbers of trial are needed to reverse.

cryptography

computer science

information

discrete logarithm

math
リンク
Elegant Compression in Text (The L.Z.77 Method) - Computerphile - YouTube
Text compression methods such as LZ can reduce file sizes by up to 80%. Professor Brailsford explains the nuts and bolts of how it is done. Original Compression film: http://youtu.be/Lto-ajuqW3w EXTRA BITS - Text Compression meets probabilities: http://youtu.be/cCDCfoHTsaU Cross Site Scripting with Tom Scott: http://youtu.be/L5l9lSnNMxg http://www.facebook.com/computerphile https://twitter.com/c
kenzan8000 2020/04/23
basic idea of text compression. reuse the character pattern already occurred. use data structure like the pointer and length for the implementation. also, the frequency of word or character pattern fits better than each character does. it is called adaptive compression or arithmetic compression.

computer science

information

compression

data structure

algorithm

statistics
リンク
Upside Down Trees (Huffman Trees) - Computerphile - YouTube
How do we derive the most compact codes for a situation? Huffman Trees can help. Professor Brailsford explains how computer scientists like their trees to be upside down. "Entropy in Compression - Computerphile" precedes this: http://www.youtube.com/watch?v=M5c_RFKVkko EXTRA BITS: More on Huffman Trees: http://www.youtube.com/watch?v=DV8efuB3h2g Error Correction: http://www.youtube.com/watch?v=
kenzan8000 2020/04/23
for entropy reduction. pick up two lower probabilities first as a deepest branch. repeat it until you have built complete binary tree. then you can assign bit codes to each. less bit codes are assigned to frequently used data.

computer science

information

compression

statistics

huffman

tree
リンク
Pseudorandom number generators | Computer Science | Khan Academy
kenzan8000 2020/04/23
you cannot predict randomness. pseudorandom is predicable because of the repetition but difficult if the seed is long. need lots of computation resource to decrypt

cryptography

computer science

information
リンク
The Enigma encryption machine | Journey into cryptography | Computer Science | Khan Academy
kenzan8000 2020/04/23
rotor encryption (enigma): state allows you to encrypt one letter to another. state is defined by rotors. key space = rearrange rotor x numbers on each rotor; state change happens by every type since rotor rotates. only initial state is shared

cryptography

statistics

computer science

information
リンク
エニグマ暗号機による通信方法
ご注意この解読法の文章や図面の全部または一部をコピーすることを禁じます。このサイトの所在を明記して引用すること、またはURLリンクを貼ることは自由です。なお、パワーポイント・スライド版には不正確な部分があるので非公開としました。エニグマ暗号機と暗号通信エニグマ暗号はドイツの軍事暗号の一つで、文字の間に対称性のある「換字暗号」の一種である。換字とは任意の二文字が交換されることで、たとえば文字ＡとＮ、文字ＹとＨは相互に交換される。文字の対応関係が固定されていて、ある程度の文章の量があれば、文字の出現頻度を統計的に分析することで解読できる。たとえば英語ではｅが最も出現頻度が多く、次に多いのはａやｔだから、暗号文中で出現頻度の大きい文字に、これらを当てはめてみるのが最初になされることである。頻度以外にも、単語中の出現位置や他の文字との多重相関をとり、元の文の意味を推定するなど、まるでクロス
kenzan8000 2020/04/23
cryptography

statistics

computer science

information
リンク
パリティビットの意味と誤り検出、誤り訂正の方法 - 具体例で学ぶ数学
kenzan8000 2020/04/21
detect error if number of 1 or 0 bits seems wrong as the parity bit (row in 2d matrix). then add error correction codes (other parity bits representing column in 2d matrix). if both parity bit and error correction code seem wrong, you can figure out the exact bit (coordinate) that seems wrong.

computer science

information

parity bit

error
リンク
Error correction | Journey into information theory | Computer Science | Khan Academy
kenzan8000 2020/04/21
computer science

information

error

parity bit
リンク
Compression codes | Journey into information theory | Computer Science | Khan Academy
kenzan8000 2020/04/21
computer science

information

huffman

encoding

entropy
リンク
Information entropy | Journey into information theory | Computer Science | Khan Academy
kenzan8000 2020/04/20
information

entropy

computer science

probability
リンク
Origin of Markov chains | Journey into information theory | Computer Science | Khan Academy
kenzan8000 2020/04/20
computer science

information

markov chains

statistics
リンク
Measuring information | Journey into information theory | Computer Science | Khan Academy
kenzan8000 2020/04/20
computer science

information

bit

logarithm
リンク
Introduction to channel capacity | Journey into information theory | Computer Science | Khan Academy
kenzan8000 2020/04/20
computer science

information

baud

symbol space
リンク
Morse code and the information age | Computer Science | Khan Academy
kenzan8000 2020/04/19
information

computer science

binary

encoding
リンク
Visual telegraphs (case study) | Computer Science | Khan Academy
kenzan8000 2020/04/19
information

computer science

binary

encoding
リンク
Source encoding | Journey into information theory | Computer Science | Khan Academy
kenzan8000 2020/04/19
encoding

computer science

information
リンク
1

お知らせ

もっと読む

公式Twitter

@HatenaBookmark
リリース、障害情報などのサービスのお知らせ
@hatebu
最新の人気エントリーの配信

キーボードショートカット一覧

j次のブックマーク

k前のブックマーク

lあとで読む

eコメント一覧を開く

oページを開く

設定を変更しましたx