michael@0: /* This Source Code Form is subject to the terms of the Mozilla Public
michael@0:  * License, v. 2.0. If a copy of the MPL was not distributed with this
michael@0:  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0: 
michael@0: #ifndef _MP_GF2M_PRIV_H_
michael@0: #define _MP_GF2M_PRIV_H_
michael@0: 
michael@0: #include "mpi-priv.h"
michael@0: 
michael@0: extern const mp_digit mp_gf2m_sqr_tb[16];
michael@0: 
michael@0: #if defined(MP_USE_UINT_DIGIT)
michael@0: #define MP_DIGIT_BITS 32
michael@0: /* enable fast divide and mod operations on MP_DIGIT_BITS */
michael@0: #define MP_DIGIT_BITS_LOG_2 5
michael@0: #define MP_DIGIT_BITS_MASK 0x1f
michael@0: #else
michael@0: #define MP_DIGIT_BITS 64
michael@0: /* enable fast divide and mod operations on MP_DIGIT_BITS */
michael@0: #define MP_DIGIT_BITS_LOG_2 6
michael@0: #define MP_DIGIT_BITS_MASK 0x3f
michael@0: #endif
michael@0: 
michael@0: /* Platform-specific macros for fast binary polynomial squaring. */
michael@0: #if MP_DIGIT_BITS == 32
michael@0: #define gf2m_SQR1(w) \
michael@0:     mp_gf2m_sqr_tb[(w) >> 28 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >> 24 & 0xF] << 16 | \
michael@0:     mp_gf2m_sqr_tb[(w) >> 20 & 0xF] <<  8 | mp_gf2m_sqr_tb[(w) >> 16 & 0xF]
michael@0: #define gf2m_SQR0(w) \
michael@0:     mp_gf2m_sqr_tb[(w) >> 12 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >>  8 & 0xF] << 16 | \
michael@0:     mp_gf2m_sqr_tb[(w) >>  4 & 0xF] <<  8 | mp_gf2m_sqr_tb[(w)       & 0xF]
michael@0: #else
michael@0: #define gf2m_SQR1(w) \
michael@0:     mp_gf2m_sqr_tb[(w) >> 60 & 0xF] << 56 | mp_gf2m_sqr_tb[(w) >> 56 & 0xF] << 48 | \
michael@0:     mp_gf2m_sqr_tb[(w) >> 52 & 0xF] << 40 | mp_gf2m_sqr_tb[(w) >> 48 & 0xF] << 32 | \
michael@0:     mp_gf2m_sqr_tb[(w) >> 44 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >> 40 & 0xF] << 16 | \
michael@0:     mp_gf2m_sqr_tb[(w) >> 36 & 0xF] <<  8 | mp_gf2m_sqr_tb[(w) >> 32 & 0xF]
michael@0: #define gf2m_SQR0(w) \
michael@0:     mp_gf2m_sqr_tb[(w) >> 28 & 0xF] << 56 | mp_gf2m_sqr_tb[(w) >> 24 & 0xF] << 48 | \
michael@0:     mp_gf2m_sqr_tb[(w) >> 20 & 0xF] << 40 | mp_gf2m_sqr_tb[(w) >> 16 & 0xF] << 32 | \
michael@0:     mp_gf2m_sqr_tb[(w) >> 12 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >>  8 & 0xF] << 16 | \
michael@0:     mp_gf2m_sqr_tb[(w) >>  4 & 0xF] <<  8 | mp_gf2m_sqr_tb[(w)       & 0xF]
michael@0: #endif
michael@0: 
michael@0: /* Multiply two binary polynomials mp_digits a, b.
michael@0:  * Result is a polynomial with degree < 2 * MP_DIGIT_BITS - 1.
michael@0:  * Output in two mp_digits rh, rl.
michael@0:  */
michael@0: void s_bmul_1x1(mp_digit *rh, mp_digit *rl, const mp_digit a, const mp_digit b);
michael@0: 
michael@0: /* Compute xor-multiply of two binary polynomials  (a1, a0) x (b1, b0)  
michael@0:  * result is a binary polynomial in 4 mp_digits r[4].
michael@0:  * The caller MUST ensure that r has the right amount of space allocated.
michael@0:  */
michael@0: void s_bmul_2x2(mp_digit *r, const mp_digit a1, const mp_digit a0, const mp_digit b1,
michael@0: 	const mp_digit b0);
michael@0: 
michael@0: /* Compute xor-multiply of two binary polynomials  (a2, a1, a0) x (b2, b1, b0)  
michael@0:  * result is a binary polynomial in 6 mp_digits r[6].
michael@0:  * The caller MUST ensure that r has the right amount of space allocated.
michael@0:  */
michael@0: void s_bmul_3x3(mp_digit *r, const mp_digit a2, const mp_digit a1, const mp_digit a0, 
michael@0: 	const mp_digit b2, const mp_digit b1, const mp_digit b0);
michael@0: 
michael@0: /* Compute xor-multiply of two binary polynomials  (a3, a2, a1, a0) x (b3, b2, b1, b0)  
michael@0:  * result is a binary polynomial in 8 mp_digits r[8].
michael@0:  * The caller MUST ensure that r has the right amount of space allocated.
michael@0:  */
michael@0: void s_bmul_4x4(mp_digit *r, const mp_digit a3, const mp_digit a2, const mp_digit a1, 
michael@0: 	const mp_digit a0, const mp_digit b3, const mp_digit b2, const mp_digit b1, 
michael@0: 	const mp_digit b0);
michael@0: 
michael@0: #endif /* _MP_GF2M_PRIV_H_ */