
	Where results make sense

Topic: E2 (cipher)

	CS 4803 - David Pritchett [AES - Introduction]
		Cast-256 is a symmetric Feistel cipher that is an extension of the Cast-128 algorithm.
		E2 is a twelve round, symmetric Feistel cipher that encrypts in 128-bit blocks.
		FROG is an eight round, symmetric cipher that encrypts in 8-byte blocks.
	www.prism.gatech.edu /~gte043j/CS4803/3.html (1736 words)

	Camellia (cipher) (Site not responding. Last check: 2007-09-11)
		In cryptography, Camellia is a block cipher that has been evaluated favorably by several organisations, including the European Union's NESSIE project (a selected algorithm), and the Japanese CRYPTREC project (a recommended algorithm).
		The cipher was developed jointly by Mitsubishi and NTT in 2000, and has similar design elements to earlier block ciphers (E2 and MISTY1) from these companies.
		It is a Feistel cipher with either 18 rounds (if the key is 128 bits) or 24 rounds (if the key is 192 or 256 bits).
	www.encyclopedia-1.com /c/ca/camellia__cipher_.html (197 words)

	Patent 5651066: Cipher key distribution system effectively preventing illegitimate use and charging of enciphered ...
		Then, a key distribution signal containing the cipher key requested by the key request signal is transmitted from the key center to each user terminal, only when the legitimacy of the access from each user terminal is confirmed.
		A method of cipher key distribution in a system formed by a key center having a cipher key to be distributed and a plurality of user terminals connected with the key center through a public network, the method comprising the steps of:
		Here, it is noted that the secret key enciphering scheme is a scheme in which the cipher key and the decipher key are the same, whereas the public key enciphering scheme is a scheme in which the cipher key and the decipher key are different.
	www.freepatentsonline.com /5651066.html (5253 words)

	rfc3610 RFC (Site not responding. Last check: 2007-09-11)
		If the block cipher behaves like a random permutation, then the outputs are independent of each other, up to the insignificant limitation that they are all different.
		Security Considerations We claim that this block cipher mode is secure against attackers limited to 2^128 steps of operation if the key K is 256 bits or larger.
		There are fairly generic precomputation attacks against all block cipher modes that allow a meet-in-the-middle attack on the key K. If these attacks can be made, then the theoretical strength of this, and any other, block cipher mode is limited to 2^(n/2) where n is the number of bits in the key.
	www.netmoon.com /web/rfc/de/rfc3610.html (4677 words)

	[No title]
		E2 is a failed AES candidate, while Misty is one of the first symmetric ciphers with provable immunity against differential and linear cryptanalysis.
		Most popular hashes are based on a compression structure that is like a block cipher with surrounding feedforward logic, (where the message acts like the cipher's key).
		The speed of hash functions based on block ciphers is measured by the number of block encryptions required for a secure scheme (this number is the "rate").
	sky.fit.qut.edu.au /~maire/ISRC_abstracts.txt (1605 words)

	Report on AES2, Day 1
		Almost all candidates ciphers were stained one way or the other - and a surprising strong showing of Rijndael (in the negative sense that very little negative was said against it).
		He mentioned that if they were two AES ciphers and you used one bit of the key to chose one of them, then half the time you would use a less powerful cipher.
		Also if there should be a catastrophic failure with cipher A (a non zero probability), cipher B could be easily substituted just by fixing this one bit in the key.
	jya.com /aes2-day1.htm (3243 words)

	Cryptography-Digest Digest #276
		Frog-like ciphers do have this kind of problem: by putting some or most of the functional definition of the cipher within the key, the possibility exists that some of these functions will be weak.
		Also, several ciphers including Mars, E2 and Twofish (not to mention Frog) did include in their documentation at least some reasoning about their strength against unknown attacks.
		Safer+ is a mathematician's kind of cipher and its weakness were discovered in the key scheduler, precisely the place where math does not help a lot.
	www.mail-archive.com /cryptography-digest@senator-bedfellow.mit.edu/msg00093.html (4071 words)

	Resources
		Although block ciphers define how to encrypt a single block of plaintext, generally the algorithms do not discuss what to do about encrypting a sequence of blocks, or encrypting a block of data that is smaller than the algorithm's block size.
		Either the blocks are treated independently and the cipher is used on each block without reference to what has gone before, or the results of encrypting previous blocks affect the encryption of the current block.
		The cipher has a variable block and key length, and the authors have demonstrated how to extend the block length and key length by muliples of 32 bits.
	www.xidie.ro /resource.htm (5554 words)

	Standard Cryptographic Algorithm Naming
		Ciphers that have different key schedules, but are otherwise identical are given different names (for example, SAFER-K and SAFER-SK).
		The name of such a cipher is derived by adding "-Direct" to the standard name (except that if part of the name already specifies the key schedule, that part is dropped).
		If any such array is subsequently changed, the output of the cipher is undefined, unless the parameter is set again immediately (it is therefore the responsibility of the caller to make sure that a reference to this array is not accessible to untrusted code).
	www.users.zetnet.co.uk /hopwood/crypto/scan/cs.html (6436 words)

	E2BlockCipher (SeMoA API Documentation) (Site not responding. Last check: 2007-09-11)
		The modelling of this cipher is reported in [N].
		This method decrypts a single block of data, and may only be called, when the block cipher is in decrytion mode.
		This method encrypts a single block of data, and may only be called, when the block cipher is in encrytion mode.
	www.semoa.org /docs/api/cdc/standard/e2/E2BlockCipher.html (993 words)

	E2 cipher - Wikipedia, the free encyclopedia
		Look for E2 cipher in Wiktionary, our sister dictionary project.
		Look for E2 cipher in the Commons, our repository for free images, music, sound, and video.
		If you have created this page in the past few minutes and it has not yet appeared, it may not be visible due to a delay in updating the database.
	www.wikipedia.org /wiki/E2_cipher (103 words)

	ietf-sasl-rfc2831bis-06.txt
		For cipher "rc4-40" n is 5; for "rc4-56" n is 7; for the rest n is 16.
		The key for the "rc4-" and "aes-cbc" ciphers* is all 16 bytes of Kcc or Kcs.
		If the blocksize of the chosen cipher is not 1 byte, the padding prefix is one or more octets each containing the number of padding bytes, such that the total length of the encrypted part of the message is a multiple of the blocksize.
	www.potaroo.net /ietf/idref/draft-ietf-sasl-rfc2831bis (9455 words)

	Wikipedia:WikiProject Cryptography - Wikipedia, the free encyclopedia
		Cipher machines: ROCKEX, Lucida (machine), SIGTOT, SIGCUM, B-211 or B-21 (cryptography), OMI (machine), Siemens SFM T43, SA-1 (cryptography), C-35 / C-36, Portex, Noreen, Syko
		Stream ciphers: Rabbit (cipher), SOBER, SNOW (cipher), SCREAM (cipher), Leviathan (cipher), LILI-128, Self-shrinking generator, Correlation attack, Fast correlation attack, HBB
		/Cipher vs Cypher — a discussion of "cipher" and "cypher" spellings
	en.wikipedia.org /wiki/Wikipedia:WikiProject_Cryptography (1203 words)

	rfc3610
		CCM is only defined for use with 128-bit block ciphers, such as AES [AES].
		Sequential message numbers are also used to detect replay attacks and to detect message reordering, so in many situations (such as IPsec ESP [ESP]) the sequence numbers are already available.
		Test Vectors These test vectors use AES for the block cipher [AES].
	ietfreport.isoc.org /idref/rfc3610 (4677 words)

	[No title] (Site not responding. Last check: 2007-09-11)
		}}\nooverflow\faroman\ls1\rin0\lin283\itap0 {\b\f47=20 \'ce\'e1\'e5\'f1\'ef\'e5\'f7\'e8\'f2\'fc = \'ef\'f0\'e8\'ee\'f0\'e8\'f2\'e5\'f2 = \'f1\'f2\'f0\'f3\'ea\'f2\'f3\'f0\'ed\'fb\'f5 = \'ef\'f0\'e5\'ee\'e1\'f0\'e0\'e7\'ee\'e2\'e0\'ed\'e8\'e9 \'e2 = \'f1\'e8\'f1\'f2\'e5\'ec\'e5 \'c6\'ca\'d5 \'ed\'e0\'e4 \'f7\'e8\'f1 \'f2\'ee \'f4\'e8\'f1\'ea\'e0\'eb\'fc\'ed\'fb\'ec\'e8 = \'f6\'e5\'eb\'ff\'ec\'e8.=20 \par {\pntext\pard\plain\f47 \hich\af47\dbch\af0\loch\f47 3.
		}}\nooverflow\faroman\ls1\rin0\lin283\itap0 {\b\f47=20 \'ce\'e1\'e5\'f1\'ef\'e5\'f7\'e8\'f2\'fc = \'ea\'ee\'ed\'ea\'f3\'f0\'e5\'ed\'f6\'e8\'fe \'e2 = \'e4\'e5\'ff\'f2\'e5\'eb\'fc\'ed\'ee\'f1\'f2\'e8 = \'ea\'ee\'ec\'ec\'f3\'ed\'e0\'eb\'fc\'ed\'fb\'f5 \'f1\'eb\'f3\'e6\'e1.
		\'c4\'ee 2008 \'e3\'ee\'e4\'e0 = \'e7\'e0\'ef\'f0\'e5\'f9\'e0\'e5\'f2\'f1\'ff = \'ef\'f0\'e8\'e2\'e0\'f2\'e8\'e7\'e0\'f6\'e8\'ff = \'ef\'f0\'e5\'e4\'ef\'f0\'e8\'ff\'f2\'e8\'e9 \'e8 = \'ee\'f0\'e3\'e0\'ed\'e8\'e7\'e0\'f6\'e8\'e9 \'e6\'e8\'eb\'e8\'f9\'ed \'ee-\'ea\'ee\'ec\'ec\'f3\'ed\'e0\'eb\'fc\'ed\'ee\'e3\'ee = \'f5\'ee\'e7\'ff\'e9\'f1\'f2\'e2\'e0, \'e8\'ec\'e5\'fe\'f9\'e8\'e5 \'e2 = \'f1\'e2\'ee\'e5\'ec \'f0\'e0\'f1\'ef\'ee\'f0\'ff\'e6\'e5\'ed\'e8\'e8 = \'ee\'f1\'ed\'ee\'e2\'ed\'fb\'e5 \'ef\'f0\'ee\'e8\'e7 \'e2\'ee\'e4\'f1\'f2\'e2\'e5\'ed\'ed\'fb\'e5 \'f4\'ee\'ed\'e4\'fb, \'e0 = \'f2\'e0\'ea\'e6\'e5 = \'ef\'f0\'e5\'e4\'ee\'f1\'f2\'e0\'e2\'eb\'ff\'fe\'f9\'e8\'f5 \'ed\'e5 = \'ec\'e5\'ed\'e5\'e5 75% \'f3\'f1\'eb\'f3\'e3 \'ed\'e0 = \'e7\'e0\'ea\'f0\'e5\'ef\'eb\'e5\'ed \'ed\'ee\'e9 \'e7\'e0 \'ed\'e8\'ec\'e8 = \'f2\'e5\'f0\'f0\'e8\'f2\'ee\'f0\'e8\'e8.
	home.lipetsk.ru /~rabbit/10866-42168 (443 words)

	Dictionary of Meaning www.mauspfeil.net
		The cipher was developed jointly by Mitsubishi and Nippon Telegraph and Telephone NTT in 2000, and has similar design elements to earlier block ciphers (E2 (cipher) E2 and MISTY1) from these companies.
		Camellia has a block size (cryptography) block size of 128 bits, and can use 128-bit, 192-bit or 256-bit key (cryptography) keys — the same interface as the Advanced Encryption Standard.
		I thought E2 and Misty were companies until I hovered and checked the links.
	www.mauspfeil.net /Camellia_%28cipher%29.html (343 words)

	E2
		E2 Systems - Self-feeding drilling unit, Self-feeding drill...
		BENSC - E2 / Flat-Cone and Powder Diffractometer
		Competition - E2 / Grand Prix Slovakia 2004
	health.cancer-help.org /web/E2.html (52 words)

	[ FlexiProvider / what's new?]
		Since NTT no longer supports the adoption of the E2 cipher, we decided to drop it in the current release of the Core Provider.
		The block cipher SAFER++ (a NESSIE candidate) has been implemented and is available in the Core Provider.
		Bugs impairing the functionality of the Provider were found and fixed in the Asymmetric ECB, RSA PKCS #1 v1.5 and v2.1 cipher as well as in the RSA PKCS #1 v1.5 signature classes.
	www.informatik.tu-darmstadt.de /TI/Forschung/FlexiProvider/whatsnew.html (611 words)

	[No title]
		It calculates the patchpanel, displacements of cylinder coding and effects of reverse rotors, and reflecting rotor.
		Lauer also presents 10 cryptographic systems and representative cipher machines in increasing order of difficulty.
		He presents 72 references (including the Cipher A Deavours Enigma simulations) on disk.
	www.und.nodak.edu /org/crypto/crypto/lanaki.crypt.class/docs/german/german3.cipher (294 words)

	Optimized Software Implementations of E2 - Aoki, Ueda (ResearchIndex) (Site not responding. Last check: 2007-09-11)
		It is relatively easy to implement a byte-oriented cipher such as E2 on an 8-bit processor, but it is di#cult to implement it e#ciently on a 32-bit processor or a 64-bit processor.
		They are also applicable to other byte-oriented ciphers.
		1 A New 128-bit Block Cipher E (context) - Kanda, Moriai et al.
	citeseer.ist.psu.edu /261315.html (456 words)

	Algorithms and Attacks (Site not responding. Last check: 2007-09-11)
		Breaking a cipher simply means finding a weakness in the cipher that can be exploited with a complexity less than brute-force.
		The concepts and design principles of block ciphers are explained, particularly the class of block ciphers known as Feistel ciphers.
		Some modern block cipher cryptanalysis methods are demonstrated by applying them to variants of a weak Feistel cipher called Simplified TEA (STEA), which is based on the Tiny Encryption Algorithm(TEA).
	members.aol.com /jpeschel/algoritak.htm (636 words)

	[No title]
		CCM is defined for use with 128-bit block ciphers, such as AES.
		However, the CCM design principles can easily be applied to other block sizes, but these modes will require their own specifications.
		That is, the implementation does not have to complete calculation of the message authentication code before encryption can begin.
	nwps.ws /pub/RFC/draft-housley-ccm-mode-01.txt (3111 words)

	RFC 3610 (Site not responding. Last check: 2007-09-11)
		Counter with CBC-MAC (CCM) is a generic authenticated encryption block cipher mode.
		To preserve security, implementations need to limit the total amount of data that is encrypted with a single key; the total number of block cipher encryption operations in the CBC-MAC and encryption together cannot exceed 2^61.
		We claim that this block cipher mode is secure against attackers limited to 2^128 steps of operation if the key K is 256 bits or larger.
	asg.web.cmu.edu /rfc/rfc3610.html (4306 words)

	RFC 3610 (rfc3610) - Counter with CBC-MAC (CCM)
		The inputs are summarized as: Name Description Size ---- ----------------------------------- ----------------------- K Block cipher key Depends on block cipher N Nonce 15-L octets m Message to authenticate and encrypt l(m) octets a Additional authenticated data l(a) octets 2.2.
		If needed, the ciphertext is truncated to give T. Encryption To encrypt the message data we use Counter (CTR) mode.
		However, in almost all environments, message or packet lengths are known in advance.
	www.faqs.org /rfcs/rfc3610.html (3399 words)

	Data Security and Cryptography
		and while there have been some discussions of possible improvements, they mostly represent ways of making the cipher more robust despite smaller numbers of "rounds" of the algorithm, the point being to make it run faster without losing security.
		This has the advantage that the algorithms become "moving targets" unlike the relatively static ciphers commonly in use.
		There were originally links to virtually all of the proposals; many have since "aged" off the list, and as Rijndael "won" the competition, others are of somewhat diminished interest.
	cbbrowne.com /info/cryptosecurity.html (1080 words)

	[No title] (Site not responding. Last check: 2007-09-11)
		* Since NTT no longer supports the adoption of the E2 cipher, we decided to drop it in the current release of the Core Provider.
		This resulted in a higher throughput for these ciphers.
		As numerous bugs have been fixed we recommend users of the cdcProvider upgrade to the latest version of the FlexiProvider as soon as possible.
	www.cdc.informatik.tu-darmstadt.de /pipermail/cdcprovider-announce/2002.txt (331 words)

	Camellia - A 128-bit Block Cipher (ResearchIndex) (Site not responding. Last check: 2007-09-11)
		Abstract: In this paper, we propose a 128-bit block cipher Camellia, with a key size of 128/192/256-bits.
		Camellia is an 18-round Feistel cipher for 128-bit keys, and 24-round for 192/256-bit keys.
		In Camellia, the round function uses the SPN structure, and additional FL/FL -1 -functions are inserted every 6 rounds.
	citeseer.lcs.mit.edu /331319.html (285 words)

	[No title]
		The CBC-MAC is Housley Expires July 2003 [Page 4] Internet-Draft CCM Mode January 2003 computed by: X_1 := E(K, B_0) X_i+1 := E(K, X_i XOR B_i) for i=1,..., n T := first-M-bytes(X_n+1) where E() is the block cipher encryption function, and T is the MAC value.
		Even Housley Expires July 2003 [Page 9] Internet-Draft CCM Mode January 2003 if there is a collision, these values only affect T, which is encrypted so that an attacker cannot deduce any information, or detect any collision.
		The authentication processing requires the message length to be known at the beginning of the operation, which makes one-pass processing difficult in some environments.
	www.math.utah.edu /ftp/pub/mirrors/ftp.ietf.org/internet-drafts/draft-housley-ccm-mode-02.txt (3186 words)

	The Block Cipher Lounge - AES
		If you have some attacks on some of the ciphers here, or if you have comments to this page, please contact Lars or Vincent (see links below).
		Burwick, Coppersmith, D'Avignon, Gennaro, Halevi, Jutla, Matyas Jr., O'Connor, Peyravian, Safford, Zunic: MARS - a candidate cipher for AES
		Matsui, T. Tokita: "Cryptanalysis of a reduced version of the block cipher E2", FSE'99, LNCS.
	www.mat.dtu.dk /people/Lars.R.Knudsen/aes.html (438 words)

	Encyclopedia: Camellia (cipher)
		Updated 193 days 11 hours 8 minutes ago.
		Camellia has a block size of 128 bits, and can use 128-bit, 192-bit or 256-bit keys — the same interface as the Advanced Encryption Standard.
		The cipher also uses input and output key whitening.
	www.nationmaster.com /encyclopedia/Camellia-(cipher) (238 words)

	LinuxDig.com Request for Comments RFC#: 3610 : Counter with CBC-MAC (CCM).
		cipher behaves as a pseudo-random permutation, then the key stream is
		chance of success if the block cipher is a pseudo-random permutation.
		CBC IV out:B3 26 49 FF D5 9F 56 0F 02 2D 11 E2 62 C5 BE EA After xor: B3 2E E3 93 2F A9 9C E7 69 6D 11 E2 62 C5 BE EA [hdr]
	www.linuxdig.com /rfc/individual/3610.php (10224 words)

Try your search on: Qwika (all wikis)