搜索结果: 1-11 共查到“密码学 squaring”相关记录11条 . 查询时间(0.14 秒)
We prove our result by reducing ff to (a variant of) the SINK-OF-VERIFIABLE-LINE problem, which is known to imply PPAD (and in fact CLS) hardness. The main building block of our reduction is a recentl...
Modular exponentiation represents a signi cant workload for public key cryptosystems. Examples include not only the classical RSA, DSA, and DH algorithms, but also the partially homomorphic Paillier e...
Squaring Algorithms with Delayed Carry Method and Efficient Parallelization
squaring multiplication integers delayed carry
2016/1/25
Increasing amounts of information that needs to be protecting put in claims specific requirements for information security systems. The main goal of this paper is to find ways to increase performance ...
New bit-parallel Montgomery multiplier for trinomials using squaring operation
Montgomery multiplication squaring bit-parallel
2016/1/23
In this paper, a new bit-parallel Montgomery multiplier for GF(2m) is presented, where the field is generated with an irreducible trinomial. We first present a slightly generalized version of a newly...
Optimized Karatsuba Squaring on 8-bit AVR Processors
Multi-Precision Squaring AVR Karatsuba
2016/1/6
Multi-precision squaring is a crucial operation for implementation of Elliptic
Curve Cryptography. Particularly, when it comes to embedded processors, the
operation should be designed carefully to e...
Using Templates to Distinguish Multiplications from Squaring Operations
Side Channel Analysis template attack RSA
2012/3/28
Since side channel analysis was introduced as a method to recover secret information from an otherwise secure cryptosystem, many countermeasures have been proposed to prevent leakage from secure devic...
Using Templates to Distinguish Multiplications from Squaring Operations
Side Channel Analysis template attack RSA
2011/6/8
Since side channel analysis was introduced as a method to recover secret information from an otherwise secure cryptosystem, many countermeasures have been proposed to prevent leakage from secure devic...
Squaring in cyclotomic subgroups
Cyclotomic subgroups squaring pairing-based cryptography
2010/10/26
We propose new squaring formulae for cyclotomic subgroups of certain finite fields. Our formulae use a compressed representation of elements having the property that decompression can be performed at ...
Efficient Client Puzzles based on Repeated-Squaring
Efficient Client Puzzles Repeated-Squaring
2009/12/29
In this paper, we propose a new, nonparallelizable
verification-efficient client puzzle. Our
puzzle is based on repeated-squaring and enables efficient
verification of the puzzle solution that is r...
Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
Pairing-based cryptography torus-based cryptography finite field arithmetic
2009/12/29
This paper describes an extremely efficient squaring operation
in the so-called ‘cyclotomic subgroup’ of F×
q6 , for q 1 mod 6. This
result arises from considering the Weil restriction of scalars...
Multiplication and Squaring on Pairing-Friendly Fields
Finite fields pairings efficient implementation
2009/1/8
Pairing-friendly fields are finite fields that are suitable for
the implementation of cryptographic bilinear pairings. In this paper we
review multiplication and squaring methods for pairing-friendl...
