LMMP 4.3.0
Lamina High-Precision Arithmetic Library
载入中...
搜索中...
未找到
powmod.c
浏览该文件的文档.
1/**
2 * Copyright (C) 2026 HJimmyK (Jericho Knox)
3 *
4 * This file is part of LMMP.
5 *
6 * LMMP is free software: you can redistribute it and/or modify it
7 * under the terms of the GNU Lesser General Public License as
8 * published by the Free Software Foundation; either version 3 of
9 * the License, or (at your option) any later version.
10 *
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library. If not, see
18 * <https://www.gnu.org/licenses/>.
19 *
20 * SPDX-License-Identifier: LGPL-3.0-or-later
21 */
22
23#include "support/perf.h"
24#include "lmmp/lmmpn.h"
25#include "lmmp/numth.h"
26
27/*
28 奇模数模幂性能:Montgomery REDC + 滑动窗口。
29
30 输入取 RSA 典型形态:指数与模数同规模(ebits ~ n*64),
31 尺寸跨越 REDC_MERSENNE_THRESHOLD(401) 两侧,覆盖
32 全积取高半与梅森折叠两条归约路径。
33*/
34static void fill_odd_mod(mp_ptr m, mp_ptr b, mp_ptr e, size_t n, mp_limb_t seed) {
35 lmmp_seed_random_(m, (mp_size_t)n, seed, 1);
36 m[0] |= 1;
37 m[n - 1] |= (mp_limb_t)1 << 63;
38 lmmp_seed_random_(b, (mp_size_t)n, seed * 3 + 1, 1);
39 lmmp_div_(NULL, b, b, (mp_size_t)n, m, (mp_size_t)n);
40 lmmp_seed_random_(e, (mp_size_t)n, seed * 7 + 2, 1);
41 e[n - 1] |= (mp_limb_t)1 << 63;
42}
43
44static double bench_powmod_odd(mp_size_t n, const bench_options *o) {
45 mp_ptr m = alloc_limbs(n), b = alloc_limbs(n), e = alloc_limbs(n), dst = alloc_limbs(n);
46 fill_odd_mod(m, b, e, n, 0x51ce77aa1bull + n);
47 double us;
48 BENCH_MEASURE(us, o, lmmp_powmod_odd_(dst, b, e, n, m, n); bench_sink += dst[0];);
49 lmmp_free(m);
50 lmmp_free(b);
51 lmmp_free(e);
52 lmmp_free(dst);
53 return us;
54}
55
56/*
57 偶模数模幂:CRT 结构 = 奇部 REDC 梯子 + 2^k 部 powlo + 一次合成。
58 m = 2^(64*(nb2-1)+1)*odd:nb2=1 即 m=2*odd(浅移位),nb2=2 即
59 m 含 2^65 因子(深移位)。e ~ 64n 时偶底数结果恒 0(2^k 部短路),
60 故底数强制取奇以衡量典型负载。
61*/
62static double bench_powmod_even(mp_size_t n, uint nb2, const bench_options *o) {
63 if (n < 3 && nb2 > 1) nb2 = 1;
64 if (nb2 < 1 || nb2 >= n) nb2 = 1; /* 奇部至少占顶 1 limb */
65 mp_ptr m = alloc_limbs(n), b = alloc_limbs(n), e = alloc_limbs(n), dst = alloc_limbs(n);
66 lmmp_seed_random_(m, n, 0x51ce77ac0bull + nb2 * 131 + n, 1);
67 if (nb2 == 1) {
68 m[0] = (m[0] << 1) | 2; /* m = 2*odd */
69 } else {
70 lmmp_zero(m, nb2 - 1);
71 m[nb2 - 1] = 2; /* m = 2^(64*(nb2-1)+1)*odd */
72 }
73 m[n - 1] |= (mp_limb_t)1 << 63;
74 lmmp_seed_random_(b, n, 0x51ce77ac1bull + nb2 * 61 + n, 1);
75 lmmp_div_(NULL, b, b, n, m, n);
76 b[0] |= 1;
77 lmmp_seed_random_(e, n, 0x25c0ff350bull + nb2 * 17 + n, 1);
78 e[n - 1] |= (mp_limb_t)1 << 63;
79 double us;
80 BENCH_MEASURE(us, o, lmmp_powmod_(dst, b, e, n, m, n); bench_sink += dst[0];);
81 lmmp_free(m);
82 lmmp_free(b);
83 lmmp_free(e);
84 lmmp_free(dst);
85 return us;
86}
87
88/* ---- 扫描用例:阈值 401 两侧细档,其余几何阶梯 ---- */
89
90/*
91 档位含 REDC_MERSENNE_THRESHOLD(401) 两侧的 400/402。指数与模数同规模
92 意味着单 op 成本随 n^3 增长(64L 已 ~9ms、400L 已 ~1s),默认阶梯到
93 阈值上下即止;更大尺寸用 bench_powmod_odd(n, &bench_default) 单点按需测量。
94*/
95static const mp_size_t POWMOD_SZ[] = {1, 8, 64, 200, 400, 402};
96
97static void run_odd(void) {
98 for (size_t i = 0; i < ARRAY_SIZE(POWMOD_SZ); ++i) {
100 report_n("powmod_odd e=n", n, bench_powmod_odd(n, &bench_default), 0);
101 }
102}
103
104static void run_even(void) {
105 for (size_t i = 0; i < ARRAY_SIZE(POWMOD_SZ); ++i) {
106 mp_size_t n = POWMOD_SZ[i];
107 report_n("powmod_even k=1 e=n", n, bench_powmod_even(n, 1, &bench_default), 0);
108 }
109}
110
111static void run_even2(void) {
112 const mp_size_t SZ[] = {8, 64, 400};
113 for (size_t i = 0; i < ARRAY_SIZE(SZ); ++i) {
114 mp_size_t n = SZ[i];
115 report_n("powmod_even k=65 e=n", n, bench_powmod_even(n, 2, &bench_default), 0);
116 }
117}
118
119int main(void) {
120 setvbuf(stdout, NULL, _IONBF, 0);
122 puts("[numth/powmod/odd]");
123 run_odd();
124 puts("[numth/powmod/even]");
125 run_even();
126 puts("[numth/powmod/even2]");
127 run_even2();
129 return 0;
130}
int main(void)
Copyright (C) 2026 HJimmyK (Jericho Knox)
定义 main.c:26
mp_limb_t * mp_ptr
定义 lmmp.h:96
#define lmmp_zero(dst, n)
定义 lmmp.h:476
uint64_t mp_size_t
定义 lmmp.h:93
void lmmp_free(void *ptr)
内存释放函数(调用lmmp_heap_free_fn)
void lmmp_global_init(void)
全局初始化函数(线程局部的)
uint64_t mp_limb_t
定义 lmmp.h:92
void lmmp_global_deinit(void)
全局释放函数(线程局部的)
void lmmp_div_(mp_ptr dstq, mp_ptr dstr, mp_srcptr numa, mp_size_t na, mp_srcptr numb, mp_size_t nb)
除法和取模操作
定义 div.c:85
mp_size_t lmmp_seed_random_(mp_ptr dst, mp_size_t n, mp_limb_t seed, unsigned seed_type)
生成随机大整数(0 - B^n-1 均匀分布)
#define n
uint32_t uint
定义 numth.h:38
void lmmp_powmod_odd_(mp_ptr dst, mp_srcptr bp, mp_srcptr ep, mp_size_t en, mp_srcptr mp, mp_size_t n)
计算奇模数模幂 [dst,n] = [bp,n]^[ep,en] % [mp,n]
void lmmp_powmod_(mp_ptr dst, mp_srcptr bp, mp_srcptr ep, mp_size_t en, mp_srcptr mp, mp_size_t n)
计算任意模数模幂 [dst,n] = [bp,n]^[ep,en] % [mp,n]
static double bench_powmod_even(mp_size_t n, uint nb2, const bench_options *o)
static double bench_powmod_odd(mp_size_t n, const bench_options *o)
static void fill_odd_mod(mp_ptr m, mp_ptr b, mp_ptr e, size_t n, mp_limb_t seed)
Copyright (C) 2026 HJimmyK (Jericho Knox)
static void run_even2(void)
static const mp_size_t POWMOD_SZ[]
static void run_odd(void)
static void run_even(void)
#define ARRAY_SIZE(a)
Copyright (C) 2026 HJimmyK (Jericho Knox)
定义 perf.h:40
#define BENCH_MEASURE(result, options,...)
定义 perf.h:93