Cryptography Tip
@CryptographyTip
Followers
1,414
Following
5
Media
27
Statuses
309
Explore trending content on Musk Viewer
Chan
• 361693 Tweets
Kalafina
• 156062 Tweets
梶浦さん
• 38864 Tweets
渋沢栄一
• 32046 Tweets
Into the Depth with YUTA
• 30821 Tweets
GORGEOUS ORCHID X LOVERRUKK
• 25899 Tweets
#LINEMANถูกสุดทุกวันxENGFA
• 23015 Tweets
Summering
• 16334 Tweets
#GGUM1stWin
• 14733 Tweets
沖縄独立
• 14158 Tweets
Gセルフ
• 13187 Tweets
木村ミノル
• 10148 Tweets
Pinned Tweet
Don’t roll your own encryption.
Of course /someone/ has to create encryption systems, but the people qualified to do so do it very cautiously and subject their work to the scrutiny of other experts.
3
8
44
Computer scientist: Unfortunately there’s no efficient algorithm for solving this problem as far as we know.
Cryptographer: Hmm. I may be able to use that.
0
16
70
Kerckhoff's principle: The security of an encryption scheme should depend only on the secrecy of the key, and not on the secrecy of the algorithm.
0
11
51
Acress Hedy Lamarr was co-inventor of Frequency Hopping Spread Spectrum.
2
5
33
The pigeon hole principle implies that if a hash function produces b bits, there must be many files of more than b bits that hash to the same value.
Collision resistance means that nevertheless you almost certainly won't be able to find two such files without a lot of work.
0
11
30
“Cryptography is a tool for turning a whole swath of problems into key management problems.” — Lea Kissner
0
8
29
The icon for this account is the symbol for XOR, an allusion to encryption using a one-time pad.
4
1
23
Post-quantum encryption contender is taken out by single-core PC in 1 hour
0
6
21
“Cryptography is typically bypassed, not penetrated.” — Adi Shamir
0
5
20
Using a block cipher to simply encrypt one block of bits at a time (ECB mode) is a bad idea, "because you can see the penguin."
You can see that blocks of the same color have been encrypted the same way.
0
5
19
Peer review works in cryptography because there are objective criteria for success and failure.
If you break someone’s encryption there’s no denying that you did.
2
1
17
The log base b of a number n is the solution to the equation b^x = n.
The discrete logarithm problem solves the same equation, but moluldo a large prime.
Encryption systems depend on the assumption that the discrete logarithm problem is hard.
2
4
16
“The universe favors encryption." -- Julian Assange
0
2
13
What are the differences between a digital signature, a MAC and a hash?
0
2
12
When the US government classified the RSA encryption algorithm as munitions, T shirts with a Perl implementation were made in protest.
0
3
10
Claude Shannon's classified 1945 report: A Mathematical Theory of Cryptography.
0
3
12
A Brief History of the U.S. Trying to Add Backdoors Into Encrypted Data
1
3
11
EU court says backdoors to end-to-end encrypted messages violate human rights.
0
5
10
A pseudograndom number generator (PRNG) may have excellent statistical properties but not be a cryptographically secure pseudorandom number generator (CSPRNG) suitable for use in cryptography.
0
0
11
In the Enigma encryption machine, the signal for a typed letter would go through a chain of scrambling rotors: A, B, C, and D. Then through a reflector R, then back through the rotors in the opposite order.
Then the rotors would change positions, like an odometer.
1
0
12
Hash collisions and exploitations
0
2
10
DES encryption symmetry: If you flip the bits in the message and the key, you flip the bits in the ciphertext.
0
0
8
Why we don't generate elliptic curves every day
0
1
7
This account now has over a thousand followers.
Thanks everyone for following.
0
0
10
X RF SXIIXKW XK IYZ UXINYZK HT IYZ CXIICZ YHJSZ RI FZGTXZCG, HJQ SZNHKG TRQF BYXNY XS NJI HTT EV IYZ QXGWZ RKG R MJRQIZQ-FXCZ RNQHSS IYZ TXZCGS TQHF HJQ YHFZ LCRNZ, BYZQZ VHJ RQZ. X RF BQXIXKW R EHHU. XK XI X RF SLZRUXKW IH VHJ. EJI X RF RCSH SLZRUXKW IH IYZ BHQCG.
7
4
9
Steganography hides a message inside another message, such as by tweaking pixels in an image. From the Greek work steganos meaning 'covered.'
0
2
9
SHA-2 is subject to length extension attacks but SHA-3 is not.
0
1
9
David Kahn's The Codebreakers is the classic book on classic cryptography.
Modern cryptography is radically different than classic cryptography.
1
4
9
In retrospect, the lack of encryption in the early internet seems naive.
The internet unleashed a lot of creativity, for good and for bad, and the latter showed the need for encryption.
0
3
9
How SSH port became 22
0
1
8
Darknet Diaries interview with NSA cryptologists
0
3
6
The most commonly used public key encryption systems depend on the difficulty of factoring integers or the difficulty of finding discrete logarithms.
0
0
6
Fermat’s factoring trick and cryptography
0
1
7
Zero Knowledge Proofs: An illustrated primer
0
0
7
BLAKE3 is a secure hash function that runs faster than SHA-1, SHA-2, and SHA-3.
0
2
7
AES (Advanced Encryption Standard) is a member of the Rijndael family of block ciphers.
AES is very popular, but there are comparable block ciphers in use, such as the Camellia cipher developed in Japan.
0
0
7
Methods of Symmetric Cryptanalysis by Dmitry Khovratovich
0
1
6
On One-way Functions and Kolmogorov Complexity
0
1
5
The PQC Migration Handbook
Guidelines for migrating to post-quantum cryptography
[pdf]
0
1
5
The diffusion property of a symmetric cipher says that changing one bit of the key should change about half the bits in the output.
0
0
6
What are the differences between .pem, .csr, .key, .crt and other such file extensions?
0
1
6
“Cryptography is a mixture of mathematics and muddle, and without the muddle the mathematics can be used against you.” — Ian Cassels
0
2
6
Attack of the week: Airdrop tracing
0
1
5
A tale of two elliptic curves
0
1
6
Sharing secrets using polynomials
0
0
6
A self-study course in block-cipher cryptanalysis
[pdf]
0
4
6
Coding theory is not cryptography. Coding theory is concerned with non-secret ways of encoding data, such as error correcting codes.
0
0
6
Preimage resistance is the property of a secure hash function that means it is impractical to start from a random hash value and produce a file with that hash value.
0
0
5
You won’t find much about cryptocurrency here, unless it’s about the cryptography it uses.
For example, Monero uses some interesting cryptography, and I may post about that.
2
1
5
Stream ciphers are essentially a one-time pad, except the pad is generated using a secure random number generator (CSPRNG).
0
2
5
Microsoft homomorphic encryption library
0
1
5
With DES encryption, if you flip all the bits in your message and all the bits in your key, you flip all the bits in the cipher text.
0
1
5
Module-Lattice-based Key-Encapsulation Mechanism Standard
[pdf]
0
0
5
In practice public key cryptography is not used to encrypt messages per se but rather to exchange symmetric encryption keys that are then used to encrypt messages.
0
1
4
What is proof-of-work?
0
1
3
Microsoft announced it will end support for RSA keys with less than 2048 bits.
1
0
4
Cryptanalysis challenge
The following message has been encrypted using a Playfair cipher
1
0
4
The discrete logarithm problem would be tractable given a large-scale quantum computer.
So schemes like Diffie-Hellman key exchange would be broken if and when quantum computing becomes practical.
0
1
3
Post-quantum Cryptography for the Go Ecosystem
0
0
3
When I start to write “crypto” I expand it to say “cryptography” unless it’s clear that I don’t mean “cryptocurrency.”
5
1
4
In addition to pure cryptography topics, this account will post on related infrastructure. For example, binary-to-text formats used with encryption.
1
1
4
Blum Blum Shub CSPRNG
0
0
4
pgpdump: a PGP packet visualizer
0
0
4
The ability to factor large numbers efficiently would be sufficient to break RSA encryption, but it may not be necessary.
1
0
4
New post: Detecting the language of encrypted text
0
1
4
STRONG encryption may not be sufficient for legal protection. Some laws require STANDARD encryption.
0
1
3
Is the future passwordless?
0
0
3
MD5 hash collision example
0
1
2
RSA encryption exponents are mostly all the same
0
0
3
Going back through the rotors in the opposite order gave the encryption system a group symmetry that Polish mathematicians were able to exploit to break the encryption.
1
0
3
There is a variation of RSA encryption that is provably as hard to break as factoring, i.e. if you can break this encryption you can factor large numbers. But AFAIK it has never been widely used.
0
0
3
Cryptographic Message Syntax (CMS)
0
0
3
Hybrid Public Key Encryption
0
0
3
Three applications of Euler’s theorem
0
3
2
We build X.509 chains so you don’t have to
0
2
3
TOQATCLFSPDIOMKCQNROCBSOALOTPDROGSHCFSLBTCTCSPZTIETLCQANOICROMUPTLCTITPGKSIEDPMCGRNKSPWHSEOSTRTLLSMNOCTCLRRULADCSNCQEPUTZHKONESOMCTLRLMAEMSAHOSKWFPDHTXLAEKSSIWPXSAEKSSILAHLFSTHRONAOCTLFIEKXSFKZRHSTLRTCTBXXRTCIXCIMLKLHBSHPAATCDSFCIHKCRATLAHBDAFSINRLRHPEARHSTLEIEMSEDNRLSN
0
0
3
Ring Signatures in Monero
0
0
3
Regression, modular arithmetic, and PQC
0
0
3
Generate 16 random bytes and display the result in hexidecimal: openssl rand -hex 16
0
1
3
New post: Security by obscurity
0
2
2
OK, I know what SHA and DES are, but what is IGN?
0
0
2
Source:
Polish Mathematicians Finding Patterns in Enigma Messages
by Chris Christensen
Mathematics Magazine, Oct., 2007, Vol. 80, No. 4, pp. 247-273
1
0
2
