Cryptography - Revision history

Pbug: /* One way hashing */ bitcoin

2018-12-28T08:40:15Z

One way hashing: bitcoin

← Older revision		Revision as of 01:40, 28 December 2018
Line 45:		Line 45:

	[[One way hash]]ing wasn't confined to just passwords. With the [[md5]] and [[SHA]], as well as the [[rmd160]] commands one can make a cryptographic hash sum (or fingerprint) of a file or text in the system. For example, if you want to ensure a file or directory has not been altered, you can print the checksum onto read-only media (i.e. paper/burn onto a cd). Whenever you run the checksum program against the same file or directory, you should get the same results unless something has been altered. If this topic interests you, [http://sourceforge.net/projects/tripwire/ tripwire] is popular software you'll want to read more about.		[[One way hash]]ing wasn't confined to just passwords. With the [[md5]] and [[SHA]], as well as the [[rmd160]] commands one can make a cryptographic hash sum (or fingerprint) of a file or text in the system. For example, if you want to ensure a file or directory has not been altered, you can print the checksum onto read-only media (i.e. paper/burn onto a cd). Whenever you run the checksum program against the same file or directory, you should get the same results unless something has been altered. If this topic interests you, [http://sourceforge.net/projects/tripwire/ tripwire] is popular software you'll want to read more about.

			Bitcoin uses one way hashing. The hash method they use is SHA256. Perhaps bitcoin was made by the NSA in order to let the "market" find fast hardware hashers in order to break SHA256 in a large setup (Just my opinion).

	=== MAC / HMAC ===		=== MAC / HMAC ===

Pbug: /* Post-Quantum Cryptography */ it's 2 years later (still) happy new year 2019

2018-12-28T08:25:25Z

Post-Quantum Cryptography: it's 2 years later (still) happy new year 2019

