Sciweavers

IACR
2016
42views Biometrics» more  IACR 2016»
10 years 1 months ago
Algorithms for the Approximate Common Divisor Problem
Abstract. The security of homomorphic encryption over the integers and its variants depends on the hardness of the Approximate Common Divisor (ACD) problem. In this paper we review...
Steven D. Galbraith, Shishay W. Gebregiyorgis, Sea...
IACR
2016
147views Biometrics» more  IACR 2016»
10 years 1 months ago
Neeva: A Lightweight Hash Function
RFID technology is one of the major applications of lightweight cryptography where security and cost both are equally essential or we may say that cost friendly cryptographic tool...
Khushboo Bussi, Dhananjoy Dey, Manoj Kumar Biswas,...
IACR
2016
73views Biometrics» more  IACR 2016»
10 years 1 months ago
Algorithmic Countermeasures Against Fault Attacks and Power Analysis for RSA-CRT
Abstract. In this work, we analyze all existing RSA-CRT countermeasures against the Bellcore attack that use binary self-secure exponentiation algorithms. We test their security ag...
Ágnes Kiss, Juliane Krämer, Pablo Rauz...
IACR
2016
46views Biometrics» more  IACR 2016»
10 years 1 months ago
Fully homomorphic encryption must be fat or ugly?
In 1978, Rivest, Adleman and Dertouzos asked for algebraic systems for which useful privacy homomorphisms exist. To date, the only acknownledged result is noise based encryption co...
Kristian Gjøsteen, Martin Strand 0001
IACR
2016
45views Biometrics» more  IACR 2016»
10 years 1 months ago
A Maiorana-McFarland Construction of a GBF on Galois ring
Bent functions shows some vital properties among all combinatorial objects. Its links in combinatorics, cryptography and coding theory attract the scientific community to construc...
Shashi Kant Pandey, P. R. Mishra, B. K. Dass