SHARE
Facebook X Pinterest WhatsApp

Slashdot: AES: Learn All About It

Written By
thumbnail
Web Webster
Web Webster
Feb 23, 2001

“Since it was officially approved by the U.S. Government in
November of 1976, most of the world’s sensitive commercial traffic
has been secured through the use of the Data Encryption Standard
(DES). In its twenty-five year lifetime, it has become the most
widely used, most widely trusted, and most widely studied
encryption algorithm in existence. Alas, in the same way that your
Atari 2600[?] is currently sitting on the floor of your closet,
DES’ lifetime has come to an end as well. This was most
dramatically demonstrated in the three DES Challenges sponsored by
RSA Labs between January of 1997 and January of 1999, with a
DES-encrypted message eventually being broken in less than 24
hours. This challenge also witnessed the birth of a DES-specific
cracking computer, a machine widely theorized about, but never
before (publicly) built. Although variants of DES (most notably
Triple DES) are still widely used, it became clear that a new
algorithm would be needed for the next twenty-five years.”

“Thus was born the Advanced Encryption Algorithm Development
Effort. Beginning in January, 1997 (just before the RSA challenges
finally broke DES), the National Institute of Standards and
Technology announced its intent to begin the Advanced Encryption
Standard (AES) process. The initial AES workshop was held in April,
with the official call for algorithms going forth in September.
Importantly, this call specified that the algorithms submitted have
a key length of 128 bits, and be free of intellectual property
constraints. Algorithms would be accepted from domestic and
international submitters, and the resulting algorithm would be
completely public. The con test would also consider both the
hardware and the software implementation — a divergence from DES,
which was specifically designed for use in hardware. Importantly,
the hardware that the AES had to operate in could vary from the
largest supercomputer to a ROM-based smart card or other embedded
ed environment. A candidate algorithm might well be optimized for
one or the other, but had to perform at least reasonably well on
all to have a real chance of being selected. Finally, this
algorithm would be designed from the ground up to use the long key
length, and thus would be faster and more secure than Triple-DES is
at that length.”

Complete
Story

thumbnail
Web Webster

Web Webster

Web Webster has more than 20 years of writing and editorial experience in the tech sector. He’s written and edited news, demand generation, user-focused, and thought leadership content for business software solutions, consumer tech, and Linux Today, he edits and writes for a portfolio of tech industry news and analysis websites including webopedia.com, and DatabaseJournal.com.

Recommended for you...

5 Best Free and Open Source Text Expander Tools
webmaster
Jun 13, 2025
Grafito: Systemd Journal Log Viewer with a Beautiful Web UI
Bobby Borisov
Jun 12, 2025
FreeBSD Wants to Know a Few Things
brideoflinux
May 11, 2025
NVK enabled for Maxwell, Pascal, and Volta GPUs
Kara Bembridge
May 1, 2025
Linux Today Logo

LinuxToday is a trusted, contributor-driven news resource supporting all types of Linux users. Our thriving international community engages with us through social media and frequent content contributions aimed at solving problems ranging from personal computing to enterprise-level IT operations. LinuxToday serves as a home for a community that struggles to find comparable information elsewhere on the web.

Property of TechnologyAdvice. © 2025 TechnologyAdvice. All Rights Reserved

Advertiser Disclosure: Some of the products that appear on this site are from companies from which TechnologyAdvice receives compensation. This compensation may impact how and where products appear on this site including, for example, the order in which they appear. TechnologyAdvice does not include all companies or all types of products available in the marketplace.