Rasta: A Cipher with Low ANDdepth and Few ANDs per Bit

@inproceedings{Dobraunig2018RastaAC,
  title={Rasta: A Cipher with Low ANDdepth and Few ANDs per Bit},
  author={Christoph Dobraunig and Maria Eichlseder and Lorenzo Grassi and Virginie Lallemand and Gregor Leander and Eik List and Florian Mendel and Christian Rechberger},
  booktitle={CRYPTO},
  year={2018}
}
Recent developments in multi party computation (MPC) and fully homomorphic encryption (FHE) promoted the design and analysis of symmetric cryptographic schemes that minimize multiplications in one way or another. In this paper, we propose with Rasta a design strategy for symmetric encryption that has ANDdepth d and at the same time only needs d ANDs per encrypted bit. Even for very low values of d between 2 and 6 we can give strong evidence that attacks may not exist. This contributes to a… CONTINUE READING
BETA

References

Publications referenced by this paper.
SHOWING 1-10 OF 52 REFERENCES

Algebraic cryptanalysis of RASTA

  • C. Bile, L. Perret, J. C. Faugère
  • technical report
  • 2017
Highly Influential
4 Excerpts

FIPS PUB 202: SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions

  • National Institute of Standards, Technology
  • U.S. Department of Commerce
  • 2015
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…