On the Performance and Security of Multiplication in GF(2N)
Multiplications in G F ( 2 N ) can be securely optimized for cryptographic applications when the integer N is small and does not match machine words (i.e., N < 32 ). In this paper, we present a set of optimizations applied to DAGS, a code-based post-quantum cryptographic algo...
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-09-01
|
| Series: | Cryptography |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2410-387X/2/3/25 |
| _version_ | 1798042157526810624 |
|---|---|
| author | Jean-Luc Danger Youssef El Housni Adrien Facon Cheikh T. Gueye Sylvain Guilley Sylvie Herbel Ousmane Ndiaye Edoardo Persichetti Alexander Schaub |
| author_facet | Jean-Luc Danger Youssef El Housni Adrien Facon Cheikh T. Gueye Sylvain Guilley Sylvie Herbel Ousmane Ndiaye Edoardo Persichetti Alexander Schaub |
| author_sort | Jean-Luc Danger |
| collection | DOAJ |
| description | Multiplications in G F ( 2 N ) can be securely optimized for cryptographic applications when the integer N is small and does not match machine words (i.e., N < 32 ). In this paper, we present a set of optimizations applied to DAGS, a code-based post-quantum cryptographic algorithm and one of the submissions to the National Institute of Standards and Technology’s (NIST) Post-Quantum Cryptography (PQC) standardization call. |
| first_indexed | 2024-04-11T22:31:36Z |
| format | Article |
| id | doaj.art-f0e6d347750c4e619f3fed11a1c882d8 |
| institution | Directory Open Access Journal |
| issn | 2410-387X |
| language | English |
| last_indexed | 2024-04-11T22:31:36Z |
| publishDate | 2018-09-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Cryptography |
| spelling | doaj.art-f0e6d347750c4e619f3fed11a1c882d82022-12-22T03:59:22ZengMDPI AGCryptography2410-387X2018-09-01232510.3390/cryptography2030025cryptography2030025On the Performance and Security of Multiplication in GF(2N)Jean-Luc Danger0Youssef El Housni1Adrien Facon2Cheikh T. Gueye3Sylvain Guilley4Sylvie Herbel5Ousmane Ndiaye6Edoardo Persichetti7Alexander Schaub8LTCI, Télécom ParisTech, Université Paris-Saclay, 75013 Paris, FranceSecure-IC S.A.S., 35510 Cesson-Sévigné, FranceSecure-IC S.A.S., 35510 Cesson-Sévigné, FranceDépartement Mathématique et Informatique, Université Cheikh Anta Diop, Dakar 5005, SenegalLTCI, Télécom ParisTech, Université Paris-Saclay, 75013 Paris, FranceSecure-IC S.A.S., 35510 Cesson-Sévigné, FranceDépartement Mathématique et Informatique, Université Cheikh Anta Diop, Dakar 5005, SenegalDepartment of Mathematical Sciences, Florida Atlantic University, Boca Raton, FL 33431, USALTCI, Télécom ParisTech, Université Paris-Saclay, 75013 Paris, FranceMultiplications in G F ( 2 N ) can be securely optimized for cryptographic applications when the integer N is small and does not match machine words (i.e., N < 32 ). In this paper, we present a set of optimizations applied to DAGS, a code-based post-quantum cryptographic algorithm and one of the submissions to the National Institute of Standards and Technology’s (NIST) Post-Quantum Cryptography (PQC) standardization call.http://www.mdpi.com/2410-387X/2/3/25finite field arithmetictower fieldspost-quantum cryptographycode-based cryptographycache-timing attackssecure implementation |
| spellingShingle | Jean-Luc Danger Youssef El Housni Adrien Facon Cheikh T. Gueye Sylvain Guilley Sylvie Herbel Ousmane Ndiaye Edoardo Persichetti Alexander Schaub On the Performance and Security of Multiplication in GF(2N) Cryptography finite field arithmetic tower fields post-quantum cryptography code-based cryptography cache-timing attacks secure implementation |
| title | On the Performance and Security of Multiplication in GF(2N) |
| title_full | On the Performance and Security of Multiplication in GF(2N) |
| title_fullStr | On the Performance and Security of Multiplication in GF(2N) |
| title_full_unstemmed | On the Performance and Security of Multiplication in GF(2N) |
| title_short | On the Performance and Security of Multiplication in GF(2N) |
| title_sort | on the performance and security of multiplication in gf 2n |
| topic | finite field arithmetic tower fields post-quantum cryptography code-based cryptography cache-timing attacks secure implementation |
| url | http://www.mdpi.com/2410-387X/2/3/25 |
| work_keys_str_mv | AT jeanlucdanger ontheperformanceandsecurityofmultiplicationingf2n AT youssefelhousni ontheperformanceandsecurityofmultiplicationingf2n AT adrienfacon ontheperformanceandsecurityofmultiplicationingf2n AT cheikhtgueye ontheperformanceandsecurityofmultiplicationingf2n AT sylvainguilley ontheperformanceandsecurityofmultiplicationingf2n AT sylvieherbel ontheperformanceandsecurityofmultiplicationingf2n AT ousmanendiaye ontheperformanceandsecurityofmultiplicationingf2n AT edoardopersichetti ontheperformanceandsecurityofmultiplicationingf2n AT alexanderschaub ontheperformanceandsecurityofmultiplicationingf2n |