Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Openssl
提交
2238e8e4
T
Third Party Openssl
项目概览
OpenHarmony
/
Third Party Openssl
大约 1 年 前同步成功
通知
9
Star
18
Fork
1
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
T
Third Party Openssl
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
2238e8e4
编写于
9月 12, 2005
作者:
B
Bodo Möller
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
correct+extend publication info
上级
4b08da55
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
7 addition
and
7 deletion
+7
-7
crypto/ec/ec2_mult.c
crypto/ec/ec2_mult.c
+7
-7
未找到文件。
crypto/ec/ec2_mult.c
浏览文件 @
2238e8e4
...
...
@@ -76,7 +76,7 @@
* coordinates.
* Uses algorithm Mdouble in appendix of
* Lopez, J. and Dahab, R. "Fast multiplication on elliptic curves over
* GF(2^m) without precomputation".
* GF(2^m) without precomputation"
(CHES '99, LNCS 1717)
.
* modified to not require precomputation of c=b^{2^{m-1}}.
*/
static
int
gf2m_Mdouble
(
const
EC_GROUP
*
group
,
BIGNUM
*
x
,
BIGNUM
*
z
,
BN_CTX
*
ctx
)
...
...
@@ -107,8 +107,8 @@ static int gf2m_Mdouble(const EC_GROUP *group, BIGNUM *x, BIGNUM *z, BN_CTX *ctx
/* Compute the x-coordinate x1/z1 for the point (x1/z1)+(x2/x2) in Montgomery
* projective coordinates.
* Uses algorithm Madd in appendix of
* Lope
x
, J. and Dahab, R. "Fast multiplication on elliptic curves over
* GF(2^m) without precomputation".
* Lope
z
, J. and Dahab, R. "Fast multiplication on elliptic curves over
* GF(2^m) without precomputation"
(CHES '99, LNCS 1717)
.
*/
static
int
gf2m_Madd
(
const
EC_GROUP
*
group
,
const
BIGNUM
*
x
,
BIGNUM
*
x1
,
BIGNUM
*
z1
,
const
BIGNUM
*
x2
,
const
BIGNUM
*
z2
,
BN_CTX
*
ctx
)
...
...
@@ -140,8 +140,8 @@ static int gf2m_Madd(const EC_GROUP *group, const BIGNUM *x, BIGNUM *x1, BIGNUM
/* Compute the x, y affine coordinates from the point (x1, z1) (x2, z2)
* using Montgomery point multiplication algorithm Mxy() in appendix of
* Lope
x
, J. and Dahab, R. "Fast multiplication on elliptic curves over
* GF(2^m) without precomputation".
* Lope
z
, J. and Dahab, R. "Fast multiplication on elliptic curves over
* GF(2^m) without precomputation"
(CHES '99, LNCS 1717)
.
* Returns:
* 0 on error
* 1 if return value should be the point at infinity
...
...
@@ -209,8 +209,8 @@ static int gf2m_Mxy(const EC_GROUP *group, const BIGNUM *x, const BIGNUM *y, BIG
/* Computes scalar*point and stores the result in r.
* point can not equal r.
* Uses algorithm 2P of
* Lope
x
, J. and Dahab, R. "Fast multiplication on elliptic curves over
* GF(2^m) without precomputation".
* Lope
z
, J. and Dahab, R. "Fast multiplication on elliptic curves over
* GF(2^m) without precomputation"
(CHES '99, LNCS 1717)
.
*/
static
int
ec_GF2m_montgomery_point_multiply
(
const
EC_GROUP
*
group
,
EC_POINT
*
r
,
const
BIGNUM
*
scalar
,
const
EC_POINT
*
point
,
BN_CTX
*
ctx
)
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录