Pre-Grant Publication Number: 20090129585
Please help the USPTO examine the application by evaluating the relevance of the publicly submitted prior art to the patent application.
Peer To Patent forwards the Top 10 most relevant prior art submissions and their annotations to the USPTO.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Prior Art Detail
Summary / Description
| Summary / Description | The Advanced Encryption Standard (AES) specifies a FIPS-approved cryptographic algorithm that can be used to protect electronic data. The AES algorithm is a symmetric block cipher that can encrypt (encipher) and decrypt (decipher) information. Encryption converts data to an unintelligible form called ciphertext; decrypting the ciphertext converts the data back into its original form, called plaintext. The AES algorithm is capable of using cryptographic keys of 128, 192, and 256 bits to encrypt and decrypt data in blocks of 128 bits. |
Basic Information
| Type of Prior Art | Print Publication |
| Publication Title * | Federal Information Processing Standards Publication 197 |
| Author | |
| ISBN | |
| Page Range | 14-15 |
| Medium | Other printed publication |
| Publication Date * | November 26, 2001 |
| URL | http://en.wikipedia.org/wiki/Ad... |
Notes / To Do
| Notes | |
Excerpt
Excerpt At the start of the Cipher, the input is copied to the State array using the conventions described in
Sec. 3.4. After an initial Round Key addition, the State array is transformed by implementing a
round function 10, 12, or 14 times (depending on the key length), with the final round differing
slightly from the first Nr -1 rounds. The final State is then copied to the output as described in
Sec. 3.4. |
Relevance
Claims
1
Relevance
See Cipher section pp 14-15.
See Cipher section pp 14-15.
Claim Chart
All
0 days left
