Ouroboros-E: An Efficient Lattice-based Key-Exchange Protocol

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

Standard

Ouroboros-E : An Efficient Lattice-based Key-Exchange Protocol. / Deneuville, Jean Christophe; Gaborit, Philippe; Guo, Qian; Johansson, Thomas.

2018 IEEE International Symposium on Information Theory, ISIT 2018. Vol. 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. p. 1450-1454 8437940.

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

Harvard

Deneuville, JC, Gaborit, P, Guo, Q & Johansson, T 2018, Ouroboros-E: An Efficient Lattice-based Key-Exchange Protocol. in 2018 IEEE International Symposium on Information Theory, ISIT 2018. vol. 2018-June, 8437940, Institute of Electrical and Electronics Engineers Inc., pp. 1450-1454, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 2018/06/17. https://doi.org/10.1109/ISIT.2018.8437940

APA

Deneuville, J. C., Gaborit, P., Guo, Q., & Johansson, T. (2018). Ouroboros-E: An Efficient Lattice-based Key-Exchange Protocol. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (Vol. 2018-June, pp. 1450-1454). [8437940] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437940

CBE

Deneuville JC, Gaborit P, Guo Q, Johansson T. 2018. Ouroboros-E: An Efficient Lattice-based Key-Exchange Protocol. In 2018 IEEE International Symposium on Information Theory, ISIT 2018. Institute of Electrical and Electronics Engineers Inc. pp. 1450-1454. https://doi.org/10.1109/ISIT.2018.8437940

MLA

Deneuville, Jean Christophe et al. "Ouroboros-E: An Efficient Lattice-based Key-Exchange Protocol". 2018 IEEE International Symposium on Information Theory, ISIT 2018. Institute of Electrical and Electronics Engineers Inc. 2018, 1450-1454. https://doi.org/10.1109/ISIT.2018.8437940

Vancouver

Deneuville JC, Gaborit P, Guo Q, Johansson T. Ouroboros-E: An Efficient Lattice-based Key-Exchange Protocol. In 2018 IEEE International Symposium on Information Theory, ISIT 2018. Vol. 2018-June. Institute of Electrical and Electronics Engineers Inc. 2018. p. 1450-1454. 8437940 https://doi.org/10.1109/ISIT.2018.8437940

Author

Deneuville, Jean Christophe ; Gaborit, Philippe ; Guo, Qian ; Johansson, Thomas. / Ouroboros-E : An Efficient Lattice-based Key-Exchange Protocol. 2018 IEEE International Symposium on Information Theory, ISIT 2018. Vol. 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. pp. 1450-1454

RIS

TY - GEN

T1 - Ouroboros-E

T2 - An Efficient Lattice-based Key-Exchange Protocol

AU - Deneuville, Jean Christophe

AU - Gaborit, Philippe

AU - Guo, Qian

AU - Johansson, Thomas

PY - 2018/8/15

Y1 - 2018/8/15

N2 - The Bit Flipping algorithm is a hard decision decoding algorithm originally designed by Gallager in 1962 to decode Low Density Parity Check Codes (LDPC). It has recently proved to be much more versatile, for Moderate Parity Check Codes (MDPC) or Euclidean metric. We further demonstrate its power by proposing a noisy Euclidean version of it. This tweak allows to construct a lattice based key exchange analogous to the Ouroboros protocol for Hamming metric but with a reduction to the Short Integer Solution (SIS) problem. The very efficient decoding algorithm permits to consider smaller alphabets than for NTRU or Ring-LWE decryption algorithms. Overall we obtain a new protocol which competes with the recent NEWHOPE and Kyber proposals, and also with NTRU. The resulting scheme exploits the cyclicity of the error, and benefits from the security of the renowned SIS problem.

AB - The Bit Flipping algorithm is a hard decision decoding algorithm originally designed by Gallager in 1962 to decode Low Density Parity Check Codes (LDPC). It has recently proved to be much more versatile, for Moderate Parity Check Codes (MDPC) or Euclidean metric. We further demonstrate its power by proposing a noisy Euclidean version of it. This tweak allows to construct a lattice based key exchange analogous to the Ouroboros protocol for Hamming metric but with a reduction to the Short Integer Solution (SIS) problem. The very efficient decoding algorithm permits to consider smaller alphabets than for NTRU or Ring-LWE decryption algorithms. Overall we obtain a new protocol which competes with the recent NEWHOPE and Kyber proposals, and also with NTRU. The resulting scheme exploits the cyclicity of the error, and benefits from the security of the renowned SIS problem.

U2 - 10.1109/ISIT.2018.8437940

DO - 10.1109/ISIT.2018.8437940

M3 - Paper in conference proceeding

SN - 9781538647806

VL - 2018-June

SP - 1450

EP - 1454

BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -