| |
 |
|
|
Science Forum Index » Cryptography Forum » optimized AES C code without table lookup...
Page 1 of 1
|
| Author |
Message |
| jd51a... |
 Posted: Wed Jul 23, 2008 7:58 am |
|
|
|
Guest
|
I am looking for an optimized implementation of AES in C that does not
use table lookup (no openssl, etc.). Anyone have any pointers? |
|
|
| Back to top |
|
| ... |
| Posted: Wed Jul 23, 2008 1:44 pm |
|
|
|
Guest
|
On Jul 23, 10:58 am, jd51a <jd... at (no spam) mail.com> wrote:
Quote: I am looking for an optimized implementation of AES in C that does not
use table lookup (no openssl, etc.). Anyone have any pointers?
One of the legendary implementations (recently pointed to in another
thread here by Blind Anagram) is from Brian Gladman.
http://fp.gladman.plus.com/AES/
This is actually a set of interoperable versions of AES some of which
feature compressed tables which will eliminate timing attacks ala
Daniel J. Bernstein's, if that is what you are after.
His stuff has highly optimized variants (that are all complete and
with test vectors), but there trade offs as you begin to manipulate
table usage.
You don't mention your reasons for needing no tables its a bit
nebulous what you are going for.
The quality and reputation of Brian Galdman's AES code,along with
built-in capability to use just C, and ways to use tables to defeat
timing issues, etc... may be what you need. |
|
|
| Back to top |
|
| Carsten Krueger... |
| Posted: Wed Jul 23, 2008 2:11 pm |
|
|
|
Guest
|
|
| Back to top |
|
| Phil Carmody... |
| Posted: Wed Jul 23, 2008 7:25 pm |
|
|
|
Guest
|
fortune.bruce at (no spam) gmail.com writes:
Quote: On Jul 23, 10:58 am, jd51a <jd... at (no spam) mail.com> wrote:
I am looking for an optimized implementation of AES in C that does not
use table lookup (no openssl, etc.). Anyone have any pointers?
One of the legendary implementations (recently pointed to in another
thread here by Blind Anagram) is from Brian Gladman.
Set fonts to fixed-width, and note x/p & f/u
Blind Anagram
= =
B B
r r
i i
a a
n n
G G
l l
a a
d d
m m
a a
n n
=
Grim and banal
Mad, banal grin
Alarming band
Malign a brand
And from LardyGirl we have:
Mr. Big and anal
Mr. Bald Angina
Mr. Bland Again
I'll let her apologise to Brian for those!
Phil
--
Dear aunt, let's set so double the killer delete select all.
-- Microsoft voice recognition live demonstration |
|
|
| Back to top |
|
| ... |
| Posted: Thu Jul 24, 2008 1:17 am |
|
|
|
Guest
|
On Jul 23, 5:25 pm, Phil Carmody <thefatphil_demun... at (no spam) yahoo.co.uk>
wrote:
Quote: fortune.br... at (no spam) gmail.com writes:
On Jul 23, 10:58 am, jd51a <jd... at (no spam) mail.com> wrote:
I am looking for an optimized implementation of AES in C that does not
use table lookup (no openssl, etc.). Anyone have any pointers?
One of the legendary implementations (recently pointed to in another
thread here by Blind Anagram) is from Brian Gladman.
Set fonts to fixed-width, and note x/p & f/u
Blind Anagram
=
B B
r r
i i
a a
n n
G G
l l
a a
d d
m m
a a
n n
Grim and banal
Mad, banal grin
Alarming band
Malign a brand
And from LardyGirl we have:
Mr. Big and anal
Mr. Bald Angina
Mr. Bland Again
I'll let her apologise to Brian for those!
Phil
--
Dear aunt, let's set so double the killer delete select all.
-- Microsoft voice recognition live demonstration
Which begs the question, Phil... |
|
|
| Back to top |
|
| |
|
Page 1 of 1
All times are GMT - 5 Hours
The time now is Fri Dec 05, 2008 4:53 am
|
|