《Table 1 Key size of ECC and RSA with the same deciphering time》
提示：宽带有限、当前游客访问压缩模式
本系列图表出处文件名：随高清版一同展现
《OvBNN authentication based on cooperative signature for wireless sensor networks》
Victor Miller and Heal Kablitz first proposed the elliptic curves cryptography（ECC）in 1985.The increasement of security demand in recent years makes ECC become an effective selection for researchers.The security of elliptic curves cryptography is based on the difficulty of the problem of the elliptic curve discrete logarithm.Its high-level security brings many advantages:the shorter key length，the smaller digital signature and the faster operation speed.Table 1 represents the key size required for ECC and RSA（Rivest Shamir Adleman）at the same deciphering time.
| 图表编号 | XD0020602200 严禁用于非法目的 |
|---|---|
| 绘制时间 | 2018.09.01 |
| 作者 | 秦丹阳、Zhang Yan、Ma Jingya、Ji Ping |
| 绘制单位 | Key Lab of Electronic and Communication Engineering,Heilongjiang University、Key Lab of Electronic and Communication Engineering,Heilongjiang University、Key Lab of Electronic and Communication Engineering,Heilongjiang University、Key Lab of Electronic and C |
| 更多格式 | 高清、无水印（增值服务） |
