Page History

	Version	Published	Changed By	Comment	Actions
	CURRENT (v. 50)	Dec 06, 2017 17:48	Valerie Vogel
	v. 49	Dec 05, 2017 22:43	Valerie Vogel
	v. 48	Sep 13, 2017 21:45	Valerie Vogel
	v. 47	Oct 25, 2016 15:46	Valerie Vogel
	v. 46	Sep 14, 2016 18:33	Valerie Vogel
	v. 45	Sep 12, 2016 17:28	Valerie Vogel
	v. 44	Sep 12, 2016 17:26	Valerie Vogel
	v. 43	Sep 12, 2016 16:47	Valerie Vogel
	v. 42	Sep 12, 2016 16:44	Valerie Vogel
	v. 41	Sep 12, 2016 16:25	Valerie Vogel
	v. 40	Apr 28, 2015 20:08	Valerie Vogel
	v. 39	Apr 28, 2015 19:52	Valerie Vogel
	v. 38	Mar 13, 2015 22:38	Valerie Vogel
	v. 37	Mar 13, 2015 22:37	Valerie Vogel
	v. 36	Feb 13, 2015 00:40	Valerie Vogel
	v. 35	Feb 13, 2015 00:38	Valerie Vogel
	v. 34	Aug 22, 2014 16:36	Unknown User (wole)	Migrated to Confluence 4.0
	v. 33	Aug 22, 2014 16:36	Unknown User (wole)
	v. 32	Aug 22, 2014 14:12	Unknown User (wole)
	v. 31	Aug 22, 2014 14:11	Unknown User (wole)
	v. 30	Aug 21, 2014 20:19	Unknown User (wole)
	v. 29	Aug 21, 2014 20:01	Unknown User (wole)
	v. 28	Jul 30, 2014 00:27	Unknown User (wole)
	v. 27	Jul 30, 2014 00:14	Unknown User (wole)
	v. 26	Jul 30, 2014 00:14	Unknown User (wole)
	v. 25	Jul 27, 2014 23:48	Unknown User (wole)
	v. 24	May 22, 2014 12:37	vvogel@educause.edu
	v. 23	May 22, 2014 12:27	vvogel@educause.edu
	v. 22	Apr 30, 2014 11:53	vvogel@educause.edu
	v. 21	Apr 30, 2014 11:52	vvogel@educause.edu
	v. 20	Apr 30, 2014 11:50	vvogel@educause.edu
	v. 19	Apr 30, 2014 07:13	Unknown User (wole)
	v. 18	Apr 30, 2014 07:10	Unknown User (wole)
	v. 17	Apr 28, 2014 01:43	Unknown User (wole)
	v. 16	Apr 23, 2014 18:12	vvogel@educause.edu
	v. 15	Apr 22, 2014 14:08	Unknown User (wole)
	v. 14	Apr 22, 2014 14:03	Unknown User (wole)	Cryptography: The art of secret writing underpins many of the controls used in computer and communication systems to achieve the various requirements for data and communication security and privacy; confidentiality, integrity, and availability. Cryptographic protocol usually require the use of cryptographic keys which may be shared, and are used in encryption protocols to encrypt data and or communication channels, and also to decrypt encrypted data or communication channels. Cryptographic protocols are typically measured by the effective length of the cryptographic keys. Prior to the early 1980s and the widespread use of public key cryptography, the same cryptographic key is usually used for both encryption and decryption of data. This creates challenge for key exchange necessary for practical applications from military use to banking. With the advent of public key cryptography, and the elegant solution of key exchange using RSA, and later various other protocols, secure data communication has become tremendously easier, benefiting the explosive growth of the internet and its application in many industry including in higher education. However, as cryptographic protocols gain more currency, defeating them has become more lucrative for attackers who will benefit from gaining unauthorized access to information ranging from personal PHIs, PHIs and other private data, as well as organization and government secret. The strength of cryptographic protocols, defined in terms of the equivalent synchronous cryptography protocol key strength is a measure of the level of difficulty in deciphering an encrypted text, without first gaining access to the key. The most common approach to breaking cryptographic protocols, or cryptanalysis is by use of brute force. This technique relies on the number of trials that can be conducted in a given amount of time, and the sample space of the key, which is a measure of the number of bits of the equivalent synchronous key. Today, given the advances in computing and cryptanalysis techniques, 128 bit is considered a floor for cryptographic key strengths and 256 bits is usually considered acceptable. Cryptographic standards are designed to optimize encryption, while making brute force attack the only likely attack that can break an encryption system, also making sure that brute force attack is expensive, in terms of how long it will take to exhaust a given key space. For example, AES-128 has a key space of 2^(128) bits or 3.4x10^(14).
	v. 13	Apr 15, 2014 08:40	Unknown User (wole)
	v. 12	Apr 14, 2014 21:55	Unknown User (wole)
	v. 11	Apr 09, 2014 20:02	vvogel@educause.edu
	v. 10	Apr 09, 2014 14:42	vvogel@educause.edu
	v. 9	Apr 09, 2014 14:36	vvogel@educause.edu
	v. 8	Apr 09, 2014 14:33	vvogel@educause.edu
	v. 7	Apr 09, 2014 14:33	vvogel@educause.edu
	v. 6	Apr 03, 2014 16:19	Mary Dunker
	v. 5	Apr 02, 2014 19:50	vvogel@educause.edu
	v. 4	Mar 07, 2014 18:47	vvogel@educause.edu
	v. 3	Mar 05, 2014 17:59	vvogel@educause.edu
	v. 2	Jan 21, 2014 18:53	vvogel@educause.edu
	v. 1	Jan 21, 2014 18:49	vvogel@educause.edu

Return to Page Information