Utah Valley Cryptologic Society, March 27, 2002 Meeting

Tolga Acar explained his RC5 variant and how it achieves better diffusion and high speed for larger block sizes. By using four state variables and four data dependent rotations, the basic RC5 structure can be changed to involve twice as many state variable bits in the rotations.

Kent Seamons talked briefly about BYU's work on building trust negotiation strategies based on subject attributes.

Dan Bernstein's proposal for building a factoring machine was discussed. Doug Hale pointed out that the early history of computing had included a similar architecture, when gates were much slower.

Thai Ruby's lunch menu includes an entree, SP3, which is the name of an early protocol for secure network communication. The food is not only good, it is secure.

Pete Boucher, Rich Schroeppel, Babir Amin, Tammy Green, Dan Fritch, Tolga Acar

Tolga Acar, Steve Winn, and Doug Hale

Rich Schroeppel, Pete Boucher, Kent Seamons, John Higgins

Tammy Green, Dan Fritch