1d9e397b599b13d642138480a28c14db7a136bf0Adam Langley/* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com) 2d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * All rights reserved. 3d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 4d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * This package is an SSL implementation written 5d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * by Eric Young (eay@cryptsoft.com). 6d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * The implementation was written so as to conform with Netscapes SSL. 7d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 8d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * This library is free for commercial and non-commercial use as long as 9d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * the following conditions are aheared to. The following conditions 10d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * apply to all code found in this distribution, be it the RC4, RSA, 11d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * lhash, DES, etc., code; not just the SSL code. The SSL documentation 12d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * included with this distribution is covered by the same copyright terms 13d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * except that the holder is Tim Hudson (tjh@cryptsoft.com). 14d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 15d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * Copyright remains Eric Young's, and as such any Copyright notices in 16d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * the code are not to be removed. 17d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * If this package is used in a product, Eric Young should be given attribution 18d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * as the author of the parts of the library used. 19d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * This can be in the form of a textual message at program startup or 20d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * in documentation (online or textual) provided with the package. 21d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 22d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * Redistribution and use in source and binary forms, with or without 23d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * modification, are permitted provided that the following conditions 24d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * are met: 25d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 1. Redistributions of source code must retain the copyright 26d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * notice, this list of conditions and the following disclaimer. 27d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 2. Redistributions in binary form must reproduce the above copyright 28d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * notice, this list of conditions and the following disclaimer in the 29d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * documentation and/or other materials provided with the distribution. 30d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 3. All advertising materials mentioning features or use of this software 31d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * must display the following acknowledgement: 32d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * "This product includes cryptographic software written by 33d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * Eric Young (eay@cryptsoft.com)" 34d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * The word 'cryptographic' can be left out if the rouines from the library 35d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * being used are not cryptographic related :-). 36d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 4. If you include any Windows specific code (or a derivative thereof) from 37d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * the apps directory (application code) you must include an acknowledgement: 38d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" 39d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 40d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 41d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 42d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 43d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 44d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 45d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 46d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 47d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 48d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 49d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 50d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * SUCH DAMAGE. 51d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 52d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * The licence and distribution terms for any publically available version or 53d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * derivative of this code cannot be changed. i.e. this code cannot simply be 54d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * copied and put under another distribution licence 55d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * [including the GNU Public Licence.] 56d9e397b599b13d642138480a28c14db7a136bf0Adam Langley */ 57d9e397b599b13d642138480a28c14db7a136bf0Adam Langley/* ==================================================================== 58d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * Copyright (c) 1998-2006 The OpenSSL Project. All rights reserved. 59d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 60d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * Redistribution and use in source and binary forms, with or without 61d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * modification, are permitted provided that the following conditions 62d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * are met: 63d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 64d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 1. Redistributions of source code must retain the above copyright 65d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * notice, this list of conditions and the following disclaimer. 66d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 67d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 2. Redistributions in binary form must reproduce the above copyright 68d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * notice, this list of conditions and the following disclaimer in 69d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * the documentation and/or other materials provided with the 70d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * distribution. 71d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 72d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 3. All advertising materials mentioning features or use of this 73d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * software must display the following acknowledgment: 74d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * "This product includes software developed by the OpenSSL Project 75d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * for use in the OpenSSL Toolkit. (http://www.openssl.org/)" 76d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 77d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to 78d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * endorse or promote products derived from this software without 79d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * prior written permission. For written permission, please contact 80d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * openssl-core@openssl.org. 81d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 82d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 5. Products derived from this software may not be called "OpenSSL" 83d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * nor may "OpenSSL" appear in their names without prior written 84d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * permission of the OpenSSL Project. 85d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 86d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 6. Redistributions of any form whatsoever must retain the following 87d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * acknowledgment: 88d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * "This product includes software developed by the OpenSSL Project 89d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * for use in the OpenSSL Toolkit (http://www.openssl.org/)" 90d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 91d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY 92d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 93d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 94d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR 95d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 96d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 97d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 98d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 99d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, 100d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 101d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED 102d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * OF THE POSSIBILITY OF SUCH DAMAGE. 103d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * ==================================================================== 104d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 105d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * This product includes cryptographic software written by Eric Young 106d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * (eay@cryptsoft.com). This product includes software written by Tim 107d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * Hudson (tjh@cryptsoft.com). 108d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 109d9e397b599b13d642138480a28c14db7a136bf0Adam Langley */ 110d9e397b599b13d642138480a28c14db7a136bf0Adam Langley/* ==================================================================== 111d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED. 112d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 113d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * Portions of the attached software ("Contribution") are developed by 114d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project. 115d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 116d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * The Contribution is licensed pursuant to the Eric Young open source 117d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * license provided above. 118d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * 119d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * The binary polynomial arithmetic software is originally written by 120d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems 121d9e397b599b13d642138480a28c14db7a136bf0Adam Langley * Laboratories. */ 122d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 123d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#ifndef OPENSSL_HEADER_BN_INTERNAL_H 124d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#define OPENSSL_HEADER_BN_INTERNAL_H 125d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 126d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#include <openssl/base.h> 127d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 1284969cc9b0ab2905ec478277f50ed3849b37a6c6bDavid Benjamin#if defined(OPENSSL_X86_64) && defined(_MSC_VER) 1296e899c7d3f4c7bd6383a0ca171a50e95aa9d8e2dDavid BenjaminOPENSSL_MSVC_PRAGMA(warning(push, 3)) 130d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#include <intrin.h> 1316e899c7d3f4c7bd6383a0ca171a50e95aa9d8e2dDavid BenjaminOPENSSL_MSVC_PRAGMA(warning(pop)) 132d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#pragma intrinsic(__umulh, _umul128) 133d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#endif 134d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 1358ff035535f7cf2903f02bbe94d2fa10b7ab855f1Robert Sloan#include "../../internal.h" 1364969cc9b0ab2905ec478277f50ed3849b37a6c6bDavid Benjamin 137d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#if defined(__cplusplus) 138d9e397b599b13d642138480a28c14db7a136bf0Adam Langleyextern "C" { 139d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#endif 140d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 141d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#if defined(OPENSSL_64_BIT) 142d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 143558181089d69085101510906bd46e51ade9e20e9Robert Sloan#if defined(BORINGSSL_HAS_UINT128) 1448f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// MSVC doesn't support two-word integers on 64-bit. 145d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_ULLONG uint128_t 146558181089d69085101510906bd46e51ade9e20e9Robert Sloan#if defined(BORINGSSL_CAN_DIVIDE_UINT128) 147558181089d69085101510906bd46e51ade9e20e9Robert Sloan#define BN_CAN_DIVIDE_ULLONG 148558181089d69085101510906bd46e51ade9e20e9Robert Sloan#endif 149d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#endif 150d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 151d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_BITS2 64 152d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_BYTES 8 153d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_BITS4 32 154d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_MASK2 (0xffffffffffffffffUL) 155d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_MASK2l (0xffffffffUL) 156d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_MASK2h (0xffffffff00000000UL) 157d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_MASK2h1 (0xffffffff80000000UL) 158c895d6b1c580258e72e1ed3fcc86d38970ded9e1David Benjamin#define BN_MONT_CTX_N0_LIMBS 1 159d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_DEC_CONV (10000000000000000000UL) 160d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_DEC_NUM 19 161909b19f027eb0af12513f4d5589efdd67e34bd91Steven Valdez#define TOBN(hi, lo) ((BN_ULONG)(hi) << 32 | (lo)) 162d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 163d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#elif defined(OPENSSL_32_BIT) 164d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 165d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_ULLONG uint64_t 166558181089d69085101510906bd46e51ade9e20e9Robert Sloan#define BN_CAN_DIVIDE_ULLONG 167d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_BITS2 32 168d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_BYTES 4 169d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_BITS4 16 170d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_MASK2 (0xffffffffUL) 171d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_MASK2l (0xffffUL) 172d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_MASK2h1 (0xffff8000UL) 173d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_MASK2h (0xffff0000UL) 1748f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// On some 32-bit platforms, Montgomery multiplication is done using 64-bit 1758f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// arithmetic with SIMD instructions. On such platforms, |BN_MONT_CTX::n0| 1768f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// needs to be two words long. Only certain 32-bit platforms actually make use 1778f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// of n0[1] and shorter R value would suffice for the others. However, 1788f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// currently only the assembly files know which is which. 179c895d6b1c580258e72e1ed3fcc86d38970ded9e1David Benjamin#define BN_MONT_CTX_N0_LIMBS 2 180d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_DEC_CONV (1000000000UL) 181d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan#define BN_DEC_NUM 9 182909b19f027eb0af12513f4d5589efdd67e34bd91Steven Valdez#define TOBN(hi, lo) (lo), (hi) 183d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 184d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#else 185d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#error "Must define either OPENSSL_32_BIT or OPENSSL_64_BIT" 186d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#endif 187d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 1884139edb02e59e7ad48e0a8f4c02e45923bc8a344Adam Langley 18995add82835138f09cf7bb4a51c04c6320c241674David Benjamin#define STATIC_BIGNUM(x) \ 19095add82835138f09cf7bb4a51c04c6320c241674David Benjamin { \ 19195add82835138f09cf7bb4a51c04c6320c241674David Benjamin (BN_ULONG *)(x), sizeof(x) / sizeof(BN_ULONG), \ 19295add82835138f09cf7bb4a51c04c6320c241674David Benjamin sizeof(x) / sizeof(BN_ULONG), 0, BN_FLG_STATIC_DATA \ 1934139edb02e59e7ad48e0a8f4c02e45923bc8a344Adam Langley } 1944139edb02e59e7ad48e0a8f4c02e45923bc8a344Adam Langley 1954139edb02e59e7ad48e0a8f4c02e45923bc8a344Adam Langley#if defined(BN_ULLONG) 19629c1d2cf8620ad14e06d8e7ff91db8f4de04d481Robert Sloan#define Lw(t) ((BN_ULONG)(t)) 19729c1d2cf8620ad14e06d8e7ff91db8f4de04d481Robert Sloan#define Hw(t) ((BN_ULONG)((t) >> BN_BITS2)) 198d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#endif 199d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 2008542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// bn_minimal_width returns the minimal value of |bn->top| which fits the 2018542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// value of |bn|. 2028542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloanint bn_minimal_width(const BIGNUM *bn); 2038542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan 2048542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// bn_correct_top decrements |bn->top| to |bn_minimal_width|. If |bn| is zero, 2058542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// |bn->neg| is set to zero. 2069254e681d446a8105bd66f08bae1252d4d89a139Robert Sloanvoid bn_correct_top(BIGNUM *bn); 2079254e681d446a8105bd66f08bae1252d4d89a139Robert Sloan 2088f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// bn_wexpand ensures that |bn| has at least |words| works of space without 2098f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// altering its value. It returns one on success or zero on allocation 2108f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// failure. 2119254e681d446a8105bd66f08bae1252d4d89a139Robert Sloanint bn_wexpand(BIGNUM *bn, size_t words); 2129254e681d446a8105bd66f08bae1252d4d89a139Robert Sloan 2138f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// bn_expand acts the same as |bn_wexpand|, but takes a number of bits rather 2148f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// than a number of words. 2159254e681d446a8105bd66f08bae1252d4d89a139Robert Sloanint bn_expand(BIGNUM *bn, size_t bits); 2169254e681d446a8105bd66f08bae1252d4d89a139Robert Sloan 2178542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// bn_resize_words adjusts |bn->top| to be |words|. It returns one on success 2188542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// and zero on allocation error or if |bn|'s value is too large. 2198542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// 2208542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// Do not call this function outside of unit tests. Most functions currently 2218542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// require |BIGNUM|s be minimal. This function breaks that invariant. It is 2228542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// introduced early so the invariant may be relaxed incrementally. 2238542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloanint bn_resize_words(BIGNUM *bn, size_t words); 2248542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan 2258f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// bn_set_words sets |bn| to the value encoded in the |num| words in |words|, 2268f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// least significant word first. 2274969cc9b0ab2905ec478277f50ed3849b37a6c6bDavid Benjaminint bn_set_words(BIGNUM *bn, const BN_ULONG *words, size_t num); 2284969cc9b0ab2905ec478277f50ed3849b37a6c6bDavid Benjamin 2298542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// bn_fits_in_words returns one if |bn| may be represented in |num| words, plus 2308542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// a sign bit, and zero otherwise. 2318542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloanint bn_fits_in_words(const BIGNUM *bn, size_t num); 2328542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan 2338542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// bn_copy_words copies the value of |bn| to |out| and returns one if the value 2348542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// is representable in |num| words. Otherwise, it returns zero. 2358542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloanint bn_copy_words(BN_ULONG *out, size_t num, const BIGNUM *bn); 2368542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan 237d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// bn_mul_add_words multiples |ap| by |w|, adds the result to |rp|, and places 238d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// the result in |rp|. |ap| and |rp| must both be |num| words long. It returns 239d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// the carry word of the operation. |ap| and |rp| may be equal but otherwise may 240d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// not alias. 24199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert SloanBN_ULONG bn_mul_add_words(BN_ULONG *rp, const BN_ULONG *ap, size_t num, 242d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan BN_ULONG w); 243d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan 244d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// bn_mul_words multiples |ap| by |w| and places the result in |rp|. |ap| and 245d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// |rp| must both be |num| words long. It returns the carry word of the 246d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// operation. |ap| and |rp| may be equal but otherwise may not alias. 24799319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert SloanBN_ULONG bn_mul_words(BN_ULONG *rp, const BN_ULONG *ap, size_t num, BN_ULONG w); 248d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan 249d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// bn_sqr_words sets |rp[2*i]| and |rp[2*i+1]| to |ap[i]|'s square, for all |i| 250d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// up to |num|. |ap| is an array of |num| words and |rp| an array of |2*num| 251d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// words. |ap| and |rp| may not alias. 252d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// 253d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// This gives the contribution of the |ap[i]*ap[i]| terms when squaring |ap|. 25499319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanvoid bn_sqr_words(BN_ULONG *rp, const BN_ULONG *ap, size_t num); 255d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan 256d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// bn_add_words adds |ap| to |bp| and places the result in |rp|, each of which 257d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// are |num| words long. It returns the carry bit, which is one if the operation 258d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// overflowed and zero otherwise. Any pair of |ap|, |bp|, and |rp| may be equal 259d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// to each other but otherwise may not alias. 260d5c2215355e1ae960be386b0d69aed228102cdaeRobert SloanBN_ULONG bn_add_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp, 26199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan size_t num); 262d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan 263d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// bn_sub_words subtracts |bp| from |ap| and places the result in |rp|. It 264d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// returns the borrow bit, which is one if the computation underflowed and zero 265d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// otherwise. Any pair of |ap|, |bp|, and |rp| may be equal to each other but 266d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// otherwise may not alias. 267d5c2215355e1ae960be386b0d69aed228102cdaeRobert SloanBN_ULONG bn_sub_words(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp, 26899319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan size_t num); 269d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan 270d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// bn_mul_comba4 sets |r| to the product of |a| and |b|. 27199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanvoid bn_mul_comba4(BN_ULONG r[8], const BN_ULONG a[4], const BN_ULONG b[4]); 272d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan 273d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// bn_mul_comba8 sets |r| to the product of |a| and |b|. 27499319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanvoid bn_mul_comba8(BN_ULONG r[16], const BN_ULONG a[8], const BN_ULONG b[8]); 275d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan 276d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// bn_sqr_comba8 sets |r| to |a|^2. 277d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloanvoid bn_sqr_comba8(BN_ULONG r[16], const BN_ULONG a[4]); 278d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan 279d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloan// bn_sqr_comba4 sets |r| to |a|^2. 280d5c2215355e1ae960be386b0d69aed228102cdaeRobert Sloanvoid bn_sqr_comba4(BN_ULONG r[8], const BN_ULONG a[4]); 281d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 2828f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// bn_cmp_words returns a value less than, equal to or greater than zero if 2838f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// the, length |n|, array |a| is less than, equal to or greater than |b|. 284d9e397b599b13d642138480a28c14db7a136bf0Adam Langleyint bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n); 285d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 2868f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// bn_cmp_words returns a value less than, equal to or greater than zero if the 2878f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// array |a| is less than, equal to or greater than |b|. The arrays can be of 2888f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// different lengths: |cl| gives the minimum of the two lengths and |dl| gives 2898f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// the length of |a| minus the length of |b|. 290d9e397b599b13d642138480a28c14db7a136bf0Adam Langleyint bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl); 291d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 29299319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// bn_less_than_words returns one if |a| < |b| and zero otherwise, where |a| 29399319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// and |b| both are |len| words long. It runs in constant time. 29499319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanint bn_less_than_words(const BN_ULONG *a, const BN_ULONG *b, size_t len); 29599319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 29699319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// bn_in_range_words returns one if |min_inclusive| <= |a| < |max_exclusive|, 29799319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// where |a| and |max_exclusive| both are |len| words long. This function leaks 29899319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// which of [0, min_inclusive), [min_inclusive, max_exclusive), and 29999319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// [max_exclusive, 2^(BN_BITS2*len)) contains |a|, but otherwise the value of 30099319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// |a| is secret. 30199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanint bn_in_range_words(const BN_ULONG *a, BN_ULONG min_inclusive, 30299319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan const BN_ULONG *max_exclusive, size_t len); 30399319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 30499319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// bn_rand_range_words sets |out| to a uniformly distributed random number from 30599319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// |min_inclusive| to |max_exclusive|. Both |out| and |max_exclusive| are |len| 30699319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// words long. 30799319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// 30899319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// This function runs in time independent of the result, but |min_inclusive| and 30999319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// |max_exclusive| are public data. (Information about the range is unavoidably 31099319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// leaked by how many iterations it took to select a number.) 31199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanint bn_rand_range_words(BN_ULONG *out, BN_ULONG min_inclusive, 31299319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan const BN_ULONG *max_exclusive, size_t len, 31399319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan const uint8_t additional_data[32]); 31499319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 315d9e397b599b13d642138480a28c14db7a136bf0Adam Langleyint bn_mul_mont(BN_ULONG *rp, const BN_ULONG *ap, const BN_ULONG *bp, 316d9e397b599b13d642138480a28c14db7a136bf0Adam Langley const BN_ULONG *np, const BN_ULONG *n0, int num); 317d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 318c895d6b1c580258e72e1ed3fcc86d38970ded9e1David Benjaminuint64_t bn_mont_n0(const BIGNUM *n); 31969939df2891f62f7f00ff2ac275f1cd81a67454cRobert Sloanint bn_mod_exp_base_2_vartime(BIGNUM *r, unsigned p, const BIGNUM *n); 320c895d6b1c580258e72e1ed3fcc86d38970ded9e1David Benjamin 3214969cc9b0ab2905ec478277f50ed3849b37a6c6bDavid Benjamin#if defined(OPENSSL_X86_64) && defined(_MSC_VER) 3224969cc9b0ab2905ec478277f50ed3849b37a6c6bDavid Benjamin#define BN_UMULT_LOHI(low, high, a, b) ((low) = _umul128((a), (b), &(high))) 3234969cc9b0ab2905ec478277f50ed3849b37a6c6bDavid Benjamin#endif 324d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 3254969cc9b0ab2905ec478277f50ed3849b37a6c6bDavid Benjamin#if !defined(BN_ULLONG) && !defined(BN_UMULT_LOHI) 3264969cc9b0ab2905ec478277f50ed3849b37a6c6bDavid Benjamin#error "Either BN_ULLONG or BN_UMULT_LOHI must be defined on every platform." 327d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#endif 328d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 3298f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// bn_mod_inverse_prime sets |out| to the modular inverse of |a| modulo |p|, 3308f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// computed with Fermat's Little Theorem. It returns one on success and zero on 3318f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// error. If |mont_p| is NULL, one will be computed temporarily. 33269939df2891f62f7f00ff2ac275f1cd81a67454cRobert Sloanint bn_mod_inverse_prime(BIGNUM *out, const BIGNUM *a, const BIGNUM *p, 33369939df2891f62f7f00ff2ac275f1cd81a67454cRobert Sloan BN_CTX *ctx, const BN_MONT_CTX *mont_p); 33469939df2891f62f7f00ff2ac275f1cd81a67454cRobert Sloan 3358f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// bn_mod_inverse_secret_prime behaves like |bn_mod_inverse_prime| but uses 3368f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// |BN_mod_exp_mont_consttime| instead of |BN_mod_exp_mont| in hopes of 3378f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// protecting the exponent. 33869939df2891f62f7f00ff2ac275f1cd81a67454cRobert Sloanint bn_mod_inverse_secret_prime(BIGNUM *out, const BIGNUM *a, const BIGNUM *p, 33969939df2891f62f7f00ff2ac275f1cd81a67454cRobert Sloan BN_CTX *ctx, const BN_MONT_CTX *mont_p); 34069939df2891f62f7f00ff2ac275f1cd81a67454cRobert Sloan 3418f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// bn_jacobi returns the Jacobi symbol of |a| and |b| (which is -1, 0 or 1), or 3428f860b133896bf655e4342ecefe692d52df81d48Robert Sloan// -2 on error. 3432424d84dd6dbdc0d32a4c80e6810d168f722ce0bRobert Sloanint bn_jacobi(const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx); 3442424d84dd6dbdc0d32a4c80e6810d168f722ce0bRobert Sloan 34599319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// bn_is_bit_set_words returns one if bit |bit| is set in |a| and zero 34699319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// otherwise. 34799319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanint bn_is_bit_set_words(const BN_ULONG *a, size_t num, unsigned bit); 34899319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 3498542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// bn_one_to_montgomery sets |r| to one in Montgomery form. It returns one on 3508542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// success and zero on error. This function treats the bit width of the modulus 3518542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// as public. 3528542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloanint bn_one_to_montgomery(BIGNUM *r, const BN_MONT_CTX *mont, BN_CTX *ctx); 3538542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan 3548542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// bn_less_than_montgomery_R returns one if |bn| is less than the Montgomery R 3558542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// value for |mont| and zero otherwise. 3568542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloanint bn_less_than_montgomery_R(const BIGNUM *bn, const BN_MONT_CTX *mont); 3578542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan 35899319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 35999319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// Low-level operations for small numbers. 36099319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// 36199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// The following functions implement algorithms suitable for use with scalars 36299319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// and field elements in elliptic curves. They rely on the number being small 36399319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// both to stack-allocate various temporaries and because they do not implement 36499319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// optimizations useful for the larger values used in RSA. 36599319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 36699319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// BN_SMALL_MAX_WORDS is the largest size input these functions handle. This 36799319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// limit allows temporaries to be more easily stack-allocated. This limit is set 36899319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// to accommodate P-521. 36999319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan#if defined(OPENSSL_32_BIT) 37099319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan#define BN_SMALL_MAX_WORDS 17 37199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan#else 37299319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan#define BN_SMALL_MAX_WORDS 9 37399319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan#endif 37499319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 37599319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// bn_mul_small sets |r| to |a|*|b|. |num_r| must be |num_a| + |num_b|. |r| may 37699319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// not alias with |a| or |b|. This function returns one on success and zero if 37799319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// lengths are inconsistent. 37899319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanint bn_mul_small(BN_ULONG *r, size_t num_r, const BN_ULONG *a, size_t num_a, 37999319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan const BN_ULONG *b, size_t num_b); 38099319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 38199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// bn_sqr_small sets |r| to |a|^2. |num_a| must be at most |BN_SMALL_MAX_WORDS|. 38299319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// |num_r| must be |num_a|*2. |r| and |a| may not alias. This function returns 38399319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// one on success and zero on programmer error. 38499319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanint bn_sqr_small(BN_ULONG *r, size_t num_r, const BN_ULONG *a, size_t num_a); 38599319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 38699319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// In the following functions, the modulus must be at most |BN_SMALL_MAX_WORDS| 38799319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// words long. 38899319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 38999319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// bn_to_montgomery_small sets |r| to |a| translated to the Montgomery domain. 39099319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// |num_a| and |num_r| must be the length of the modulus, which is 39199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// |mont->N.top|. |a| must be fully reduced. This function returns one on 39299319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// success and zero if lengths are inconsistent. |r| and |a| may alias. 39399319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanint bn_to_montgomery_small(BN_ULONG *r, size_t num_r, const BN_ULONG *a, 39499319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan size_t num_a, const BN_MONT_CTX *mont); 39599319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 39699319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// bn_from_montgomery_small sets |r| to |a| translated out of the Montgomery 39799319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// domain. |num_r| must be the length of the modulus, which is |mont->N.top|. 39899319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// |a| must be at most |mont->N.top| * R and |num_a| must be at most 2 * 39999319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// |mont->N.top|. This function returns one on success and zero if lengths are 40099319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// inconsistent. |r| and |a| may alias. 40199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanint bn_from_montgomery_small(BN_ULONG *r, size_t num_r, const BN_ULONG *a, 40299319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan size_t num_a, const BN_MONT_CTX *mont); 40399319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 4048542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// bn_one_to_montgomery_small sets |r| to one in Montgomery form. It returns one 4058542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// on success and zero on error. |num_r| must be the length of the modulus, 4068542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// which is |mont->N.top|. This function treats the bit width of the modulus as 4078542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan// public. 4088542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloanint bn_one_to_montgomery_small(BN_ULONG *r, size_t num_r, 4098542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan const BN_MONT_CTX *mont); 4108542c08a00c332af2ebca2a0c64b8d4d5fbd4cd2Robert Sloan 41199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// bn_mod_mul_montgomery_small sets |r| to |a| * |b| mod |mont->N|. Both inputs 41299319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// and outputs are in the Montgomery domain. |num_r| must be the length of the 41399319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// modulus, which is |mont->N.top|. This function returns one on success and 41499319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// zero on internal error or inconsistent lengths. Any two of |r|, |a|, and |b| 41599319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// may alias. 41699319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// 41799319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// This function requires |a| * |b| < N * R, where N is the modulus and R is the 41899319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// Montgomery divisor, 2^(N.top * BN_BITS2). This should generally be satisfied 41999319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// by ensuring |a| and |b| are fully reduced, however ECDSA has one computation 42099319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// which requires the more general bound. 42199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanint bn_mod_mul_montgomery_small(BN_ULONG *r, size_t num_r, const BN_ULONG *a, 42299319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan size_t num_a, const BN_ULONG *b, size_t num_b, 42399319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan const BN_MONT_CTX *mont); 42499319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 42599319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// bn_mod_exp_mont_small sets |r| to |a|^|p| mod |mont->N|. It returns one on 42699319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// success and zero on programmer or internal error. Both inputs and outputs are 42799319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// in the Montgomery domain. |num_r| and |num_a| must be |mont->N.top|, which 42899319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// must be at most |BN_SMALL_MAX_WORDS|. |a| must be fully-reduced. This 42999319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// function runs in time independent of |a|, but |p| and |mont->N| are public 43099319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// values. 43199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// 43299319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// Note this function differs from |BN_mod_exp_mont| which uses Montgomery 43399319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// reduction but takes input and output outside the Montgomery domain. Combine 43499319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// this function with |bn_from_montgomery_small| and |bn_to_montgomery_small| 43599319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// if necessary. 43699319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanint bn_mod_exp_mont_small(BN_ULONG *r, size_t num_r, const BN_ULONG *a, 43799319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan size_t num_a, const BN_ULONG *p, size_t num_p, 43899319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan const BN_MONT_CTX *mont); 43999319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 44099319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// bn_mod_inverse_prime_mont_small sets |r| to |a|^-1 mod |mont->N|. |mont->N| 44199319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// must be a prime. |num_r| and |num_a| must be |mont->N.top|, which must be at 44299319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// most |BN_SMALL_MAX_WORDS|. |a| must be fully-reduced. This function runs in 44399319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan// time independent of |a|, but |mont->N| is a public value. 44499319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloanint bn_mod_inverse_prime_mont_small(BN_ULONG *r, size_t num_r, 44599319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan const BN_ULONG *a, size_t num_a, 44699319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan const BN_MONT_CTX *mont); 44799319a18ffbf8991a8e752b4b8dacc9d39cdbd31Robert Sloan 448d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 449d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#if defined(__cplusplus) 4508f860b133896bf655e4342ecefe692d52df81d48Robert Sloan} // extern C 451d9e397b599b13d642138480a28c14db7a136bf0Adam Langley#endif 452d9e397b599b13d642138480a28c14db7a136bf0Adam Langley 4538f860b133896bf655e4342ecefe692d52df81d48Robert Sloan#endif // OPENSSL_HEADER_BN_INTERNAL_H 454