Hardware SLE solvers: Efficient building blocks for cryptographic and cryptanalyticapplications

@article{Rupp2011HardwareSS,
  title={Hardware SLE solvers: Efficient building blocks for cryptographic and cryptanalyticapplications},
  author={Andy Rupp and Thomas Eisenbarth and Andrey Bogdanov and Oliver Grieb},
  journal={Integration},
  year={2011},
  volume={44},
  pages={290-304}
}
Solving systems of linear equations (SLEs) is a very common computational problem appearing in numerous research disciplines and in particular in the context of cryptographic and cryptanalytic algorithms. In this work, we present highly efficient hardware architectures for solving (small and medium-sized) systems of linear equations over F 2k . These architectures feature linear or quadratic running times with quadratic space complexities in the size of an SLE, and can be clocked at high… CONTINUE READING
2 Citations
22 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Similar Papers

Loading similar papers…