搜索结果: 1-7 共查到“军队指挥学 Bit Security”相关记录7条 . 查询时间(0.156 秒)
On the Bit Security of Cryptographic Primitives
Bit Security Information Theory Indistinguishability
font style='font-size:12px;'>
2018/1/19
We introduce a formal quantitative notion of ``bit security'' for a general type of cryptographic games (capturing both decision and search problems), aimed at capturing the intuition that a cryptogra...
Efficient Optimal Ate Pairing at 128-bit Security Level
KSS-16 curve Optimal-Ate pairing sparse multiplication
font style='font-size:12px;'>
2017/12/6
Following the emergence of Kim and Barbulescu's new number field sieve (exTNFS) algorithm at CRYPTO'16 [21] for solving discrete logarithm problem (DLP) over the finite field; pairing-based cryptograp...
On the Bit Security of Elliptic Curve Diffie--Hellman
hidden number problem bit security elliptic curve Diffie--Hellman
font style='font-size:12px;'>
2017/1/3
This paper gives the first bit security result for the elliptic curve Diffie--Hellman key exchange protocol for elliptic curves defined over prime fields. About 5/65/6 of the most significant bits of ...
On the Computation of the Optimal Ate Pairing at the 192-bit Security Level
BLS curves Optimal Ate pairing final exponentiation
font style='font-size:12px;'>
2016/2/23
Barreto, Lynn and Scott elliptic curves of embedding degree
12 denoted BLS12 have been proven to present fastest results on the
implementation of pairings at the 192-bit security level [1]. The comp...
Bit Security of the CDH Problems over Finite Field
CDH Diffie-Hellman problem d-th CDH problem
font style='font-size:12px;'>
2016/1/7
It is a long-standing open problem to prove the existence of (deterministic) hard-core predicates
for the Computational Diffie-Hellman (CDH) problem over finite fields, without resorting to
the gene...
Bit Security of the Hyperelliptic Curves Diffie-Hellman Problem
Hyperelliptic curves Bit Security Diffie-Hellman Problem
font style='font-size:12px;'>
2015/12/29
The Diffie-Hellman problem as a cryptographic primitive plays an
important role in modern cryptology. The Bit Security or Hard-Core Bits of
Diffie-Hellman problem in arbitrary finite cyclic group is...
Compact hardware for computing the Tate pairing over 128-bit-security supersingular curves
implementation Tate pairing supersingular elliptic curves FPGA implementation
font style='font-size:12px;'>
2010/7/14
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such curves are usually res...