f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * ***** BEGIN LICENSE BLOCK *****
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Version: MPL 1.1/GPL 2.0/LGPL 2.1
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * The contents of this file are subject to the Mozilla Public License Version
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * 1.1 (the "License"); you may not use this file except in compliance with
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * the License. You may obtain a copy of the License at
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Software distributed under the License is distributed on an "AS IS" basis,
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * for the specific language governing rights and limitations under the
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * The Original Code is the Multi-precision Binary Polynomial Arithmetic Library.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * The Initial Developer of the Original Code is
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Sun Microsystems, Inc.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Portions created by the Initial Developer are Copyright (C) 2003
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * the Initial Developer. All Rights Reserved.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Contributor(s):
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Sheueling Chang Shantz <sheueling.chang@sun.com> and
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Douglas Stebila <douglas@stebila.ca> of Sun Laboratories.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Alternatively, the contents of this file may be used under the terms of
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * either the GNU General Public License Version 2 or later (the "GPL"), or
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * in which case the provisions of the GPL or the LGPL are applicable instead
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * of those above. If you wish to allow use of your version of this file only
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * under the terms of either the GPL or the LGPL, and not to allow others to
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * use your version of this file under the terms of the MPL, indicate your
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * decision by deleting the provisions above and replace them with the notice
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * and other provisions required by the GPL or the LGPL. If you do not delete
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * the provisions above, a recipient may use your version of this file under
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * the terms of any one of the MPL, the GPL or the LGPL.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * ***** END LICENSE BLOCK ***** */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Copyright 2007 Sun Microsystems, Inc. All rights reserved.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Use is subject to license terms.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Sun elects to use this software under the MPL license.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers#pragma ident "%Z%%M% %I% %E% SMI"
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* Platform-specific macros for fast binary polynomial squaring. */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_gf2m_sqr_tb[(w) >> 28 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >> 24 & 0xF] << 16 | \
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_gf2m_sqr_tb[(w) >> 20 & 0xF] << 8 | mp_gf2m_sqr_tb[(w) >> 16 & 0xF]
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_gf2m_sqr_tb[(w) >> 12 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >> 8 & 0xF] << 16 | \
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_gf2m_sqr_tb[(w) >> 4 & 0xF] << 8 | mp_gf2m_sqr_tb[(w) & 0xF]
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_gf2m_sqr_tb[(w) >> 60 & 0xF] << 56 | mp_gf2m_sqr_tb[(w) >> 56 & 0xF] << 48 | \
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_gf2m_sqr_tb[(w) >> 52 & 0xF] << 40 | mp_gf2m_sqr_tb[(w) >> 48 & 0xF] << 32 | \
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_gf2m_sqr_tb[(w) >> 44 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >> 40 & 0xF] << 16 | \
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_gf2m_sqr_tb[(w) >> 36 & 0xF] << 8 | mp_gf2m_sqr_tb[(w) >> 32 & 0xF]
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_gf2m_sqr_tb[(w) >> 28 & 0xF] << 56 | mp_gf2m_sqr_tb[(w) >> 24 & 0xF] << 48 | \
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_gf2m_sqr_tb[(w) >> 20 & 0xF] << 40 | mp_gf2m_sqr_tb[(w) >> 16 & 0xF] << 32 | \
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_gf2m_sqr_tb[(w) >> 12 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >> 8 & 0xF] << 16 | \
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_gf2m_sqr_tb[(w) >> 4 & 0xF] << 8 | mp_gf2m_sqr_tb[(w) & 0xF]
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* Multiply two binary polynomials mp_digits a, b.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Result is a polynomial with degree < 2 * MP_DIGIT_BITS - 1.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Output in two mp_digits rh, rl.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersvoid s_bmul_1x1(mp_digit *rh, mp_digit *rl, const mp_digit a, const mp_digit b);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* Compute xor-multiply of two binary polynomials (a1, a0) x (b1, b0)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * result is a binary polynomial in 4 mp_digits r[4].
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * The caller MUST ensure that r has the right amount of space allocated.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersvoid s_bmul_2x2(mp_digit *r, const mp_digit a1, const mp_digit a0, const mp_digit b1,
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* Compute xor-multiply of two binary polynomials (a2, a1, a0) x (b2, b1, b0)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * result is a binary polynomial in 6 mp_digits r[6].
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * The caller MUST ensure that r has the right amount of space allocated.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersvoid s_bmul_3x3(mp_digit *r, const mp_digit a2, const mp_digit a1, const mp_digit a0,
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers const mp_digit b2, const mp_digit b1, const mp_digit b0);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* Compute xor-multiply of two binary polynomials (a3, a2, a1, a0) x (b3, b2, b1, b0)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * result is a binary polynomial in 8 mp_digits r[8].
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * The caller MUST ensure that r has the right amount of space allocated.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersvoid s_bmul_4x4(mp_digit *r, const mp_digit a3, const mp_digit a2, const mp_digit a1,
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers const mp_digit a0, const mp_digit b3, const mp_digit b2, const mp_digit b1,
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers#endif /* _MP_GF2M_PRIV_H_ */