003 File Manager
Current Path:
/usr/src/contrib/bearssl/src/rsa
usr
/
src
/
contrib
/
bearssl
/
src
/
rsa
/
📁
..
📄
rsa_default_keygen.c
(1.35 KB)
📄
rsa_default_modulus.c
(1.33 KB)
📄
rsa_default_oaep_decrypt.c
(1.38 KB)
📄
rsa_default_oaep_encrypt.c
(1.38 KB)
📄
rsa_default_pkcs1_sign.c
(1.37 KB)
📄
rsa_default_pkcs1_vrfy.c
(1.37 KB)
📄
rsa_default_priv.c
(1.35 KB)
📄
rsa_default_privexp.c
(1.33 KB)
📄
rsa_default_pss_sign.c
(1.36 KB)
📄
rsa_default_pss_vrfy.c
(1.36 KB)
📄
rsa_default_pub.c
(1.35 KB)
📄
rsa_default_pubexp.c
(1.32 KB)
📄
rsa_i15_keygen.c
(16.04 KB)
📄
rsa_i15_modulus.c
(2.48 KB)
📄
rsa_i15_oaep_decrypt.c
(1.49 KB)
📄
rsa_i15_oaep_encrypt.c
(1.58 KB)
📄
rsa_i15_pkcs1_sign.c
(1.44 KB)
📄
rsa_i15_pkcs1_vrfy.c
(1.57 KB)
📄
rsa_i15_priv.c
(5.35 KB)
📄
rsa_i15_privexp.c
(9.75 KB)
📄
rsa_i15_pss_sign.c
(1.51 KB)
📄
rsa_i15_pss_vrfy.c
(1.59 KB)
📄
rsa_i15_pub.c
(2.8 KB)
📄
rsa_i15_pubexp.c
(4.13 KB)
📄
rsa_i31_keygen.c
(1.44 KB)
📄
rsa_i31_keygen_inner.c
(16.94 KB)
📄
rsa_i31_modulus.c
(2.48 KB)
📄
rsa_i31_oaep_decrypt.c
(1.49 KB)
📄
rsa_i31_oaep_encrypt.c
(1.58 KB)
📄
rsa_i31_pkcs1_sign.c
(1.44 KB)
📄
rsa_i31_pkcs1_vrfy.c
(1.57 KB)
📄
rsa_i31_priv.c
(5.26 KB)
📄
rsa_i31_privexp.c
(9.7 KB)
📄
rsa_i31_pss_sign.c
(1.51 KB)
📄
rsa_i31_pss_vrfy.c
(1.59 KB)
📄
rsa_i31_pub.c
(2.66 KB)
📄
rsa_i31_pubexp.c
(4.11 KB)
📄
rsa_i32_oaep_decrypt.c
(1.49 KB)
📄
rsa_i32_oaep_encrypt.c
(1.58 KB)
📄
rsa_i32_pkcs1_sign.c
(1.44 KB)
📄
rsa_i32_pkcs1_vrfy.c
(1.57 KB)
📄
rsa_i32_priv.c
(4.37 KB)
📄
rsa_i32_pss_sign.c
(1.51 KB)
📄
rsa_i32_pss_vrfy.c
(1.59 KB)
📄
rsa_i32_pub.c
(2.22 KB)
📄
rsa_i62_keygen.c
(1.65 KB)
📄
rsa_i62_oaep_decrypt.c
(1.74 KB)
📄
rsa_i62_oaep_encrypt.c
(1.82 KB)
📄
rsa_i62_pkcs1_sign.c
(1.68 KB)
📄
rsa_i62_pkcs1_vrfy.c
(1.81 KB)
📄
rsa_i62_priv.c
(5.64 KB)
📄
rsa_i62_pss_sign.c
(1.74 KB)
📄
rsa_i62_pss_vrfy.c
(1.82 KB)
📄
rsa_i62_pub.c
(2.88 KB)
📄
rsa_oaep_pad.c
(3.05 KB)
📄
rsa_oaep_unpad.c
(4.12 KB)
📄
rsa_pkcs1_sig_pad.c
(2.87 KB)
📄
rsa_pkcs1_sig_unpad.c
(3.44 KB)
📄
rsa_pss_sig_pad.c
(2.99 KB)
📄
rsa_pss_sig_unpad.c
(3.22 KB)
📄
rsa_ssl_decrypt.c
(1.71 KB)
Editing: rsa_i32_pub.c
/* * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org> * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE * SOFTWARE. */ #include "inner.h" /* see bearssl_rsa.h */ uint32_t br_rsa_i32_public(unsigned char *x, size_t xlen, const br_rsa_public_key *pk) { const unsigned char *n; size_t nlen; uint32_t m[1 + (BR_MAX_RSA_SIZE >> 5)]; uint32_t a[1 + (BR_MAX_RSA_SIZE >> 5)]; uint32_t t1[1 + (BR_MAX_RSA_SIZE >> 5)]; uint32_t t2[1 + (BR_MAX_RSA_SIZE >> 5)]; uint32_t m0i, r; /* * Get the actual length of the modulus, and see if it fits within * our stack buffer. We also check that the length of x[] is valid. */ n = pk->n; nlen = pk->nlen; while (nlen > 0 && *n == 0) { n ++; nlen --; } if (nlen == 0 || nlen > (BR_MAX_RSA_SIZE >> 3) || xlen != nlen) { return 0; } br_i32_decode(m, n, nlen); m0i = br_i32_ninv32(m[1]); /* * Note: if m[] is even, then m0i == 0. Otherwise, m0i must be * an odd integer. */ r = m0i & 1; /* * Decode x[] into a[]; we also check that its value is proper. */ r &= br_i32_decode_mod(a, x, xlen, m); /* * Compute the modular exponentiation. */ br_i32_modpow(a, pk->e, pk->elen, m, m0i, t1, t2); /* * Encode the result. */ br_i32_encode(x, xlen, a); return r; }
Upload File
Create Folder