← Older revision		Revision as of 01:25, 28 December 2018
Line 136:		Line 136:
	=== Post-Quantum Cryptography ===		=== Post-Quantum Cryptography ===

	Recently standards bodies in the US have called for post-quantum cryptography to be implemented. This is what we understand is an attempt to be able to encipher data, on classic computers, that can withstand an attack performed by a quantum computer. I think the goal is to have a few decades worth of crypt-strength so that medium-long term secrets can be kept secret. This is very new stuff to be writing about so forgive us if we make mistakes. We aren't at the forefront of using quantum computers anyhow which still cost a few million dollars for a D-WAVE system. Google is ~~said to be building~~ a quantum computer ~~based on ideas gained from D~~-~~WAVE systems and they are about 2 years away~~ (time of writing ~~2016~~).		Recently standards bodies in the US have called for post-quantum cryptography to be implemented. This is what we understand is an attempt to be able to encipher data, on classic computers, that can withstand an attack performed by a quantum computer. I think the goal is to have a few decades worth of crypt-strength so that medium-long term secrets can be kept secret. This is very new stuff to be writing about so forgive us if we make mistakes. We aren't at the forefront of using quantum computers anyhow which still cost a few million dollars for a D-WAVE system. Currently since 2018 there have been three major Quantum Computer makers and the reports and hype around these has died down a little. These forementioned are IBM, Google and Intel, who have quantum computers with 50, 72 and 49 qubits (respectively). Judging by D-WAVE quantum annealers' price these could cost between 20 million and 50 million dollars to make. The key marketing term is "quantum supremacy" when a quantum computer is able to leave classical computers behind in terms of processing power.

			The first Post-Quantum Informational RFC came out in May 2018, as RFC 8391 (XMSS). As companies try to break RSA (Shor's algorithm) this may become more important. I don't know of any implementations in open source which use XMSS yet (time of writing 2019).

			In Europe. ZITIS (german government cracker) announced they would purchase an IBM quantum computer to break RSA. Either this is FUD or these machines are capable of such a thing. We don't know for sure. A 100 qubit Quantum computer is planned to be made in Europe under a consortium of Universities and Institutes.

	=== Random Numbers ===		=== Random Numbers ===

Pbug: /* Cryptography found in UNIX */

2016-06-04T17:35:42Z

Cryptography found in UNIX

← Older revision		Revision as of 10:35, 4 June 2016
Line 5:		Line 5:

	[[UBO]]'s over the decades have been attacked with great effort. [[UBO]]'s therefore use all cryptography methods known in order to defend against attack. Some methods are weaker due to weak protocols than other methods. We'll try to list as much as possible here, but without researching these "teasers" you'll likely not understand them all.		[[UBO]]'s over the decades have been attacked with great effort. [[UBO]]'s therefore use all cryptography methods known in order to defend against attack. Some methods are weaker due to weak protocols than other methods. We'll try to list as much as possible here, but without researching these "teasers" you'll likely not understand them all.


			=== Cryptography found on the Internet ===

			At first the Internet was a plaintext organism. As time progressed more parts were encrypted or digitally signed.

			* DNSSEC (DNS security involving signing resource records with assymetric encryption)
			* IPSEC (layer 3 security)
			* TLS (application layer security)
			* SSH (Secure Shell)

			In 2016 it's hard to fathom doing business on unencrypted sites on the Internet.

	=== One way hashing ===		=== One way hashing ===

Pbug: /* Random Numbers */

2016-06-04T17:20:20Z

Random Numbers

← Older revision		Revision as of 10:20, 4 June 2016
Line 128:		Line 128:
	=== Random Numbers ===		=== Random Numbers ===

	Random Numbers in cryptography are important. Pretend you have a Symmetric/Assymetric hybrid program (could be TLS or SSH) that exchange a secret session key. This session key is often made with an OS's Pseudo-Random-Number-Generator (PRNG). If the random numbers are predictable in any form the encryption is weakened and crackable by someone who can guess the random number. Since computers are predictable machines (they have to be in order to perform the same for any program) it's very hard to get randomness right. OS's try all sorts of tricks to find numerous sources of [[entropy]] that they can combine. They often also try to cryptographically scramble a random number. This could be done by encrypting a pool of random numbers and forgetting/throwing away the key.		Random Numbers in cryptography are important. Pretend you have a Symmetric/Assymetric hybrid program (could be TLS or SSH) that exchange a secret session key. This session key is often made with an OS's Pseudo-Random-Number-Generator (PRNG). If the random numbers are predictable in any form the encryption is weakened and crackable by someone who can guess the random number. Since computers are predictable machines (they have to be in order to perform the same for any program) it's very hard to get randomness right. OS's try all sorts of tricks to find numerous sources of [[entropy]] that they can combine. They often also try to cryptographically scramble a random number. This could be done by encrypting a pool of random numbers and forgetting/throwing away the (random) key.

	Random numbers are also used in [https://en.wikipedia.org/wiki/Merkle%27s_Puzzles Merkle's puzzles].		Random numbers are also used in [https://en.wikipedia.org/wiki/Merkle%27s_Puzzles Merkle's puzzles].

Pbug: /* Random Numbers */

2016-06-04T17:16:21Z

Random Numbers

← Older revision		Revision as of 10:16, 4 June 2016
Line 129:		Line 129:

	Random Numbers in cryptography are important. Pretend you have a Symmetric/Assymetric hybrid program (could be TLS or SSH) that exchange a secret session key. This session key is often made with an OS's Pseudo-Random-Number-Generator (PRNG). If the random numbers are predictable in any form the encryption is weakened and crackable by someone who can guess the random number. Since computers are predictable machines (they have to be in order to perform the same for any program) it's very hard to get randomness right. OS's try all sorts of tricks to find numerous sources of [[entropy]] that they can combine. They often also try to cryptographically scramble a random number. This could be done by encrypting a pool of random numbers and forgetting/throwing away the key.		Random Numbers in cryptography are important. Pretend you have a Symmetric/Assymetric hybrid program (could be TLS or SSH) that exchange a secret session key. This session key is often made with an OS's Pseudo-Random-Number-Generator (PRNG). If the random numbers are predictable in any form the encryption is weakened and crackable by someone who can guess the random number. Since computers are predictable machines (they have to be in order to perform the same for any program) it's very hard to get randomness right. OS's try all sorts of tricks to find numerous sources of [[entropy]] that they can combine. They often also try to cryptographically scramble a random number. This could be done by encrypting a pool of random numbers and forgetting/throwing away the key.

			Random numbers are also used in [https://en.wikipedia.org/wiki/Merkle%27s_Puzzles Merkle's puzzles].

Pbug: /* Post-Quantum Cryptography */

2016-06-04T16:36:11Z

Post-Quantum Cryptography

← Older revision		Revision as of 09:36, 4 June 2016
Line 124:		Line 124:
	=== Post-Quantum Cryptography ===		=== Post-Quantum Cryptography ===

	Recently standards bodies in the US have called for post-quantum cryptography to be implemented. This is what we understand is an attempt to be able to encipher, on classic computers, that can withstand an attack performed by a quantum computer. I think the goal is to have a few decades worth of crypt-strength so that medium-long term secrets can be kept secret. This is very new stuff to be writing about so forgive us if we make mistakes. We aren't at the forefront of using quantum computers anyhow which still cost a few million dollars for a D-WAVE system. Google is said to be building a quantum computer based on ideas gained from D-WAVE systems and they are about 2 years away (time of writing 2016).		Recently standards bodies in the US have called for post-quantum cryptography to be implemented. This is what we understand is an attempt to be able to encipher data, on classic computers, that can withstand an attack performed by a quantum computer. I think the goal is to have a few decades worth of crypt-strength so that medium-long term secrets can be kept secret. This is very new stuff to be writing about so forgive us if we make mistakes. We aren't at the forefront of using quantum computers anyhow which still cost a few million dollars for a D-WAVE system. Google is said to be building a quantum computer based on ideas gained from D-WAVE systems and they are about 2 years away (time of writing 2016).


	=== Random Numbers ===		=== Random Numbers ===

	Random Numbers in cryptography are important. Pretend you have a Symmetric/Assymetric hybrid program (could be TLS or SSH) that exchange a secret session key. This session key is often made with an OS's Pseudo-Random-Number-Generator (PRNG). If the random numbers are predictable in any form the encryption is weakened and crackable by someone who can guess the random number. Since computers are predictable machines (they have to be in order to perform the same for any program) it's very hard to get randomness right. OS's try all sorts of tricks to find numerous sources of [[entropy]] that they can combine. They often also try to cryptographically scramble a random number. This could be done by encrypting a pool of random numbers and forgetting/throwing away the key.		Random Numbers in cryptography are important. Pretend you have a Symmetric/Assymetric hybrid program (could be TLS or SSH) that exchange a secret session key. This session key is often made with an OS's Pseudo-Random-Number-Generator (PRNG). If the random numbers are predictable in any form the encryption is weakened and crackable by someone who can guess the random number. Since computers are predictable machines (they have to be in order to perform the same for any program) it's very hard to get randomness right. OS's try all sorts of tricks to find numerous sources of [[entropy]] that they can combine. They often also try to cryptographically scramble a random number. This could be done by encrypting a pool of random numbers and forgetting/throwing away the key.

Pbug: /* Post-Quantum Cryptography */ random numbers

2016-06-04T16:28:36Z

Post-Quantum Cryptography: random numbers

← Older revision		Revision as of 09:28, 4 June 2016
Line 125:		Line 125:

	Recently standards bodies in the US have called for post-quantum cryptography to be implemented. This is what we understand is an attempt to be able to encipher, on classic computers, that can withstand an attack performed by a quantum computer. I think the goal is to have a few decades worth of crypt-strength so that medium-long term secrets can be kept secret. This is very new stuff to be writing about so forgive us if we make mistakes. We aren't at the forefront of using quantum computers anyhow which still cost a few million dollars for a D-WAVE system. Google is said to be building a quantum computer based on ideas gained from D-WAVE systems and they are about 2 years away (time of writing 2016).		Recently standards bodies in the US have called for post-quantum cryptography to be implemented. This is what we understand is an attempt to be able to encipher, on classic computers, that can withstand an attack performed by a quantum computer. I think the goal is to have a few decades worth of crypt-strength so that medium-long term secrets can be kept secret. This is very new stuff to be writing about so forgive us if we make mistakes. We aren't at the forefront of using quantum computers anyhow which still cost a few million dollars for a D-WAVE system. Google is said to be building a quantum computer based on ideas gained from D-WAVE systems and they are about 2 years away (time of writing 2016).


			=== Random Numbers ===

			Random Numbers in cryptography are important. Pretend you have a Symmetric/Assymetric hybrid program (could be TLS or SSH) that exchange a secret session key. This session key is often made with an OS's Pseudo-Random-Number-Generator (PRNG). If the random numbers are predictable in any form the encryption is weakened and crackable by someone who can guess the random number. Since computers are predictable machines (they have to be in order to perform the same for any program) it's very hard to get randomness right. OS's try all sorts of tricks to find numerous sources of [[entropy]] that they can combine. They often also try to cryptographically scramble a random number. This could be done by encrypting a pool of random numbers and forgetting/throwing away the key.

Pbug: /* One way hashing */

2016-06-04T15:49:20Z

One way hashing

← Older revision		Revision as of 08:49, 4 June 2016
Line 20:		Line 20:
	\| amd64 3500+ \|\| OpenBSD \|\| 2005 \|\| Blowfish 12 rounds \|\| 1 \|\| 2		\| amd64 3500+ \|\| OpenBSD \|\| 2005 \|\| Blowfish 12 rounds \|\| 1 \|\| 2
	\|-		\|-
	\| Xeon E3-~~1275~~ \|\| OpenBSD \|\| 2016 \|\| UNIX crypt() \|\| 1 \|\| 313,921		\| Xeon E3-1275v3 \|\| OpenBSD \|\| 2016 \|\| UNIX crypt() \|\| 1 \|\| 313,921
	\|-		\|-
	\| Xeon E3-~~1275~~ \|\| OpenBSD \|\| 2016 \|\| MD5 ($1$ salt) \|\| 1 \|\| 12,869,871 (?)		\| Xeon E3-1275v3 \|\| OpenBSD \|\| 2016 \|\| MD5 ($1$ salt) \|\| 1 \|\| 12,869,871 (?)
	\|-		\|-
	\| Xeon E3-~~1275~~ \|\| OpenBSD \|\| 2016 \|\| MD5 (openssl) \|\| 1 \|\| 5,457,752		\| Xeon E3-1275v3 \|\| OpenBSD \|\| 2016 \|\| MD5 (openssl) \|\| 1 \|\| 5,457,752
	\|-		\|-
	\| Xeon E3-~~1275~~ \|\| OpenBSD \|\| 2016 \|\| Blowfish 12 rounds \|\| 1 \|\| 3		\| Xeon E3-1275v3 \|\| OpenBSD \|\| 2016 \|\| Blowfish 12 rounds \|\| 1 \|\| 3
	\|}		\|}

Pbug: /* One way hashing */

2016-06-04T15:43:47Z

One way hashing

← Older revision		Revision as of 08:43, 4 June 2016
Line 22:		Line 22:
	\| Xeon E3-1275 \|\| OpenBSD \|\| 2016 \|\| UNIX crypt() \|\| 1 \|\| 313,921		\| Xeon E3-1275 \|\| OpenBSD \|\| 2016 \|\| UNIX crypt() \|\| 1 \|\| 313,921
	\|-		\|-
	\| Xeon E3-1275 \|\| OpenBSD \|\| 2016 \|\| MD5 \|\| 1 \|\| 12,869,871 (?)		\| Xeon E3-1275 \|\| OpenBSD \|\| 2016 \|\| MD5 ($1$ salt) \|\| 1 \|\| 12,869,871 (?)
	\|-		\|-
	\| Xeon E3-1275 \|\| OpenBSD \|\| 2016 \|\| MD5 (openssl) \|\| 1 \|\| 5,457,752		\| Xeon E3-1275 \|\| OpenBSD \|\| 2016 \|\| MD5 (openssl) \|\| 1 \|\| 5,457,752

Pbug: /* One way hashing */

2016-06-04T15:42:46Z

One way hashing

← Older revision		Revision as of 08:42, 4 June 2016
Line 7:		Line 7:

	=== One way hashing ===		=== One way hashing ===
	UNIX programmers implemented a [[One way hash]] of [[DES]] to "encrypt" [[password]]s as part of the crypt(3) function. It was impossible to decrypt these [[password]]s since they were a modified version of DES, so in order to know if someone had the right [[password]] the plain text would be encrypted and the result compared with the hash of the password database. If they matched, a user would be granted access. As computers became faster so did the speed at which DES would be cracked. An amd64 3500+ running [[OpenBSD]] using the systems crypt(3) functions can hash 121,000 [[password]]s in 1 second in 2005.		UNIX programmers implemented a [[One way hash]] of [[DES]] to "encrypt" [[password]]s as part of the crypt(3) function. It was impossible to decrypt these [[password]]s since they were a modified version of DES, so in order to know if someone had the right [[password]] the plain text would be encrypted and the result compared with the hash of the password database. If they matched, a user would be granted access. As computers became faster so did the speed at which DES would be cracked. An amd64 3500+ running [[OpenBSD]] using the systems crypt(3) functions can hash 121,000 [[password]]s in 1 second in 2005. The following graph tries to give a comparison of 2 computers over time, but we lost the original benchmark program so it's not a fair comparison:

	{\| class="wikitable" style="margin: 1em auto 1em auto"		{\| class="wikitable" style="margin: 1em auto 1em auto"