搜索结果: 1-15 共查到“军事学 Curve Cryptography”相关记录35条 . 查询时间(0.046 秒)
FourQ on FPGA: New Hardware Speed Records for Elliptic Curve Cryptography over Large Prime Characteristic Fields
Elliptic curves FourQ FPGA
2016/6/6
We present fast and compact implementations of FourQ (ASIACRYPT
2015) on field-programmable gate arrays (FPGAs), and demonstrate,
for the first time, the high efficiency of this new elliptic curve o...
Data Security in Cloud Architecture Based on Diffie Hellman and Elliptical Curve Cryptography
public-key cryptography Elliptical Curve Cryptography
2016/1/26
Technological advancements in cloud computing due to increased connectivity and exponentially proliferating data has resulted in migration towards cloud architecture. Cloud computing is technology whe...
On the Enumeration of Double-Base Chains with Applications to Elliptic Curve Cryptography
Double-base number system elliptic curve cryptography
2016/1/9
The Double-Base Number System (DBNS) uses two bases, 2 and 3, in order to represent any integer n. A Double-Base Chain (DBC) is a special case of a DBNS expansion. DBCs have been introduced to speed u...
This paper introduces “hyper-and-elliptic-curve cryptography”, in which a single high-security
group supports fast genus-2-hyperelliptic-curve formulas for variable-base-point single-scalar
multipli...
An Efficient Many-Core Architecture for Elliptic Curve Cryptography Security Assessment
ECDLP Pollard rho FPGA elliptic curves
2015/12/29
Elliptic Curve Cryptography (ECC) is a popular tool to construct
public-key crypto-systems. The security of ECC is based on the
hardness of the elliptic curve discrete logarithm problem (ECDLP). Imp...
Improving the Big Mac Attack on Elliptic Curve Cryptography
implementation side channel attacks
2015/12/23
At CHES 2001, Walter introduced the Big Mac attack against an implementation of RSA. It is an horizontal collision attack, based on the detection of common operands in two multiplications. The attack ...
Fast Prime Field Elliptic Curve Cryptography with 256 Bit Primes
Elliptic Curve Cryptography
2014/3/5
This paper studies software optimization of Elliptic Curve Cryptography with 256-bit prime fields. We propose a constant-time implementation of the NIST and SECG standardized curve P-256, that can be ...
In this paper, we perform a review of elliptic curve cryptography (ECC), as it is used in practice today, in order to reveal unique mistakes and vulnerabilities that arise in implementations of ECC. W...
This paper presents an efficient and side channel protected software implementation of point multiplication for the standard NIST and SECG binary elliptic curves. The enhanced performance is achieved ...
Complete and Unified Group Laws are not Enough for Elliptic Curve Cryptography
public-key cryptography / elliptic curve cryptosystem
2013/2/21
We analyze four recently proposed normal forms for elliptic curves. Though these forms are mathematically appealing and exhibit some cryptographically desirable properties, they nonetheless fall short...
Twisted Edwards-Form Elliptic Curve Cryptography for 8-bit AVR-based Sensor Nodes
implementation elliptic curve cryptosystem
2013/2/21
Wireless Sensor Networks (WSNs) pose a number of unique security challenges that demand innovation in several areas including the design of cryptographic primitives and protocols. Despite recent progr...
Efficient Java Implementation of Elliptic Curve Cryptography for J2ME-Enabled Mobile Devices
Elliptic Curve Cryptography Prime-Field Arithmetic Endomorphism
2012/3/20
The Micro Edition is of the Java 2 platform (J2ME) provides an application environment specifically designed to address the demands of embedded devices like cell phones, PDAs or set-top boxes. Since t...
We document our development of a library for elliptic curve cryptography in JavaScript. We discuss design choices and investigate optimizations at various levels, from integer multiplication and field...
We document our development of a library for elliptic curve cryptography in JavaScript. We discuss design choices and investigate optimizations at various levels, from integer multiplication and field...
Fast Quadrupling of a Point in Elliptic Curve Cryptography
Elliptic curve cryptography fast arithmetic affine coordinates
2012/3/30
Ciet et al. proposed a very elegant method for trading inversions for multiplications when computing $2P + Q$ from given points $P$ and $Q$ on elliptic curves of Weierstrass form. In this paper we ext...