Cryptanalysis of Brenner et al.'s somewhat homomorphic encryption scheme

Paulet, R and Yi, X 2013, 'Cryptanalysis of Brenner et al.'s somewhat homomorphic encryption scheme', in 11th Australasian Information Security Conference 2013, Adelaide, Australia, 29 January - 1 February 2013, pp. 25-30.


Document type: Conference Paper
Collection: Conference Papers

Title Cryptanalysis of Brenner et al.'s somewhat homomorphic encryption scheme
Author(s) Paulet, R
Yi, X
Year 2013
Conference name 11th Australasian Information Security Conference 2013
Conference location Adelaide, Australia
Conference dates 29 January - 1 February 2013
Proceedings title 11th Australasian Information Security Conference 2013
Publisher Australian Computer Society
Place of publication Darlinghurst, Australia
Start page 25
End page 30
Total pages 6
Abstract Recently, Brenner et al. proposed a symmetric somewhat homomorphic encryption scheme and applied it to solve some practical problems, such as the Millionaires' problem, which only need to evaluate circuits of limited depth. It is claimed that the security of their scheme is built on the hardness of integer factorization. In this paper, we use the Euclidean Greatest Common Divisor (GCD) algorithm to perform cryptanalysis on Brenner et al.'s scheme. We present several algorithms to find the secret key of their scheme. Our experiments have shown that our cryptanalysis is feasible and efficient.
Copyright notice © 2013 Australian Computer Society
ISBN 9781921770234
Versions
Version Filter Type
Access Statistics: 91 Abstract Views  -  Detailed Statistics
Created: Thu, 15 Jan 2015, 08:26:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us