1f9fbec18Smcpowers /* 2f9fbec18Smcpowers * ***** BEGIN LICENSE BLOCK ***** 3f9fbec18Smcpowers * Version: MPL 1.1/GPL 2.0/LGPL 2.1 4f9fbec18Smcpowers * 5f9fbec18Smcpowers * The contents of this file are subject to the Mozilla Public License Version 6f9fbec18Smcpowers * 1.1 (the "License"); you may not use this file except in compliance with 7f9fbec18Smcpowers * the License. You may obtain a copy of the License at 8f9fbec18Smcpowers * http://www.mozilla.org/MPL/ 9f9fbec18Smcpowers * 10f9fbec18Smcpowers * Software distributed under the License is distributed on an "AS IS" basis, 11f9fbec18Smcpowers * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License 12f9fbec18Smcpowers * for the specific language governing rights and limitations under the 13f9fbec18Smcpowers * License. 14f9fbec18Smcpowers * 15f9fbec18Smcpowers * The Original Code is the Multi-precision Binary Polynomial Arithmetic Library. 16f9fbec18Smcpowers * 17f9fbec18Smcpowers * The Initial Developer of the Original Code is 18f9fbec18Smcpowers * Sun Microsystems, Inc. 19f9fbec18Smcpowers * Portions created by the Initial Developer are Copyright (C) 2003 20f9fbec18Smcpowers * the Initial Developer. All Rights Reserved. 21f9fbec18Smcpowers * 22f9fbec18Smcpowers * Contributor(s): 23f9fbec18Smcpowers * Sheueling Chang Shantz <sheueling.chang@sun.com> and 24f9fbec18Smcpowers * Douglas Stebila <douglas@stebila.ca> of Sun Laboratories. 25f9fbec18Smcpowers * 26f9fbec18Smcpowers * Alternatively, the contents of this file may be used under the terms of 27f9fbec18Smcpowers * either the GNU General Public License Version 2 or later (the "GPL"), or 28f9fbec18Smcpowers * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), 29f9fbec18Smcpowers * in which case the provisions of the GPL or the LGPL are applicable instead 30f9fbec18Smcpowers * of those above. If you wish to allow use of your version of this file only 31f9fbec18Smcpowers * under the terms of either the GPL or the LGPL, and not to allow others to 32f9fbec18Smcpowers * use your version of this file under the terms of the MPL, indicate your 33f9fbec18Smcpowers * decision by deleting the provisions above and replace them with the notice 34f9fbec18Smcpowers * and other provisions required by the GPL or the LGPL. If you do not delete 35f9fbec18Smcpowers * the provisions above, a recipient may use your version of this file under 36f9fbec18Smcpowers * the terms of any one of the MPL, the GPL or the LGPL. 37f9fbec18Smcpowers * 38f9fbec18Smcpowers * ***** END LICENSE BLOCK ***** */ 39f9fbec18Smcpowers /* 40f9fbec18Smcpowers * Copyright 2007 Sun Microsystems, Inc. All rights reserved. 41f9fbec18Smcpowers * Use is subject to license terms. 42f9fbec18Smcpowers * 43f9fbec18Smcpowers * Sun elects to use this software under the MPL license. 44f9fbec18Smcpowers */ 45f9fbec18Smcpowers 46f9fbec18Smcpowers #ifndef _MP_GF2M_PRIV_H_ 47f9fbec18Smcpowers #define _MP_GF2M_PRIV_H_ 48f9fbec18Smcpowers 49f9fbec18Smcpowers #include "mpi-priv.h" 50f9fbec18Smcpowers 51f9fbec18Smcpowers extern const mp_digit mp_gf2m_sqr_tb[16]; 52f9fbec18Smcpowers 53f9fbec18Smcpowers #if defined(MP_USE_UINT_DIGIT) 54f9fbec18Smcpowers #define MP_DIGIT_BITS 32 55f9fbec18Smcpowers #else 56f9fbec18Smcpowers #define MP_DIGIT_BITS 64 57f9fbec18Smcpowers #endif 58f9fbec18Smcpowers 59f9fbec18Smcpowers /* Platform-specific macros for fast binary polynomial squaring. */ 60f9fbec18Smcpowers #if MP_DIGIT_BITS == 32 61f9fbec18Smcpowers #define gf2m_SQR1(w) \ 62f9fbec18Smcpowers mp_gf2m_sqr_tb[(w) >> 28 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >> 24 & 0xF] << 16 | \ 63f9fbec18Smcpowers mp_gf2m_sqr_tb[(w) >> 20 & 0xF] << 8 | mp_gf2m_sqr_tb[(w) >> 16 & 0xF] 64f9fbec18Smcpowers #define gf2m_SQR0(w) \ 65f9fbec18Smcpowers mp_gf2m_sqr_tb[(w) >> 12 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >> 8 & 0xF] << 16 | \ 66f9fbec18Smcpowers mp_gf2m_sqr_tb[(w) >> 4 & 0xF] << 8 | mp_gf2m_sqr_tb[(w) & 0xF] 67f9fbec18Smcpowers #else 68f9fbec18Smcpowers #define gf2m_SQR1(w) \ 69f9fbec18Smcpowers mp_gf2m_sqr_tb[(w) >> 60 & 0xF] << 56 | mp_gf2m_sqr_tb[(w) >> 56 & 0xF] << 48 | \ 70f9fbec18Smcpowers mp_gf2m_sqr_tb[(w) >> 52 & 0xF] << 40 | mp_gf2m_sqr_tb[(w) >> 48 & 0xF] << 32 | \ 71f9fbec18Smcpowers mp_gf2m_sqr_tb[(w) >> 44 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >> 40 & 0xF] << 16 | \ 72f9fbec18Smcpowers mp_gf2m_sqr_tb[(w) >> 36 & 0xF] << 8 | mp_gf2m_sqr_tb[(w) >> 32 & 0xF] 73f9fbec18Smcpowers #define gf2m_SQR0(w) \ 74f9fbec18Smcpowers mp_gf2m_sqr_tb[(w) >> 28 & 0xF] << 56 | mp_gf2m_sqr_tb[(w) >> 24 & 0xF] << 48 | \ 75f9fbec18Smcpowers mp_gf2m_sqr_tb[(w) >> 20 & 0xF] << 40 | mp_gf2m_sqr_tb[(w) >> 16 & 0xF] << 32 | \ 76f9fbec18Smcpowers mp_gf2m_sqr_tb[(w) >> 12 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >> 8 & 0xF] << 16 | \ 77f9fbec18Smcpowers mp_gf2m_sqr_tb[(w) >> 4 & 0xF] << 8 | mp_gf2m_sqr_tb[(w) & 0xF] 78f9fbec18Smcpowers #endif 79f9fbec18Smcpowers 80f9fbec18Smcpowers /* Multiply two binary polynomials mp_digits a, b. 81f9fbec18Smcpowers * Result is a polynomial with degree < 2 * MP_DIGIT_BITS - 1. 82f9fbec18Smcpowers * Output in two mp_digits rh, rl. 83f9fbec18Smcpowers */ 84f9fbec18Smcpowers void s_bmul_1x1(mp_digit *rh, mp_digit *rl, const mp_digit a, const mp_digit b); 85f9fbec18Smcpowers 86*c40a6cd7SToomas Soome /* Compute xor-multiply of two binary polynomials (a1, a0) x (b1, b0) 87f9fbec18Smcpowers * result is a binary polynomial in 4 mp_digits r[4]. 88f9fbec18Smcpowers * The caller MUST ensure that r has the right amount of space allocated. 89f9fbec18Smcpowers */ 90f9fbec18Smcpowers void s_bmul_2x2(mp_digit *r, const mp_digit a1, const mp_digit a0, const mp_digit b1, 91f9fbec18Smcpowers const mp_digit b0); 92f9fbec18Smcpowers 93*c40a6cd7SToomas Soome /* Compute xor-multiply of two binary polynomials (a2, a1, a0) x (b2, b1, b0) 94f9fbec18Smcpowers * result is a binary polynomial in 6 mp_digits r[6]. 95f9fbec18Smcpowers * The caller MUST ensure that r has the right amount of space allocated. 96f9fbec18Smcpowers */ 97*c40a6cd7SToomas Soome void s_bmul_3x3(mp_digit *r, const mp_digit a2, const mp_digit a1, const mp_digit a0, 98f9fbec18Smcpowers const mp_digit b2, const mp_digit b1, const mp_digit b0); 99f9fbec18Smcpowers 100*c40a6cd7SToomas Soome /* Compute xor-multiply of two binary polynomials (a3, a2, a1, a0) x (b3, b2, b1, b0) 101f9fbec18Smcpowers * result is a binary polynomial in 8 mp_digits r[8]. 102f9fbec18Smcpowers * The caller MUST ensure that r has the right amount of space allocated. 103f9fbec18Smcpowers */ 104*c40a6cd7SToomas Soome void s_bmul_4x4(mp_digit *r, const mp_digit a3, const mp_digit a2, const mp_digit a1, 105*c40a6cd7SToomas Soome const mp_digit a0, const mp_digit b3, const mp_digit b2, const mp_digit b1, 106f9fbec18Smcpowers const mp_digit b0); 107f9fbec18Smcpowers 108f9fbec18Smcpowers #endif /* _MP_GF2M_PRIV_H_ */ 109