Design Strategies for ARX with Provable Bounds: SPARX and LAX (Full Version)

Daniel Dinu, Léo Perrin, Aleksei Udovenko, Vesselin Velichkov, Johann Großschädl, Alex Biryukov. Design Strategies for ARX with Provable Bounds: SPARX and LAX (Full Version). IACR Cryptology ePrint Archive, 2016:984, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.