4212 search results - page 27 / 843 » On Compressible Pairings and Their Computation |
183
click to vote
SACRYPT
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complementation of whole registers turns out to be very useful for constructing...
154
click to vote
DCC
2008
IEEE
16 years 5 months ago
2008
IEEE
Significant work has been done in the areas of image encryption and compression as two independent problems, yet the two areas are strongly interleaved and should be considered si...