FrodoKEM: Practical quantum-secure key encapsulation from generic lattices. FrodoKEM is a family of key-encapsulation mechanisms that are designed to be conservative yet practical post-quantum constructions whose security derives from cautious parameterizations of the well-studied learning with errors problem, which in turn has close connections to conjectured-hard problems on generic, algebraically unstructured lattices.

References in zbMATH (referenced in 17 articles )

Showing results 1 to 17 of 17.
Sorted by year (citations)

  1. Guo, Siyao; Kamath, Pritish; Rosen, Alon; Sotiraki, Katerina: Limits on the efficiency of (ring) LWE-based non-interactive key exchange (2022)
  2. Aggarwal, Divesh; Chung, Eldon: A note on the concrete hardness of the shortest independent vector in lattices (2021)
  3. Brendel, Jacqueline; Fischlin, Marc; Günther, Felix; Janson, Christian; Stebila, Douglas: Towards post-quantum security for Signal’s X3DH handshake (2021)
  4. Sarkar, Palash; Singha, Subhadip: Verifying solutions to LWE with implications for concrete security (2021)
  5. Sehrawat, Vipin Singh; Yeo, Foo Yee; Desmedt, Yvo: Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (2021)
  6. Vacek, Jan; Václavek, Jan: Key mismatch attack on ThreeBears, Frodo and Round5 (2021)
  7. Bootland, Carl; Castryck, Wouter; Szepieniec, Alan; Vercauteren, Frederik: A framework for cryptographic problems from linear algebra (2020)
  8. Bindel, Nina; Buchmann, Johannes; Göpfert, Florian; Schmidt, Markus: Estimation of the hardness of the learning with errors problem with a restricted number of samples (2019)
  9. Bos, Joppe W.; Friedberger, Simon; Martinoli, Marco; Oswald, Elisabeth; Stam, Martijn: Assessing the feasibility of single trace power analysis of Frodo (2019)
  10. Gao, Xinwei: Comparison analysis of Ding’s RLWE-based key exchange protocol and NewHope variants (2019)
  11. Steinfeld, Ron; Sakzad, Amin; Zhao, Raymond K.: Practical (\mathsfMP\text- \mathsfLWE)-based encryption balancing security-risk versus efficiency (2019)
  12. Yang, Guomin; Chen, Rongmao; Mu, Yi; Susilo, Willy; Guo, Fuchun; Li, Jie: Strongly leakage resilient authenticated key exchange, revisited (2019)
  13. Zhang, Zhengyu; Wei, Puwen; Xue, Haiyang: Tighter security proofs for post-quantum key encapsulation mechanism in the multi-challenge setting (2019)
  14. Aggarwal, Divesh; Stephens-Davidowitz, Noah: Just take the average! An embarrassingly simple (2^n)-time algorithm for SVP (and CVP) (2018)
  15. Banegas, Gustavo; Barreto, Paulo S. L. M.; Boidje, Brice Odilon; Cayrel, Pierre-Louis; Dione, Gilbert Ndollane; Gaj, Kris; Gueye, Cheikh Thiécoumba; Haeussler, Richard; Klamti, Jean Belo; N’diaye, Ousmane; Nguyen, Duc Tri; Persichetti, Edoardo; Ricardini, Jefferson E.: DAGS: key encapsulation using dyadic GS codes (2018)
  16. Herold, Gottfried; Kirshanova, Elena; May, Alexander: On the asymptotic complexity of solving LWE (2018)
  17. Partala, Juha: Algebraic generalization of Diffie-Hellman key exchange (2018)