mirror of
https://github.com/guanzhi/GmSSL.git
synced 2026-08-10 16:03:48 +08:00
add sm2_standard
This commit is contained in:
[GGSuchao]
245
crypto/sm2/miracl/mrbits.c
Normal file
245
crypto/sm2/miracl/mrbits.c
Normal file
@@ -0,0 +1,245 @@
|
||||
|
||||
/***************************************************************************
|
||||
*
|
||||
Copyright 2013 CertiVox IOM Ltd. *
|
||||
*
|
||||
This file is part of CertiVox MIRACL Crypto SDK. *
|
||||
*
|
||||
The CertiVox MIRACL Crypto SDK provides developers with an *
|
||||
extensive and efficient set of cryptographic functions. *
|
||||
For further information about its features and functionalities please *
|
||||
refer to http://www.certivox.com *
|
||||
*
|
||||
* The CertiVox MIRACL Crypto SDK is free software: you can *
|
||||
redistribute it and/or modify it under the terms of the *
|
||||
GNU Affero General Public License as published by the *
|
||||
Free Software Foundation, either version 3 of the License, *
|
||||
or (at your option) any later version. *
|
||||
*
|
||||
* The CertiVox MIRACL Crypto SDK is distributed in the hope *
|
||||
that it will be useful, but WITHOUT ANY WARRANTY; without even the *
|
||||
implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. *
|
||||
See the GNU Affero General Public License for more details. *
|
||||
*
|
||||
* You should have received a copy of the GNU Affero General Public *
|
||||
License along with CertiVox MIRACL Crypto SDK. *
|
||||
If not, see <http://www.gnu.org/licenses/>. *
|
||||
*
|
||||
You can be released from the requirements of the license by purchasing *
|
||||
a commercial license. Buying such a license is mandatory as soon as you *
|
||||
develop commercial activities involving the CertiVox MIRACL Crypto SDK *
|
||||
without disclosing the source code of your own applications, or shipping *
|
||||
the CertiVox MIRACL Crypto SDK with a closed source product. *
|
||||
*
|
||||
***************************************************************************/
|
||||
/*
|
||||
* MIRACL bit manipulation routines
|
||||
* mrbits.c
|
||||
*/
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <openssl/miracl.h>
|
||||
|
||||
#ifdef MR_FP
|
||||
#include <math.h>
|
||||
#endif
|
||||
|
||||
int logb2(_MIPD_ big x)
|
||||
{ /* returns number of bits in x */
|
||||
int xl,lg2;
|
||||
mr_small top;
|
||||
#ifdef MR_OS_THREADS
|
||||
miracl *mr_mip=get_mip();
|
||||
#endif
|
||||
if (mr_mip->ERNUM || size(x)==0) return 0;
|
||||
|
||||
MR_IN(49)
|
||||
|
||||
|
||||
#ifndef MR_ALWAYS_BINARY
|
||||
if (mr_mip->base==mr_mip->base2)
|
||||
{
|
||||
#endif
|
||||
xl=(int)(x->len&MR_OBITS);
|
||||
lg2=mr_mip->lg2b*(xl-1);
|
||||
top=x->w[xl-1];
|
||||
while (top>=1)
|
||||
{
|
||||
lg2++;
|
||||
top/=2;
|
||||
}
|
||||
|
||||
#ifndef MR_ALWAYS_BINARY
|
||||
}
|
||||
else
|
||||
{
|
||||
copy(x,mr_mip->w0);
|
||||
insign(PLUS,mr_mip->w0);
|
||||
lg2=0;
|
||||
while (mr_mip->w0->len>1)
|
||||
{
|
||||
#ifdef MR_FP_ROUNDING
|
||||
mr_sdiv(_MIPP_ mr_mip->w0,mr_mip->base2,mr_invert(mr_mip->base2),mr_mip->w0);
|
||||
#else
|
||||
mr_sdiv(_MIPP_ mr_mip->w0,mr_mip->base2,mr_mip->w0);
|
||||
#endif
|
||||
lg2+=mr_mip->lg2b;
|
||||
}
|
||||
|
||||
while (mr_mip->w0->w[0]>=1)
|
||||
{
|
||||
lg2++;
|
||||
mr_mip->w0->w[0]/=2;
|
||||
}
|
||||
}
|
||||
#endif
|
||||
MR_OUT
|
||||
return lg2;
|
||||
}
|
||||
|
||||
void sftbit(_MIPD_ big x,int n,big z)
|
||||
{ /* shift x by n bits */
|
||||
int m;
|
||||
mr_small sm;
|
||||
#ifdef MR_OS_THREADS
|
||||
miracl *mr_mip=get_mip();
|
||||
#endif
|
||||
if (mr_mip->ERNUM) return;
|
||||
copy(x,z);
|
||||
if (n==0) return;
|
||||
|
||||
MR_IN(47)
|
||||
|
||||
m=mr_abs(n);
|
||||
sm=mr_shiftbits((mr_small)1,m%mr_mip->lg2b);
|
||||
if (n>0)
|
||||
{ /* shift left */
|
||||
|
||||
#ifndef MR_ALWAYS_BINARY
|
||||
if (mr_mip->base==mr_mip->base2)
|
||||
{
|
||||
#endif
|
||||
mr_shift(_MIPP_ z,n/mr_mip->lg2b,z);
|
||||
mr_pmul(_MIPP_ z,sm,z);
|
||||
#ifndef MR_ALWAYS_BINARY
|
||||
}
|
||||
else
|
||||
{
|
||||
expb2(_MIPP_ m,mr_mip->w1);
|
||||
multiply(_MIPP_ z,mr_mip->w1,z);
|
||||
}
|
||||
#endif
|
||||
}
|
||||
else
|
||||
{ /* shift right */
|
||||
|
||||
#ifndef MR_ALWAYS_BINARY
|
||||
if (mr_mip->base==mr_mip->base2)
|
||||
{
|
||||
#endif
|
||||
mr_shift(_MIPP_ z,n/mr_mip->lg2b,z);
|
||||
#ifdef MR_FP_ROUNDING
|
||||
mr_sdiv(_MIPP_ z,sm,mr_invert(sm),z);
|
||||
#else
|
||||
mr_sdiv(_MIPP_ z,sm,z);
|
||||
#endif
|
||||
|
||||
#ifndef MR_ALWAYS_BINARY
|
||||
}
|
||||
else
|
||||
{
|
||||
expb2(_MIPP_ m,mr_mip->w1);
|
||||
divide(_MIPP_ z,mr_mip->w1,z);
|
||||
}
|
||||
#endif
|
||||
}
|
||||
MR_OUT
|
||||
}
|
||||
|
||||
void expb2(_MIPD_ int n,big x)
|
||||
{ /* sets x=2^n */
|
||||
int r,p;
|
||||
#ifndef MR_ALWAYS_BINARY
|
||||
int i;
|
||||
#endif
|
||||
#ifdef MR_OS_THREADS
|
||||
miracl *mr_mip=get_mip();
|
||||
#endif
|
||||
if (mr_mip->ERNUM) return;
|
||||
convert(_MIPP_ 1,x);
|
||||
if (n==0) return;
|
||||
|
||||
MR_IN(149)
|
||||
|
||||
if (n<0)
|
||||
{
|
||||
mr_berror(_MIPP_ MR_ERR_NEG_POWER);
|
||||
MR_OUT
|
||||
return;
|
||||
}
|
||||
r=n/mr_mip->lg2b;
|
||||
p=n%mr_mip->lg2b;
|
||||
|
||||
#ifndef MR_ALWAYS_BINARY
|
||||
if (mr_mip->base==mr_mip->base2)
|
||||
{
|
||||
#endif
|
||||
mr_shift(_MIPP_ x,r,x);
|
||||
x->w[x->len-1]=mr_shiftbits(x->w[x->len-1],p);
|
||||
#ifndef MR_ALWAYS_BINARY
|
||||
}
|
||||
else
|
||||
{
|
||||
for (i=1;i<=r;i++)
|
||||
mr_pmul(_MIPP_ x,mr_mip->base2,x);
|
||||
mr_pmul(_MIPP_ x,mr_shiftbits((mr_small)1,p),x);
|
||||
}
|
||||
#endif
|
||||
MR_OUT
|
||||
}
|
||||
|
||||
#ifndef MR_NO_RAND
|
||||
|
||||
void bigbits(_MIPD_ int n,big x)
|
||||
{ /* sets x as random < 2^n */
|
||||
mr_small r;
|
||||
mr_lentype wlen;
|
||||
#ifdef MR_FP
|
||||
mr_small dres;
|
||||
#endif
|
||||
#ifdef MR_OS_THREADS
|
||||
miracl *mr_mip=get_mip();
|
||||
#endif
|
||||
zero(x);
|
||||
if (mr_mip->ERNUM || n<=0) return;
|
||||
|
||||
MR_IN(150)
|
||||
|
||||
expb2(_MIPP_ n,mr_mip->w1);
|
||||
wlen=mr_mip->w1->len;
|
||||
do
|
||||
{
|
||||
r=brand(_MIPPO_ );
|
||||
if (mr_mip->base==0) x->w[x->len++]=r;
|
||||
else x->w[x->len++]=MR_REMAIN(r,mr_mip->base);
|
||||
} while (x->len<wlen);
|
||||
#ifndef MR_ALWAYS_BINARY
|
||||
if (mr_mip->base==mr_mip->base2)
|
||||
{
|
||||
#endif
|
||||
|
||||
x->w[wlen-1]=MR_REMAIN(x->w[wlen-1],mr_mip->w1->w[wlen-1]);
|
||||
mr_lzero(x);
|
||||
|
||||
#ifndef MR_ALWAYS_BINARY
|
||||
}
|
||||
else
|
||||
{
|
||||
divide(_MIPP_ x,mr_mip->w1,mr_mip->w1);
|
||||
}
|
||||
#endif
|
||||
|
||||
MR_OUT
|
||||
}
|
||||
|
||||
#endif
|
||||
Reference in New Issue
Block a user