MathGroup Archive 2001

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Rijndael

  • To: mathgroup at
  • Subject: [mg31401] Re: Rijndael
  • From: "Tim Ebringer" <tde at>
  • Date: Wed, 31 Oct 2001 19:59:41 -0500 (EST)
  • Organization: Computer Science, University of Melbourne
  • References: <9roddu$psr$>
  • Sender: owner-wri-mathgroup at

There are heaps of variables to think about when asking is the
implementation available. For example, do you require all the modes of
operation, which keysize are you going to use, will you pad input that is
not a multiple of the block length, etc.

I am the client for a software engineering project here at the university
that created two implementations of the Rijndael algorithm - one optimised
for speed (and draft FIPS compliant), and the other made so that it can be
"pulled apart" (for example, the reduction polynomial can be changed,
results of individual rounds exposed, etc).

It was coded in C, but the frontend is Python, and should happily compile
and install on any platform (Windoze or UNIX) using the DistUtils package.
You should not have too much trouble getting data between Mathematica and

The students are due to hand me over the completed package today or
tomorrow, so get in touch if you are interested.



Tim Ebringer
Computer Security Group            Don't suspect a friend...
Department of Computer Science him
University of Melbourne

"Oriol Rico Millan" <oriol.rico at> wrote in message
news:9roddu$psr$1 at
> Please anyone has the Rijndael algorithm implementation for Mathematica? I
> need this implementation for doing some evaluation,
> Thanks,
> Oriol

  • Prev by Date: Re: Finding variables in a very long expression
  • Next by Date: how to be as efficient as Sort[list] when list is {{x1,y1},{x2,y2},...}
  • Previous by thread: Rijndael
  • Next by thread: graphics on the same line