1. Match-Bounded String Rewriting Systems

   • Alfons Geser
   • Dieter Hofbauer
   • Johannes Waldmann

   OriginalPaper 14 October 2004 Pages: 149 - 171

2. Construction of Cryptographically Important Boolean Permutations

   • Wenying Zhang
   • Chuan-Kun Wu
   • Shiqu Li

   OriginalPaper 14 October 2004 Pages: 173 - 177

3. On the Security of RSA with Primes Sharing Least-Significant Bits

   • Ron Steinfeld
   • Yuliang Zheng

   OriginalPaper 14 October 2004 Pages: 179 - 200

4. An Efficient Algorithm for Software Generation of Binary Linear Recurrences

   • Sanjay Burman
   • Palash Sarkar

   OriginalPaper 06 September 2004 Pages: 201 - 203

5. On the Bounds of the Bilinear Complexity of Multiplication in Some Finite Fields

   • Stéphane Ballet
   • Jean Chaumine

   OriginalPaper 06 September 2004 Pages: 205 - 221

6. DFT-based Word Normalization in Finite Supersolvable Groups

   • Meinard Müller
   • Michael Clausen

   OriginalPaper 06 September 2004 Pages: 213 - 231

7. Various New Expressions for Subresultants and Their Applications

   • Gema M. Diaz–Toca
   • Laureano Gonzalez–Vega

   OriginalPaper 15 October 2004 Pages: 233 - 266

8. Minimal Homogeneous Bases for Polynomial Ideals

   • Erol Yılmaz
   • Sibel Kılıçarslan

   OriginalPaper 06 September 2004 Pages: 267 - 278

9. Computation of the Decomposition Group of a Triangular Ideal

   • I. Abdeljaouad-Tej
   • S. Orange
   • A. Valibouze

   OriginalPaper 15 October 2004 Pages: 279 - 294