
	Where results make sense

Topic: AES candidate

Related Topics

Aes Sedai

AES process

Aero Ae 01

AES EBU embedded timecode

Rolls Royce AE 1007

USS Vesuvius AE 15

AES competition

Rolls Royce AE 2100

USS Mauna Kea AE 22

USS Rainier AE 5

USS Wrangell AE 12

USS Nitro AE 23

In the News (Sun 27 May 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	FIRST ADVANCED ENCRYPTION STANDARD (AES) CANDIDATE CONFERENCE
		Security is, of course, the paramount consideration in the AES selection process and encompasses such issues as the relative security of one candidate as compared to the others, and the extent to which the algorithm output is indistinguishable from a random permutation on the input block.
		Each candidate submitter had to sign license agreements provided by NIST identifying any known intellectual property (i.e., patents or patent applications) that may be infringed by the practice of the particular candidate.
		In the first AES evaluation round, this will focus primarily upon the 128 bit key size, while in the second round (with about fivecandidates), this will be expanded to include the 192 bit and 256 bit key sizes and hardware performance estimates.
	www.ieee-security.org /Cipher/ConfReports/conf-rep-aes.html (5942 words)

	Advanced Encryption Standard (AES) Development Process
		Security is, of course, the paramount consideration in the AES selection process and encompasses such issues as the relative security of one candidate as compared to the others, and the extent to which the algorithm output is indistinguishable from a random permutation on the input block.
		Each candidate submitter had to sign license agreements provided by NIST identifying any known intellectual property (i.e., patents or patent applications) that may be infringed by the practice of the particular candidate.
		Near the end of Round 1, the Second AES Candidate Conference (AES2) was held on March 22-23, 1999, at the Hotel Quirinale in Rome, Italy.
	members.aol.com /ammjoey/myhomepage/news.html (1694 words)

	ADVANCED ENCRYPTION STANDARD (AES) Fact Sheet
		It is a comprehensive report that discusses various issues related to the AES, presents analysis and comments received during the public comment period, summarizes characteristics of the five finalist AES algorithms, compares and contrasts the finalists, and presents NIST's selection of Rijndael.
		Prior to its evaluation of the five finalists, NIST's AES selection team discussed the issue of whether it should change the number of rounds for one or more of the algorithms, since that issue had been raised by the public during the recent comment period.
		For these reasons, NIST's AES selection team decided it would be most appropriate to base its evaluation and selection on the five algorithms as they were originally submitted (i.e., without changing the number of rounds).
	csrc.nist.gov /CryptoToolkit/aes/aesfact.html (1963 words)

	Second AES Candidate Conference (AES2) (Site not responding. Last check: 2007-10-29)
		Near the end of Round 1 of the AES Development Effort, the Second AES Candidate Conference (AES2) was held on March 22-23, 1999, in Rome, Italy.
		NIST announced preliminary plans for the Third AES Candidate Conference (AES3).
		NIST received feedback from the AES2 attendees, regarding their thoughts on the candidate algorithms.
	csrc.nist.gov /encryption/aes/round1/conf2/aes2conf.htm (782 words)

	Strong Encryption Package, Mars Encryption
		A Second AES Candidate Conference (AES2) was held in March 1999 to discuss the results of the analysis conducted by the global cryptographic community on the candidate algorithms.
		Near the end of Round 2, NIST sponsored the Third AES Candidate Conference (AES3), which was an open, public forum for discussion of the analyses of the AES finalists.
		Submitters of the AES finalists were invited to attend and engage in discussions regarding comments on their algorithms.
	www.tropsoft.com /strongenc/mars.htm (1266 words)

	AES Candidate Conference
		Comparison of the Hardware Performance of the AES Candidates Using Reconfigurable Hardware
		AES Finalists on PA-RISC and IA-64: Implementations and Performance
		A Comparison of AES Candidates on the Alpha 21264
	wotan.liu.edu /docis/dbl/aesaes (292 words)

	Request for Comments on Candidate Algorithms for the AES
		The study was based on the assumption that the AES baseline should depend on the use of commercial-off-the-shelf systems, typically available in most commercial and governmental settings.
		The rationale for this type of study is to help characterize the range of expected performance in commercial implementations of the AES candidate codes in typical client/server enterprise settings.
		AES Candidate Codes: Because of the limitations of time and the short duration for presentation of results, no optimization for any of the AES candidate codes or code performance reorganization was performed.
	www.utexas.edu /computer/itc/intel/leibrock/AES-Round2.htm (1034 words)

	Why NSA Should Submit an AES Candidate
		Candidates will be judged on security, efficiency, and flexibility, and NIST hopes to have a new standard ready by the end of the century.
		For the AES to suit the NSA, there must be an AES candidate that fulfills those requirements.
		The AES will be with us for twenty years and will be used in applications we can't even imagine.
	www.schneier.com /aes-nsa.html (1117 words)

	Strong Encryption Package, Twofish
		It is one of the five finalists chosen by NIST from a field of 15 candidates as explained above.
		It is also the fastest AES candidate, and one of the most compact.
		The key length can vary, but for the purposes of the AES it is defined to be either 128, 192, or 256 bits.
	www.tropsoft.com /strongenc/twofish.htm (1159 words)

	Rijndael (Site not responding. Last check: 2007-10-29)
		Rijndael is one of the ?ve AES candidate ciphers that made it to the second round...
		The AES competition was announced by NIST in order to select U.S. sanctioned block cipher encryption methods for the coming decades.
		AES (Rijndael) uses a key schedule to expand a short key into a number of separate round keys.
	comparessl.firnssl.com /rijndael (794 words)

	Cryptography Technology
		Here is C code for AES and a number of the combined encryption/authentication modes being studied by NIST.
		The list of candidates that were successful in the first selection round is now known and work is now underway to determine their cryptographic strength and their performance.
		I am taking a strong interest in the AES activity and, since my interests are in implementation, I have decided to see what is involved in implementing a number of the AES candidate algorithms from scratch using the paper descriptions rather than any published source code as a basis.
	fp.gladman.plus.com /cryptography_technology/index.htm (559 words)

	Advanced Encryption Standard (AES) Development Effort (Site not responding. Last check: 2007-10-29)
		If you have a tangential issue to discuss, that is not directly related to the AES candidate algorithms, their analysis, or the AES effort in general, please use another site/forum to discuss that information.
		Near the end of Round 1, NIST will be holding a Second AES Candidate Conference to discuss results of the public evaluation and analysis of the Round 1 AES candidate algorithms.
		AES - The Early Years: Information on the beginnings of the AES process in early 1997, the April 1997 Workshop to discuss the minimum acceptability requirements and evaluation criteria, and all information pertaining to the Call for Candidate algorithms.
	home.in.tum.de /~gerold/aktvorl9899/aes_home.htm (985 words)

	Advanced Encryption Standard (AES) - FAQ
		This document is an attempt to summarize the questions which are most often asked of NIST regarding the AES development effort (particularly the Federal Register's request for candidate algorithm nominations.
		As stated in the Federal Register announcment referenced above, general questions concerning the AES development effort and request for candidate algorithm nominations may be sent electronically to AESQUEST@NIST.GOV or via fax to 301-948-1233 (Attn: AES Questions).
		This FAQ is organized in a manner that parallels the sections of the recent Federal Register's request for candidate algorithm nominations.
	cryptome.sabotage.org /aesfaq.htm (309 words)

	AES Candidate Conference 2000
		Nicholas Weaver, John Wawrzynek: A Comparison of the AES Candidates Amenability to FPGA Implementation.
		Kris Gaj, Pawel Chodowiec: Comparison of the Hardware Performance of the AES Candidates Using Reconfigurable Hardware.
		Richard Weiss, Nathan L. Binkert: A Comparison of AES Candidates on the Alpha 21264.
	www.informatik.uni-trier.de /~ley/db/conf/aes/aes2000.html (448 words)

	Description of Known Answer Tests and Monte Carlo Tests for AES Submissions
		KAT values are required for operation of the AES candidate algorithms in the Electronic Codebook (ECB) mode only (for all three required key sizes).
		Known Answer Test values must be provided with submissions, which demonstrate operation of the AES candidate algorithm in ECB mode, for each of the minimum required key values (128, 192, and 256 bits).
		Monte Carlo Test values must be provided with submissions, which demonstrate operation of the AES candidate algorithm in both ECB and CBC modes, for each of the minimum required key values (128, 192, and 256 bits), for both the encrypt and decrypt states.
	www.ntua.gr /cryptix/old/cryptix/aes/docs/katmct.html (3491 words)

	[No title] (Site not responding. Last check: 2007-10-29)
		In this version of the document, I've given cycle counts for 12 of the 15 AES candidates, and written comments on the expected performance of the remaining three.
		HPC is probably the fastest of all the AES candidates on the Alpha 21064.
		Since HPC is (in my view) not a viable AES candidate, I haven't bothered to count the number of cycles required for decryption.
	www.cs.ut.ee /~lipmaa/aes/kenneth.txt (4759 words)

	[No title]
		From this perspective, the lifetime of AES is forever: Although Marvin, with a brain the size of a small planet [14], may aspire to someday search a 128-bit keyspace, no conceivable development in device technology can search 2^256 keys.
		It's clear that the AES should not be chosen based on what runs best on 32-bit machines, but based on machines likely to become available in the future.
		When the AES criteria were being developed, there was a notion that a tamper-resistant smart card might contain a secret unknown to the owner, and that the AES algorithm should protect this secret.
	www.cs.arizona.edu /~rcs/hpc/hpc-oneyearlater (6416 words)

	Information about the AES: Awards
		Click here to propose an AES member as a candidate for consideration as an award recipient.
		The AES Gold Medal Award (formerly The John H. Potts Award) is given in recognition of outstanding achievements, sustained over a period of years, in the field of Audio Engineering.
		The Fellowship Award is given to a member who had rendered conspicuous service or is recognized to have made a valuable contribution to the advancement in or dissemination of knowledge of audio engineering or in the promotion of its application in practice.
	www.aes.org /info/awards.cfm (250 words)

	Randomness Testing of the AES Candidate Algorithms - Soto (ResearchIndex) (Site not responding. Last check: 2007-10-29)
		Abstract: One of the criteria used to evaluate the AES candidate algorithms was their demonstrated suitability as random number generators.
		That is, the evaluation of their output utilizing statistical tests should not provide any means by which to computationally distinguish them from a truly random source.
		Coincidentally, the five attacked candidates were also among the slowest candidates.
	citeseer.ist.psu.edu /250886.html (412 words)

	Decorrelated Fast Cipher: an AES Candidate - Gilbert, Girault, Hoogvorst, Noilhan, Pornin, Poupard, Stern, Vaudenay ... (Site not responding. Last check: 2007-10-29)
		This report presents a response to the call for candidates issued by the National Institute for Standards and Technologies (the Advanced Encryption Standard project).
		The proposed candidate --- called DFC as for "Decorrelated Fast Cipher" --- is based on Vaudenay's decorrelation technique.
		0.3: MARS - a candidate cipher for AES - Burwick, Coppersmith, D'Avignon..
	citeseer.ist.psu.edu /166623.html (590 words)

	Towards the 128-bit Era: AES Candidates
		However, while it seems that the series of byte substitutions, followed by a Pseudo-Hadamard Transform, mixes together the two halves of the block well enough, attacks are possible against this type of construction that make it not much stronger than normal DES, at least in theory.
		All the AES candidate algorithms have been disclosed.
		It may also be noted that links to the descriptions of the algorithms are available at the Block Cipher Lounge as well as at the official AES site.
	www.quadibloc.com /crypto/co0404.htm (552 words)

	Publications by Niels Ferguson
		We show some structural weaknesses in the Magenta block cipher that was submitted as an AES candidate.
		Performance Comparison of the AES Submissions by Bruce Schneier, John Kelsey, Doug Whiting, David Wagner, Chris Hall, and Niels Ferguson.
		We compare the performance of the leading AES candidates on a variety of common platforms: 32-bit CPUs, 64-bit CPUs, cheap 8-bit smart-card CPUs, and dedicated hardware.
	www.macfergus.com /pub (959 words)

	...And The Winner Of The AES Competition is Rijndael!
		The initial call for AES candidate algorithms was published on September 12, 1997.
		A similar period of analysis and feedback followed this round two announcement and Rijndael was announced as the AES finalist on October 2, 2000.
		Considering that AES desired its final selection to operate on a variety of machines such as personal computers and smart cards, an algorithm would be less desirable if it could only be implemented efficiently given a particular wordsize, for example.
	www.cs.rit.edu /~mds1761/cs705paper.html (4494 words)

	CS 4803 - David Pritchett [AES - Introduction]
		At the First AES Candidate Conference (AES1) on August 20, 1998, NIST announced the Round 1 candidates.
		In this conference, only five candidates were selected by NIST as possible AES candidates.
		A Third AES Candidate Conference (AES3) was held during April of 2000 in New York.
	www.prism.gatech.edu /~gte043j/CS4803/3.html (1736 words)

	[No title]
		The AES, formerly known as Rijndael, was chosen from the five finalists.
		This document specifies the use of the AES cipher and the other finalists in CBC mode within ESP. This mode requires an Initialization Vector (IV) that is the same size as the block size.
		Because the AES algorithm is relatively new and has only undergone limited cryptographic analysis, its use in IPsec implementations should be considered experimental.
	ietf.org /proceedings/00dec/I-D/draft-ietf-ipsec-ciph-aes-cbc-01.txt (3819 words)

	CNN - U.S. government to set new standard for advanced encryption - August 24, 1998
		The new standard, to be called Advanced Encryption Standard or AES, is expected to endure for at least 30 years, said Miles Smid, manager of the security technology group at NIST.
		The 15 AES proposals were announced at the First AES Candidate Conference in Ventura, California, which started yesterday and concludes tomorrow.
		Ten of the AES proposals come from the U.S., but other countries represented are Canada, South Korea, Norway, France, Japan, Costa Rica, Australia, Germany, the U.K. and Israel.
	www.cnn.com /TECH/computing/9808/25/govencrypt.idg/index.html (810 words)

	sci.crypt: Re: AES Candidate Frog Broken
		>candidates submitted, but that it was eliminated as a consequence of
		A pointer to a paper would be nice.
		We are proud to have Web Hosting and Rack Housing from 9 Net Avenue Deutschland.
	www.derkeiler.com /Newsgroups/sci.crypt/2003-02/1853.html (173 words)

	Second Advanced Encryption Standard (AES) Candidate Conference (Site not responding. Last check: 2007-10-29)
		Purpose: In August 1998, NIST announced fifteen candidate algorithms which have been proposed for consideration for selection as the Advanced Encryption Algorithm to be incorporated in the Federal Information Processing Standard (FIPS) for Advanced Encryption Standard (AES).
		During the conference, attendees will hear results of experts' study of the fifteen AES candidate algorithms and recommendations for the selection of finalists (five or fewer).
		To further ensure a constructive and lively dialogue, submitters of the candidate algorithms will also be have an opportunity to provide their comments on the analysis of their algorithms (and on the other candidates).
	www.cs.utah.edu /flux/cipher/cfps/1999/cfp-aes99.html (379 words)

Try your search on: Qwika (all wikis)