aboutsummaryrefslogtreecommitdiffstats
path: root/contrib/restricted/aws/s2n/pq-crypto/kyber_r2/cbd.c
blob: 4e86526aaa507f9b99f5c49e251d82191d8e5b7a (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include "cbd.h" 
#include "params.h" 
 
#include <stddef.h> 
#include <stdint.h> 
 
/************************************************* 
* Name:        load32_littleendian 
* 
* Description: load bytes into a 32-bit integer 
*              in little-endian order 
* 
* Arguments:   - const uint8_t *x: pointer to input byte array 
* 
* Returns 32-bit unsigned integer loaded from x 
**************************************************/ 
static uint32_t load32_littleendian(const uint8_t *x) { 
    uint32_t r; 
    r  = (uint32_t)x[0]; 
    r |= (uint32_t)x[1] << 8; 
    r |= (uint32_t)x[2] << 16; 
    r |= (uint32_t)x[3] << 24; 
    return r; 
} 
 
/************************************************* 
* Name:        cbd 
* 
* Description: Given an array of uniformly random bytes, compute 
*              polynomial with coefficients distributed according to 
*              a centered binomial distribution with parameter KYBER_ETA 
*              specialized for KYBER_ETA=2 
* 
* Arguments:   - poly *r:                  pointer to output polynomial 
*              - const uint8_t *buf: pointer to input byte array 
**************************************************/ 
void PQCLEAN_KYBER512_CLEAN_cbd(poly *r, const uint8_t *buf) { 
    int16_t a, b; 
 
    for (size_t i = 0; i < KYBER_N / 8; i++) { 
        uint32_t t = load32_littleendian(buf + 4 * i); 
        uint32_t d  = t & 0x55555555; 
        d += (t >> 1) & 0x55555555; 
 
        for (size_t j = 0; j < 8; j++) { 
            a = (d >>  4 * j)      & 0x3; 
            b = (d >> (4 * j + 2)) & 0x3; 
            r->coeffs[8 * i + j] = a - b; 
        } 
    } 
}