搜索结果: 1-15 共查到“军事学 EC”相关记录15条 . 查询时间(0.047 秒)
复旦大学计算机科学与技术学院信息安全课件 Web & EC Security。
On the One-Per-Message Unforgeability of (EC)DSA and its Variants
signature schemes DSA ECDSA
2017/9/18
The American signature standards DSA and ECDSA, as well as their Russian and Chinese counterparts GOST 34.10 and SM2, are of utmost importance in the current security landscape. The mentioned schemes ...
Error-free protection of EC point multiplication by modular extension
elliptic curve point multiplication modulus extension
2017/2/28
An implementation of a point multiplication function in an elliptic-curve cryptosystem can be attacked by fault injections in order to reveal the secret multiplier. A special kind of such an attack is...
EC-OPRF: Oblivious Pseudorandom Functions using Elliptic Curves
oblivious psuedorandom function elliptic curve cryptosystem multi-party computation
2017/2/20
We introduce a secure elliptic curve oblivious pseudorandom function (EC-OPRF) which operates by hashing strings onto an elliptic curve to provide a simple and efficient mechanism for computing an obl...
High Saturation Complete Graph Approach for EC Point Decomposition and ECDL Problem
ECDL problem Semaev polynomials block ciphers
2016/7/20
One of the key questions in contemporary applied cryptography is whether there exist an efficient algorithm for solving the discrete logarithm problem in elliptic curves. The primary approach for this...
In December 2015, Juniper Networks announced that unknown attackers had added unauthorized code to ScreenOS, the operating system for their NetScreen VPN routers. This code created two vulnerabilities...
Dual EC is an algorithm to compute pseudorandom numbers starting from some random input. Dual EC was standardized by NIST, ANSI, and ISO among other algorithms to generate pseudorandom numbers. For a ...
In this paper we show how to break the most recent version of
EC-RAC with respect to privacy.We show that both the ID-Transfer and
ID&PWD-Transfer schemes from EC-RAC do not provide the claimed
pri...
Untraceable RFID protocols are not trivially composable:Attacks on the revision of EC-RAC
Untraceable RFID protocols Attacks EC-RAC
2009/7/14
It is well-known that protocols that satisfy a security prop-
erty when executed in isolation do not necessarily satisfy the same se-
curity property when they are executed in an environment contain...
OPEN SOURCE IS NOT ENOUGH ATTACKING THE EC-PACKAGE OF BOUNCYCASTLE VERSION 1.x 132
ECC BouncyCastle
2009/6/3
BouncyCastle is an open source Crypto provider written in Java which supplies
classes for Elliptic Curve Cryptography (ECC). We have found a flaw in the class ECPoint
resulting from an unhappy inter...
Faster Multi-Exponentiation through Caching:Accelerating (EC)DSA Signature Verification
Efficient implementation elliptic curve cryptography ECDSA verification
2009/6/2
Q We consider the task of computing power products
1ik gei
i (“multi-exponentiation”) where base elements g2, . . ., gk are
fixed while g1 is variable between multi-exponentiations but may repea...
Key-collisions in（EC）DSA: Attacking Non-repudiation
Key-collisions EC DSA Attacking Non-repudiation
2009/4/15
A new kind of attack on the non-repudiation property of digital signature schemes is
presented. We introduce a notion of key-collisions, which may allow an attacker to claim that the
message (presen...
Attack on Han et al:’s ID-based Confirmer（Undeniable）Signature at ACM-EC’03
Confirmer signature Undeniable signature Attack Bilinear pairings
2009/4/9
At the fourth ACM conference on electronic commerce (EC’03),
S. Han, K.Y. Yeung and J. Wang proposed an ID-based confirmer signature
scheme using pairings (actually, this is an ID-based undeniable
...
A Pollard-like pseudorandom number generator over EC
random number generation elliptic curve cryptography Pollard’s rho algorithm
2008/8/14
In this short paper we propose a pseudorandom number generator over EC based on Pollardlike
method. In contrast to the well known Elliptic Curve Random Number Generator (see e.g.
ANSI and NIST draft...
Faster Multi-Exponentiation through Caching:Accelerating (EC)DSA Signature Verification
Efficient implementation elliptic curve cryptography ECDSA verification exponentiation DSA verification
2008/5/20
We consider the task of computing power products Q1ik gei
i (“multi-exponentiation”) where base elements g2, . . ., gk are
fixed while g1 is variable between multi-exponentiations but may repeat,
...