搜索结果: 1-15 共查到“军事学 Exponentiation”相关记录40条 . 查询时间(0.079 秒)
Practically Efficient Secure Distributed Exponentiation without Bit-Decomposition
applied secure multiparty computation distributed exponentiation applied cryptography
2019/4/3
Bit-decomposition is a powerful tool which can be used to design constant round protocols for bit-oriented multiparty computation (MPC) problems, such as comparison and Hamming weight computation. How...
Revisiting Single-server Algorithms for Outsourcing Modular Exponentiation
modular exponentiations secure outsourcing
2018/11/2
We investigate the problem of securely outsourcing modular exponentiations to a single, malicious computational resource. We revisit recently proposed schemes using single server and analyse them agai...
Outsourcing Modular Exponentiation in Cryptographic Web Applications
Internet voting Modular exponentiations JavaScript cryptography
2018/4/3
Modern web applications using advanced cryptographic methods may need to calculate a large number of modular exponentiations. Performing such calculations in the web browser efficiently is a known pro...
Correlated Extra-Reductions Defeat Blinded Regular Exponentiation
side-channel analysis Montgomery modular multiplication extra-reduction leakage
2016/6/8
Walter & Thomson (CT-RSA '01) and Schindler (PKC '02) have shown that extra-reductions allow to break RSA-CRT even with message blinding. Indeed, the extra-reduction probability depends on the type of...
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions
Secure outsource computation Cryptanalysis Coppersmith methods
2016/3/21
We address the problem of speeding up group computations in cryptography using a single untrusted computational resource. We analyze the security of an efficient protocol for securely outsourcing mult...
Fault Attack revealing Secret Keys of Exponentiation Algorithms from Branch Prediction Misses
Fault attacks branch misses performance counters
2016/1/6
Performance monitors are provided in modern day computers for observing various features of the underlying microarchitectures. However the combination of underlying micro-architectural features and pe...
Remarks on Quantum Modular Exponentiation and Some Experimental Demonstrations of Shor's Algorithm
Shor's factoring algorithm quantum modular exponentiation superposition
2016/1/6
An efficient quantum modular exponentiation method is indispensible for Shor's factoring algorithm. But we find that all descriptions presented by Shor, Nielsen and Chuang, Markov and Saeedi, et al., ...
Inverting the Final exponentiation of Tate pairings on ordinary elliptic curves using faults
Tate pairing Ate pairing final exponentiation
2016/1/4
The calculation of the Tate pairing on ordinary curves involves two major steps: the Miller Loop (ML) followed by the Final Exponentiation (FE). The first step for achieving a full pairing inversion w...
Stealing Keys from PCs using a Radio: Cheap Electromagnetic Attacks on Windowed Exponentiation
side channell electromagnetic analysis RSA
2016/1/3
We present new side-channel attacks on RSA and ElGamal implementations that use the
popular sliding-window or fixed-window (m-ary) modular exponentiation algorithms. The attacks
can extract decrypti...
Memory-saving computation of the pairing fi nal exponentiation on BN curves
BN curves Tate pairing final exponentiation
2016/1/3
In this paper, we describe and improve efficient methods for computing
the hard part of the final exponentiation of pairings on Barreto-Naehrig
curves.
Efficient and Secure Delegation of Group Exponentiation to a Single Server
cryptographic protocols Single Server
2016/1/3
We consider the problem of delegating computation of group operations from a computationally weaker client holding an input and a description of a function, to a {\em single} computationally stronger ...
Two Exponentiation Algorithms Resistant to Cross-correlation Power Analysis and to Other Known Attacks
secret-key cryptography smart cards
2013/2/21
In order to prevent the SPA (Simple Power Analysis) attack against modular exponentiation algorithms, a multiply-always implementation is generally used. Witteman et al. introduced in \cite{WI} a new ...
Efficient Modular Exponentiation-based Puzzles for Denial-of-Service Protection
client puzzles time-lock puzzles enial of service resistance
2012/6/14
Client puzzles are moderately-hard cryptographic problems --- neither easy nor impossible to solve --- that can be used as a countermeasure against denial of service attacks on network protocols. Puzz...
Efficient Modular Exponentiation-based Puzzles for Denial-of-Service Protection
client puzzles time-lock puzzles denial of service resistance RSA puzzle difficulty
2012/3/20
Client puzzles are moderately-hard cryptographic problems --- neither easy nor impossible to solve --- that can be used as a countermeasure against denial of service attacks on network protocols. Puzz...
Randomized Secure Two-Party Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation
applications / secure two-party computation randomized algorithm efficiency
2012/3/23
When secure arithmetic is required, computation based on secure multiplication ($\MULT$) is much more efficient than computation based on secure boolean circuits. However, a typical application can al...