
	Where results make sense

Topic: Serpent (cipher)

Related Topics

Serpent encryption algorithm

AES contest

Block cipher

Rijndael

Blowfish (cipher)

Feistel cipher

GOST

Block cipher modes of operation

Advanced Encryption Standard

Avalanche effect

Twofish

Advanced Encryption Standard process

Symmetric key

	Serpent (cipher) - Wikipedia, the free encyclopedia
		The cipher is a 32-round substitution-permutation network operating on a block of four 32-bit words.
		Serpent was designed so that all operations can be executed in parallel, using 32 1-bit slices.
		Serpent was widely viewed as taking a more conservative approach to security than the other AES finalists, opting for a larger security margin: the designers deemed 16 rounds to be sufficient against known types of attack, but specified 32 rounds as insurance against future discoveries in cryptanalysis.
	en.wikipedia.org /wiki/Serpent_(cipher) (245 words)

	Strong Encryption Package, Serpent
		Serpent was designed by Ross Anderson, Eli Biham and Lars Knudsen as a candidate for the Advanced Encryption Standard.
		This iteration of the algorithm was called Serpent 0 and used the original DES S-boxes.
		Serpent is a 128-bit block cipher, meaning that data is encrypted and decrypted in 128-bit chunks.
	www.tropsoft.com /strongenc/serpent.htm (1124 words)

	DAG: perl-Crypt-Serpent RPM packages for Red Hat/Fedora
		Serpent is faster than DES and more secure than Triple DES.
		This means that Serpent should be safe against as yet unknown attacks that may be capable of breaking the standard 16 rounds used in many types of encryption today.
		However, the fact that Serpent uses so many rounds means that it is the slowest of the five AES finalists.
	dag.wieers.com /packages/perl-Crypt-Serpent/?S=D (322 words)

	a/crypto-patch (Site not responding. Last check: 2007-10-06)
		Serpent provides users with the highest practical level of assurance that no shortcut attack will be found.
		Serpent is completely in the public domain, and no restrictions are imposed on its use.
		More information about Serpent: http://www.cl.cam.ac.uk/~rja14/serpent.html More information about the implementation: http://www.seven77.demon.co.uk/crypto_technology.htm On the ftp-site, the directory /pub/linux/kernel is a normal kernel-mirror while /pub/linux/kerneli is a kernel-mirror plus the international kernel patch.
	lwn.net /1998/1015/a/crypto-patch.html (413 words)

	NetDrive Cipher: Blueprint Software Works
		Cipher plugin is a dynamic loadable library that used by NetDrive for OS/2 for transparent data encryption/decryption.
		Cipher plugin allows you to create protected disks and folders within NetDrive File System and to use the data stored on those disks and folders as if it was ordinary data on an ordinary OS/2 storage device.
		Cipher plugin supports long names for both files and directories and has one side effect - if you mount FAT disk or diskette as a secure resource you will be able to save files and directories with long names there despite they aren't supported by such file systems.
	www.blueprintsoftwareworks.com /netdrive/cipher.html (1497 words)

	Serpent (GNU cryptographic primitives and tools, version 2.0.0)
		Serpent is a 32-round substitution-permutation network block cipher, operating on 128-bit blocks and accepting keys of 128, 192, and 256 bits in length.
		Serpent was designed by Ross Anderson, Eli Biham, and Lars Knudsen as a proposed cipher for the Advanced Encryption Standard.
		Serpent can be sped up greatly by replacing S-box substitution with a sequence of binary operations, and the optimal implementation depends upon finding the fastest sequence of binary operations that reproduce this substitution.
	www.gnu.org /software/gnu-crypto/manual/api/gnu/crypto/cipher/Serpent.html (368 words)

	Roxen Community: RFC 4344 The Secure Shell (SSH) Transport Layer Encryption Modes (Standards Track)
		Note that, depending on the block length of the underlying block cipher and the length of the encrypted packets, the first recommendation may supersede the second recommendation, or vice versa.
		Because of a birthday property of block ciphers and some modes of operation, implementations must be careful not to encrypt too many blocks with the same encryption key.
		The label -ctr indicates that the block cipher is to be used in "stateful-decryption counter" (SDCTR) mode.
	community.roxen.com /developers/idocs/rfc/rfc4344.html (2823 words)

	Serpent (Site not responding. Last check: 2007-10-06)
		Serpent was selected as one of the 5 AES finalists
		Serpent is now completely in the public domain, and we impose no restrictions on its use.
		This was announced on the 21st August 1998 at the AES conference.
	www.cs.technion.ac.il /~biham/Reports/Serpent (288 words)

	Cipher - Dex Wiki
		The deities decreed that the name CIPHER shall pass from the realms of men and be forgotten in the mists of time.
		Whereas, before The Grey Council (as the Cipher leadership was known then) had been used to supreme power they were rendered powerless by their arduous journey.
		The serpent once again slithered to the deepest pit to watch the bloodshed above for all eternity, and the lands of Loftenwood were made brighter by his absence.
	www.dungeoneternal.com /wiki/index.php/Cipher (4504 words)

	[No title]
		Moreover, the first cipher broken was Serpent: the cipher universally considered to be the safest, most conservative choice.
		Cipher key lengths have gotten so long that attacks simply can't be implemented; their complexity is just too great.
		During the AES process, everyone agreed that Rijndael was the risky choice, Serpent was the conservative choice, and Twofish was in the middle.
	www.chez.com /winterminator/AES.txt (1265 words)

	RFC 4344 - The Secure Shell (SSH) Transport Layer Encryption Modes
		Second Rekeying Recommendation Because of a birthday property of block ciphers and some modes of operation, implementations must be careful not to encrypt too many blocks with the same encryption key.
		Further recall that the total length of the concatenation of the packet length, padding length, payload, and padding MUST be a multiple of the cipher's block size when the cipher's block size is greater than or equal to 8 bytes (which is the case for all of the following methods).
		The stateful-decryption counter mode methods in Section 4 are, however, the preferred alternatives to the insecure methods in [RFC4253] because stateful-decryption counter mode is the most efficient (in terms of both network consumption and the number of required cryptographic operations per packet).
	www.packetizer.com /rfc/rfc4344 (2949 words)

	Dr. Dobb's \| Encryption Using Crypt::CBC \| February 1, 2004
		Using a block cipher, data to be encrypted (also called plaintext) is first divided in chunks (or blocks) of equal sizes.
		In the figure, assuming that the underlying block cipher has a block size of 64 bits (8 bytes), the partial block (consisting of five blue squares) is extended by padding it with three ASCII 0x03 characters.
		For block ciphers with key sizes less than 128 bits (DES, for example, uses only 64 bits), the hashes of their keys are just truncated to the required lengths.
	www.ddj.com /dept/security/184416083?pgno=1 (2376 words)

	BO2K-Plugins - RoeWiki
		This is a strong encryption plugin using the AES/Rijndael cipher in CBC mode with configurable key size (speed/security tradeoff).
		This is a strong encryption plugin using the Serpent cipher in CBC mode.
		Serpent was a second round candidate for the NIST Advanced Encryption Standard.
	www.roe.ch /download/bo_serpent.shtml (661 words)

	Cryptology ePrint Archive (Site not responding. Last check: 2007-10-06)
		Ciphers with very small S-boxes are believed quite secure, for example the Serpent S-box has only 4 bits, and in DES all the S-boxes have 4 output bits.
		We believe that results on algebraic cryptanalysis of this cipher will have very deep implications for the security of ciphers in general.
		To summarize the main results: it is the first time in the history, that a block cipher with no special algebraic structure and with a (very) large number of S-boxes is being broken in practice by an algebraic attack.
	eprint.iacr.org /2006/168 (270 words)

	96Crypt Help
		It is a 32-round SP-network Symmetric Block Cipher with a very efficient bitslice implementation.
		SERPENT design is similar to RijnDael, however RijnDael is faster but SERPENT is more secure.
		SERPENT was a finalist in the AES competition, ranked 2nd with 59 votes.
	www.erightsoft.com /help/CipherSlc.htm (651 words)

	Serpent home page
		Serpent and Rijndael are somewhat similar; the main difference is that Rijndael is faster (having fewer rounds) but Serpent is more secure.
		We designed Serpent to provide users with the highest practical level of assurance that no shortcut attack will be found.
		We believed this to be prudent practice for a cipher that might have a service life of a century or more.
	www.cl.cam.ac.uk /~rja14/serpent.html (585 words)

	Password Software related Web resources - Ciphers
		Block cipher proposed by RSA as an AES candidate.
		CS2 is based on the CS cipher developed by Serge Vaudenay and takes advantage of work St Denis has done on the pseudo-Hadamard transform.
		Konton2 is a stream cipher which does not resemble RC4 and does not use shift registers.
	www.passwordservice.com /catalogue.php/Ciphers/120 (678 words)

	[No title]
		# # Serpent cipher invented by Ross Anderson, Eli Biham, Lars Knudsen.
		This is a string of "0" and "1" # characters containing the binary representation of the number in # little-endian format (so that subscripting with an index of i gives bit # number i, corresponding to a weight of 2^i).
		Encrypts or decrypts one block of data using the Serpent cipher and optionally showing you what's going on inside at the various stages of the computation.
	www.ussrback.com /crypto/aes/serpent/serpent.py (1863 words)

	ABC-Dir: Cipher
		Warlock is a stream cipher that uses a key as long or longer then the plain text, where the key...
		Contains source code in C for this stream cipher which uses 160 to 2048-bit keys.
		HC-256 is a stream cipher developed by Hongjun Wu at the Institute for Infocomm Research in Singapore.
	www.abc-directory.com /view/cipher (259 words)

	[No title]
		Note that, depending on the block length of the underlying block cipher and the length of the encrypted packets, the first recommendation may supersede the second recommendation, or visa- versa.
		If L is less than 128 (which is the case for older ciphers such as 3DES, Blowfish, CAST-128, and IDEA), then, although it may be too expensive to rekey every 2**(L/4) blocks, it is still advisable for SSH implementations to follow the original recommendation in [SSH-TRANS]: rekey at least once every gigabyte of transmitted data.
		If an SSH implementation uses a block cipher with a larger block size (e.g., Rijndael with 256-bit blocks), then the recommendations in the above paragraph may supersede the recommendations in this paragraph (depending on the lengths of the packets).
	www.ietf.org /proceedings/04aug/I-D/draft-ietf-secsh-newmodes-02.txt (2795 words)

	CertainKey - Glossary
		Serpent was a candidate for the Advanced Encryption Standard.
		The winner, Rijndael, got 86 votes at the last AES conference while Serpent got 59 votes, TwoFish 31 votes, and the other two candidates 36 votes.
		Many other block ciphers possessing acceptable cryptographic strength exist such as:
	www.certainkey.com /resources/glossary.php?Serpent (123 words)

	Security Forums :: View topic - Double encryption (Blowfish->Rijndael) Stronger? Or dumb?
		Your key is still the same so if the attacker knows you have cascaded two cipher systems, and he should by Kerkhoff's principle, then you are in the same position as in the start: the attack difficulty is only the attack on the key.
		If the keys for each of the ciphers are truly independently generated, then the construction would be secure (I think; assuming no input-dependant message expansion or compression takes place).
		Fortunately, block ciphers, such as the AES, are built to hold their own; in the case of the AES, it has been successful thus far, given what we know.
	www.security-forums.com /viewtopic.php?p=247785 (3439 words)

	Serpent - CryptoDox
		Serpent is a symmetric key block cipher which was a finalist in the Advanced Encryption Standard contest, where it came second to Rijndael.
		Serpent was designed by Ross Anderson, Eli Biham, and Lars Knudsen.
		This maximises parallelism, but also makes use of the extensive cryptanalysis work performed on DES.
	www.cryptodox.com /Serpent (180 words)

	SGI TPL View (Cryptoloop-HOWTO)
		I have chosen to use AES as a cipher, but you can substitute any cipher you like that has been enabled in the kernel.
		Both AES and Serpent are probably a reasonable choice.
		Serpent has not been analyzed as much, but is considered to be even a little bit stronger than AES.
	techpubs.sgi.com /tpl.cgi/view/linux/HOWTO/Cryptoloop-HOWTO (2236 words)

	RFC 4344
		underlying block cipher and the length of the encrypted packets, the first recommendation may supersede the second recommendation, or vice versa.
		Note that if L is less than or equal to 128, then the recommendation in this subsection supersedes the recommendation in Section 3.1.
		If an SSH implementation uses a block cipher with a larger block size (e.g., Rijndael with 256-bit blocks), then the recommendations in Section 3.1 may supersede the recommendations in this subsection (depending on the lengths of the packets).
	www.apps.ietf.org /rfc/rfc4344.html (2800 words)

	Cryptoloop Migration Guide - clemens.endorphin.org (Site not responding. Last check: 2007-10-06)
		This document only describes how to immigrate from the first to the third patch set, since I think the last method will be used in further util-linux releases.
		The reason to do so is, the kerneli patch tries to access /proc/crypto/ to parse the supported keysize for the cipher in use.
		The kerneli implementation of Serpent has been "reversed", a common implementation error of the serpent cipher (with decryption/encryption switched).
	clemens.endorphin.org /Cryptoloop_Migration_Guide (743 words)

	Example Krugle Code Search: cryptography permutation serpent
		These results were brought to you by Krugle, the code search engine that delivers the world's code to developers desktops.
		Includes entropy sources, random generators, block ciphers, hash functions, message authentication codes, multiprecision integer routines, and public key primitives.
		It can also perform cryptanalysis like frequency analysis for substutition cipher and exhaustive key search for rotation cipher, as well as searching internet databases for md5 hashes.
	www.krugle.com /examples/keywords/cryptography-permutation-serpent.html (336 words)

	vldrm: gcrypt_tea Class Reference
		It looks small and fast but it is _much_ slower than AES or Twofish, even with the number of rounds set to 10 (like AES).
		With the number of rounds set to 32 (the default) it is almost as slow as the Serpent cipher.
		According to Wheeler and Needham the cipher is meant as an easy replacement for DES, so comparing it with AES might not be fair.
	www.stud.ntnu.no /groups/drm/docs/classgcrypt__tea.html (332 words)

Try your search on: Qwika (all wikis)