Download

Full Text

5

CITATIONS

5 Total citations

4 Recent citations

2.26 Field Citation Ratio

n/a Relative Citation Ratio

publications

0

supporting

0

mentioning

0

contrasting

0

Smart Citations

0

0

0

0

Citing PublicationsSupportingMentioningContrasting

View Citations

See how this article has been cited at scite.ai

scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.

• [ABD+ 21] Roberto Avanzi, Joppe Bos, Léo Ducas, Eike Kiltz, Tancrede Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, Gregor Seiler, and Damien Stehlé. CRYSTALS-Kyber (version 3.02) – submission to round 3 of the NIST post-quantum project. Specification document (update from August 2021). 2021-08-04., 2021.
• [ADPS16] Erdem Alkim, Léo Ducas, Thomas Pöppelmann, and Peter Schwabe. Post-quantum key exchange-A new hope. In 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016, pages 327–343, 2016.
• [BBD+ 16] Gilles Barthe, Sonia Belaïd, François Dupressoir, Pierre-Alain Fouque, Benjamin Grégoire, Pierre-Yves Strub, and Rébecca Zucchini. Strong non-interference and type-directed higher-order masking. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, October 24-28, 2016, pages 116–129, 2016. Publicly available at https://eprint.iacr.org/2015/506.pdf.
• [BBE+ 18] Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Benjamin Grégoire, Mélissa Rossi, and Mehdi Tibouchi. Masking the GLP lattice-based signature scheme at any order. In Advances in Cryptology-EUROCRYPT 2018-Proceedings, Part II, pages 354–384, 2018.
• [BCZ18] Luk Bettale, Jean-Sébastien Coron, and Rina Zeitoun. Improved high-order conversion from boolean to arithmetic masking. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018(2):22–45, 2018.
• [BDH+ 21] Shivam Bhasin, Jan-Pieter D’Anvers, Daniel Heinz, Thomas Pöppelmann, and Michiel Van Beirendonck. Attacking and defending masked polynomial comparison for lattice-based cryptography. Cryptology ePrint Archive, Report 2021/104, 2021. https://eprint.iacr.org/2021/104.
• [BDK+ 18] Joppe W. Bos, Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, Gregor Seiler, and Damien Stehlé. CRYSTALS-kyber: A CCA-secure module-lattice-based KEM. In 2018 IEEE European Symposium on Security and Privacy, EuroS&P 2018, London, United Kingdom, April 24-26, 2018, pages 353–367, 2018.
• [BDK+ 20] Michiel Van Beirendonck, Jan-Pieter D’Anvers, Angshuman Karmakar, Josep Balasch, and Ingrid Verbauwhede. A side-channel resistant implementation of SABER. IACR Cryptol. ePrint Arch., 2020:733, 2020.
• [BDV21] Michiel Van Beirendonck, Jan-Pieter D’Anvers, and Ingrid Verbauwhede. Analysis and comparison of table-based arithmetic to boolean masking. Cryptology ePrint Archive, Report 2021/067, 2021. https://eprint.iacr.org/2021/067.
• [BGR+ 21] Joppe W. Bos, Marc Gourjon, Joost Renes, Tobias Schneider, and Christine van Vredendaal. Masking Kyber: First-and higher-order implementations. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021(4):173–214, 2021. https://eprint.iacr.org/2021/483.
• [BHLY16] Leon Groot Bruinderink, Andreas Hülsing, Tanja Lange, and Yuval Yarom. Flush, gauss, and reload-A cache attack on the BLISS lattice-based signature scheme. In Proceedings of CHES 2016, pages 323–345, 2016.
• [BMD+ 21] Andrea Basso, Jose Maria Bermudo Mera, Jan-Pieter D’Anvers, Ang-shuman Karmakar, Sujoy Sinha Roy, Michiel Van Beirendonck, and Frederik Vercauteren. Saber: Mod-LWR based KEM (round 3 sub-mission), 2021. https://www.esat.kuleuven.be/cosic/pqcrypto/saber/files/saberspecround3.pdf.
• [BPO+ 20] Florian Bache, Clara Paglialonga, Tobias Oder, Tobias Schneider, and Tim Güneysu. High-speed masking for polynomial comparison in lattice-based KEMs. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2020(3):483–507, 2020.
• [BS20] Nina Bindel and John M. Schanck. Decryption failure is more likely after success. In Post-Quantum Cryptography-11th International Conference, PQCrypto 2020, Paris, France, April 15-17, 2020, Proceedings, pages 206–225, 2020.
• [CGMZ21] Jean-Sébastien Coron, François Gérard, Simon Montoya, and Rina Zeitoun. High-order table-based conversion algorithms and masking lattice-based en-cryption. Cryptology ePrint Archive, Report 2021/1314, 2021. https://ia.cr/2021/1314. Full version of this paper.
• [CGTV15] Jean-Sébastien Coron, Johann Großschädl, Mehdi Tibouchi, and Praveen Ku-mar Vadnala. Conversion from arithmetic to boolean masking with logarithmic complexity. In Proceedings of FSE 2015, pages 130–149, 2015.
• [CGV14] Jean-Sébastien Coron, Johann Großschädl, and Praveen Kumar Vadnala. Secure conversion between boolean and arithmetic masking of any order. In Proceedings of CHES 2014, pages 188–205, 2014.
• [CJRR99] Suresh Chari, Charanjit S. Jutla, Josyula R. Rao, and Pankaj Rohatgi. Towards sound approaches to counteract power-analysis attacks. In CRYPTO, 1999.
• [Cor14] Jean-Sébastien Coron. Higher order masking of look-up tables. In Proceedings of EUROCRYPT 2014, pages 441–458, 2014.
• [Cor17] Jean-Sébastien Coron. High-order conversion from boolean to arithmetic masking. In Proceedings of CHES 2017, pages 93–114, 2017. Full version available at http://eprint.iacr.org/2017/252.
• [CRZ18] Jean-Sébastien Coron, Franck Rondepierre, and Rina Zeitoun. High order masking of look-up tables with common shares. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018(1):40–72, 2018.
• [CT03] Jean-Sébastien Coron and Alexei Tchulkine. A new algorithm for switching from arithmetic to boolean masking. In Proceedings of CHES 2003, pages 89–97, 2003.
• [DDF14] Alexandre Duc, Stefan Dziembowski, and Sebastian Faust. Unifying leakage models: From probing attacks to noisy leakage. In Advances in Cryptology-EUROCRYPT 2014-Proceedings, pages 423–440, 2014.
• [Deb12] Blandine Debraize. Efficient and provably secure methods for switching from arithmetic to boolean masking. In Emmanuel Prouff and Patrick Schaumont, editors, Proceedings of CHES 2012, volume 7428 of Lecture Notes in Computer Science, pages 107–121. Springer, 2012.
• [DGJ+ 19] Jan-Pieter D’Anvers, Qian Guo, Thomas Johansson, Alexander Nilsson, Fred-erik Vercauteren, and Ingrid Verbauwhede. Decryption failure attacks on IND-CCA secure lattice-based schemes. In Public-Key Cryptography-PKC 2019-22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Beijing, China, April 14-17, 2019, Proceedings, Part II, pages 565–598, 2019.
• [DNR04] Cynthia Dwork, Moni Naor, and Omer Reingold. Immunizing encryption schemes from decryption errors. In Advances in Cryptology-EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004, Proceedings, pages 342–360, 2004.
• [DRV20] Jan-Pieter D’Anvers, Mélissa Rossi, and Fernando Virdia. (One) failure is not an option: Bootstrapping the search for failures in lattice-based encryption schemes. In Advances in Cryptology-EUROCRYPT 2020-Part III, pages 3–33, 2020.
• [EFGT17] Thomas Espitau, Pierre-Alain Fouque, Benoît Gérard, and Mehdi Tibouchi. Side-channel attacks on BLISS lattice-based signatures: Exploiting branch tracing against strongswan and electromagnetic emanations in microcontrollers. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dal las, TX, USA, October 30-November 03, 2017, pages 1857–1874, 2017.
• [FBR+ 21] Tim Fritzmann, Michiel Van Beirendonck, Debapriya Basu Roy, Patrick Karl, Thomas Schamberger, Ingrid Verbauwhede, and Georg Sigl. Masked acceler-ators and instruction set extensions for post-quantum cryptography. IACR Cryptol. ePrint Arch., page 479, 2021.
• [FO99] Eiichiro Fujisaki and Tatsuaki Okamoto. Secure integration of asymmetric and symmetric encryption schemes. In Advances in Cryptology-CRYPTO ’99, 19th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 1999, Proceedings, pages 537–554, 1999.
• [Gou01] Louis Goubin. A sound method for switching between boolean and arithmetic masking. In Çetin Kaya Koç, David Naccache, and Christof Paar, editors, Cryptographic Hardware and Embedded Systems-CHES 2001, Third International Workshop, Paris, France, May 14-16, 2001, Proceedings, volume 2162 of Lecture Notes in Computer Science, pages 3–15. Springer, 2001.
• [GR19] François Gérard and Mélissa Rossi. An efficient and provable masked implementation of qTESLA. In Smart Card Research and Advanced Applications-18th International Conference, CARDIS 2019, Prague, Czech Republic, November 11-13, 2019, Revised Selected Papers, pages 74–91, 2019.
• [HCY20] Wei-Lun Huang, Jiun-Peng Chen, and Bo-Yin Yang. Power analysis on NTRU prime. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2020(1):123–151, 2020.
• [HHK17] Dennis Hofheinz, Kathrin Hövelmanns, and Eike Kiltz. A modular analysis of the Fujisaki-Okamoto transformation. In Theory of Cryptography-15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I, pages 341–371, 2017.
• [ISW03] Yuval Ishai, Amit Sahai, and David A. Wagner. Private circuits: Securing hardware against probing attacks. In Advances in Cryptology-CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings, pages 463–481, 2003.
• [Koc96] Paul C. Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In Advances in Cryptology-CRYPTO ’96, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 1996, Proceedings, pages 104–113, 1996.
• [LPR10] Vadim Lyubashevsky, Chris Peikert, and Oded Regev. On ideal lattices and learning with errors over rings. In Advances in Cryptology-EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco/French Riviera, May 30-June 3, 2010. Proceedings, pages 1–23, 2010.
• [LS15] Adeline Langlois and Damien Stehlé. Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr., 75(3):565–599, 2015.
• [MAA+ 20] Dustin Moody, Gorjan Alagic, Daniel Apon, David Cooper, Quynh Dang, John Kelsey, Yi-Kai Liu, Carl Miller, Rene Peralta, Ray Perlner, Angela Robinson, Daniel Smith-Tone, and Jacob Alperin-Sheriff. Status report on the second round of the NIST post-quantum cryptography standardization process, 2020-07-22 2020.
• [MGTF19] Vincent Migliore, Benoît Gérard, Mehdi Tibouchi, and Pierre-Alain Fouque. Masking Dilithium-efficient implementation and side-channel evaluation. In Applied Cryptography and Network Security-17th International Conference, ACNS 2019, Bogota, Colombia, June 5-7, 2019, Proceedings, pages 344–362, 2019.
• [OMHT06] Elisabeth Oswald, Stefan Mangard, Christoph Herbst, and Stefan Tillich. Practical second-order DPA attacks for masked smart card implementations of block ciphers. In David Pointcheval, editor, Proceedings of CT-RSA 2006, volume 3860 of Lecture Notes in Computer Science, pages 192–207. Springer, 2006.
• [OSPG18] Tobias Oder, Tobias Schneider, Thomas Pöppelmann, and Tim Güneysu. Practical CCA2-secure and masked ring-lwe implementation. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018(1):142–174, 2018.
• [PG13] Thomas Pöppelmann and Tim Güneysu. Towards practical lattice-based public-key encryption on reconfigurable hardware. In Selected Areas in Cryptography-SAC 2013-20th International Conference, Burnaby, BC, Canada, August 14-16, 2013, Revised Selected Papers, pages 68–85, 2013.
• [PPM17] Robert Primas, Peter Pessl, and Stefan Mangard. Single-trace side-channel attacks on masked lattice-based encryption. In Cryptographic Hardware and Embedded Systems-CHES 2017-19th International Conference, Taipei, Taiwan, September 25-28, 2017, Proceedings, pages 513–533, 2017.
• [RP10] Matthieu Rivain and Emmanuel Prouff. Provably secure higher-order masking of AES. In Cryptographic Hardware and Embedded Systems, CHES 2010, 12th International Workshop, Santa Barbara, CA, USA, August 17-20, 2010. Proceedings, pages 413–427, 2010.
• [RRVV15] Oscar Reparaz, Sujoy Sinha Roy, Frederik Vercauteren, and Ingrid Ver-bauwhede. A masked Ring-LWE implementation. In Cryptographic Hardware and Embedded Systems-CHES 2015-17th International Workshop, Saint-Malo, France, September 13-16, 2015, Proceedings, pages 683–702, 2015.
• [Sha79] Adi Shamir. Factoring numbers in o(log n) arithmetic steps. Inf. Process. Lett., 8(1):28–31, 1979.
• [SPOG19] Tobias Schneider, Clara Paglialonga, Tobias Oder, and Tim Güneysu. Effi-ciently masking binomial sampling at arbitrary orders for lattice-based crypto. In Public-Key Cryptography-PKC 2019-22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Beijing, China, April 14-17, 2019, Proceedings, Part II, pages 534–564, 2019.
• [TE15] Mostafa Taha and Thomas Eisenbarth. Implementation attacks on post-quantum cryptographic schemes. IACR Cryptol. ePrint Arch., 2015:1083, 2015.
• [XPRO20] Zhuang Xu, Owen Pemberton, Sujoy Sinha Roy, and David F. Oswald. Magnify-ing side-channel leakage of lattice-based cryptosystems with chosen ciphertexts: The case study of Kyber. IACR Cryptol. ePrint Arch., 2020:912, 2020.