Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Openssl
提交
1ded2dd3
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看板
体验新版 GitCode,发现更多精彩内容 >>
You need to sign in or sign up before continuing.
提交
1ded2dd3
编写于
6月 03, 2017
作者:
A
Andy Polyakov
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
sha/keccak1600.c: add another 1x variant.
Reviewed-by:
N
Rich Salz
<
rsalz@openssl.org
>
上级
c83a4db5
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
144 addition
and
0 deletion
+144
-0
crypto/sha/keccak1600.c
crypto/sha/keccak1600.c
+144
-0
未找到文件。
crypto/sha/keccak1600.c
浏览文件 @
1ded2dd3
...
...
@@ -341,6 +341,150 @@ void KeccakF1600(uint64_t A[5][5])
}
}
#elif defined(KECCAK_1X_ALT)
/*
* This is variant of above KECCAK_1X that presses temporary storage
* even further, but at cost of more write references to A[5][5].
* It's less suitable if A[5][5] is memory bound, but better if it's
* register bound.
*/
static
void
Round
(
uint64_t
A
[
5
][
5
],
size_t
i
)
{
uint64_t
C
[
5
],
D
[
5
];
assert
(
i
<
(
sizeof
(
iotas
)
/
sizeof
(
iotas
[
0
])));
C
[
0
]
=
A
[
0
][
0
]
^
A
[
1
][
0
]
^
A
[
2
][
0
]
^
A
[
3
][
0
]
^
A
[
4
][
0
];
C
[
1
]
=
A
[
0
][
1
]
^
A
[
1
][
1
]
^
A
[
2
][
1
]
^
A
[
3
][
1
]
^
A
[
4
][
1
];
C
[
2
]
=
A
[
0
][
2
]
^
A
[
1
][
2
]
^
A
[
2
][
2
]
^
A
[
3
][
2
]
^
A
[
4
][
2
];
C
[
3
]
=
A
[
0
][
3
]
^
A
[
1
][
3
]
^
A
[
2
][
3
]
^
A
[
3
][
3
]
^
A
[
4
][
3
];
C
[
4
]
=
A
[
0
][
4
]
^
A
[
1
][
4
]
^
A
[
2
][
4
]
^
A
[
3
][
4
]
^
A
[
4
][
4
];
D
[
0
]
=
ROL64
(
C
[
1
],
1
)
^
C
[
4
];
A
[
0
][
0
]
^=
D
[
0
];
A
[
1
][
0
]
^=
D
[
0
];
A
[
2
][
0
]
^=
D
[
0
];
A
[
3
][
0
]
^=
D
[
0
];
A
[
4
][
0
]
^=
D
[
0
];
D
[
1
]
=
ROL64
(
C
[
2
],
1
)
^
C
[
0
];
A
[
0
][
1
]
^=
D
[
1
];
A
[
1
][
1
]
^=
D
[
1
];
A
[
2
][
1
]
^=
D
[
1
];
A
[
3
][
1
]
^=
D
[
1
];
A
[
4
][
1
]
^=
D
[
1
];
D
[
2
]
=
ROL64
(
C
[
3
],
1
)
^
C
[
1
];
A
[
0
][
2
]
^=
D
[
2
];
A
[
1
][
2
]
^=
D
[
2
];
A
[
2
][
2
]
^=
D
[
2
];
A
[
3
][
2
]
^=
D
[
2
];
A
[
4
][
2
]
^=
D
[
2
];
D
[
3
]
=
ROL64
(
C
[
4
],
1
)
^
C
[
2
];
A
[
0
][
3
]
^=
D
[
3
];
A
[
1
][
3
]
^=
D
[
3
];
A
[
2
][
3
]
^=
D
[
3
];
A
[
3
][
3
]
^=
D
[
3
];
A
[
4
][
3
]
^=
D
[
3
];
D
[
4
]
=
ROL64
(
C
[
0
],
1
)
^
C
[
3
];
A
[
0
][
4
]
^=
D
[
4
];
A
[
1
][
4
]
^=
D
[
4
];
A
[
2
][
4
]
^=
D
[
4
];
A
[
3
][
4
]
^=
D
[
4
];
A
[
4
][
4
]
^=
D
[
4
];
C
[
1
]
=
A
[
0
][
1
];
C
[
2
]
=
A
[
0
][
2
];
C
[
3
]
=
A
[
0
][
3
];
C
[
4
]
=
A
[
0
][
4
];
A
[
0
][
1
]
=
ROL64
(
A
[
1
][
1
],
rhotates
[
1
][
1
]);
A
[
0
][
2
]
=
ROL64
(
A
[
2
][
2
],
rhotates
[
2
][
2
]);
A
[
0
][
3
]
=
ROL64
(
A
[
3
][
3
],
rhotates
[
3
][
3
]);
A
[
0
][
4
]
=
ROL64
(
A
[
4
][
4
],
rhotates
[
4
][
4
]);
A
[
1
][
1
]
=
ROL64
(
A
[
1
][
4
],
rhotates
[
1
][
4
]);
A
[
2
][
2
]
=
ROL64
(
A
[
2
][
3
],
rhotates
[
2
][
3
]);
A
[
3
][
3
]
=
ROL64
(
A
[
3
][
2
],
rhotates
[
3
][
2
]);
A
[
4
][
4
]
=
ROL64
(
A
[
4
][
1
],
rhotates
[
4
][
1
]);
A
[
1
][
4
]
=
ROL64
(
A
[
4
][
2
],
rhotates
[
4
][
2
]);
A
[
2
][
3
]
=
ROL64
(
A
[
3
][
4
],
rhotates
[
3
][
4
]);
A
[
3
][
2
]
=
ROL64
(
A
[
2
][
1
],
rhotates
[
2
][
1
]);
A
[
4
][
1
]
=
ROL64
(
A
[
1
][
3
],
rhotates
[
1
][
3
]);
A
[
4
][
2
]
=
ROL64
(
A
[
2
][
4
],
rhotates
[
2
][
4
]);
A
[
3
][
4
]
=
ROL64
(
A
[
4
][
3
],
rhotates
[
4
][
3
]);
A
[
2
][
1
]
=
ROL64
(
A
[
1
][
2
],
rhotates
[
1
][
2
]);
A
[
1
][
3
]
=
ROL64
(
A
[
3
][
1
],
rhotates
[
3
][
1
]);
A
[
2
][
4
]
=
ROL64
(
A
[
4
][
0
],
rhotates
[
4
][
0
]);
A
[
4
][
3
]
=
ROL64
(
A
[
3
][
0
],
rhotates
[
3
][
0
]);
A
[
1
][
2
]
=
ROL64
(
A
[
2
][
0
],
rhotates
[
2
][
0
]);
A
[
3
][
1
]
=
ROL64
(
A
[
1
][
0
],
rhotates
[
1
][
0
]);
A
[
1
][
0
]
=
ROL64
(
C
[
3
],
rhotates
[
0
][
3
]);
A
[
2
][
0
]
=
ROL64
(
C
[
1
],
rhotates
[
0
][
1
]);
A
[
3
][
0
]
=
ROL64
(
C
[
4
],
rhotates
[
0
][
4
]);
A
[
4
][
0
]
=
ROL64
(
C
[
2
],
rhotates
[
0
][
2
]);
C
[
0
]
=
A
[
0
][
0
];
C
[
1
]
=
A
[
1
][
0
];
C
[
2
]
=
A
[
2
][
0
];
C
[
3
]
=
A
[
3
][
0
];
C
[
4
]
=
A
[
4
][
0
];
D
[
0
]
=
A
[
0
][
1
];
D
[
1
]
=
A
[
1
][
1
];
D
[
2
]
=
A
[
2
][
1
];
D
[
3
]
=
A
[
3
][
1
];
D
[
4
]
=
A
[
4
][
1
];
A
[
0
][
0
]
^=
(
~
A
[
0
][
1
]
&
A
[
0
][
2
]);
A
[
1
][
0
]
^=
(
~
A
[
1
][
1
]
&
A
[
1
][
2
]);
A
[
2
][
0
]
^=
(
~
A
[
2
][
1
]
&
A
[
2
][
2
]);
A
[
3
][
0
]
^=
(
~
A
[
3
][
1
]
&
A
[
3
][
2
]);
A
[
4
][
0
]
^=
(
~
A
[
4
][
1
]
&
A
[
4
][
2
]);
A
[
0
][
1
]
^=
(
~
A
[
0
][
2
]
&
A
[
0
][
3
]);
A
[
1
][
1
]
^=
(
~
A
[
1
][
2
]
&
A
[
1
][
3
]);
A
[
2
][
1
]
^=
(
~
A
[
2
][
2
]
&
A
[
2
][
3
]);
A
[
3
][
1
]
^=
(
~
A
[
3
][
2
]
&
A
[
3
][
3
]);
A
[
4
][
1
]
^=
(
~
A
[
4
][
2
]
&
A
[
4
][
3
]);
A
[
0
][
2
]
^=
(
~
A
[
0
][
3
]
&
A
[
0
][
4
]);
A
[
1
][
2
]
^=
(
~
A
[
1
][
3
]
&
A
[
1
][
4
]);
A
[
2
][
2
]
^=
(
~
A
[
2
][
3
]
&
A
[
2
][
4
]);
A
[
3
][
2
]
^=
(
~
A
[
3
][
3
]
&
A
[
3
][
4
]);
A
[
4
][
2
]
^=
(
~
A
[
4
][
3
]
&
A
[
4
][
4
]);
A
[
0
][
3
]
^=
(
~
A
[
0
][
4
]
&
C
[
0
]);
A
[
1
][
3
]
^=
(
~
A
[
1
][
4
]
&
C
[
1
]);
A
[
2
][
3
]
^=
(
~
A
[
2
][
4
]
&
C
[
2
]);
A
[
3
][
3
]
^=
(
~
A
[
3
][
4
]
&
C
[
3
]);
A
[
4
][
3
]
^=
(
~
A
[
4
][
4
]
&
C
[
4
]);
A
[
0
][
4
]
^=
(
~
C
[
0
]
&
D
[
0
]);
A
[
1
][
4
]
^=
(
~
C
[
1
]
&
D
[
1
]);
A
[
2
][
4
]
^=
(
~
C
[
2
]
&
D
[
2
]);
A
[
3
][
4
]
^=
(
~
C
[
3
]
&
D
[
3
]);
A
[
4
][
4
]
^=
(
~
C
[
4
]
&
D
[
4
]);
A
[
0
][
0
]
^=
iotas
[
i
];
}
void
KeccakF1600
(
uint64_t
A
[
5
][
5
])
{
size_t
i
;
for
(
i
=
0
;
i
<
24
;
i
++
)
{
Round
(
A
,
i
);
}
}
#elif defined(KECCAK_2X)
/*
* This implementation is variant of KECCAK_1X above with outer-most
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录