Sciweavers

658 search results - page 76 / 132
» The Grindahl Hash Functions
Sort
View
EIT
2008
IEEE
15 years 4 months ago
Relating Boolean gate truth tables to one-way functions
We present a schema to build one way functions from a family of Boolean gates. Moreover, we relate characteristics of these Boolean gate truth tables to properties of the derived ...
Mahadevan Gomathisankaran, Akhilesh Tyagi
CHES
2007
Springer
94views Cryptology» more  CHES 2007»
15 years 4 months ago
MAME: A Compression Function with Reduced Hardware Requirements
This paper describes a new compression function, MAME designed for hardware-oriented hash functions which can be used in applications reduced hardware requirements. MAME takes a 25...
Hirotaka Yoshida, Dai Watanabe, Katsuyuki Okeya, J...
TKDE
2010
159views more  TKDE 2010»
14 years 8 months ago
The Tiled Bitmap Forensic Analysis Algorithm
— Tampering of a database can be detected through the use of cryptographically-strong hash functions. Subsequently-applied forensic analysis algorithms can help determine when, w...
Kyriacos E. Pavlou, Richard T. Snodgrass
EMNLP
2009
14 years 7 months ago
Stream-based Randomised Language Models for SMT
Randomised techniques allow very big language models to be represented succinctly. However, being batch-based they are unsuitable for modelling an unbounded stream of language whi...
Abby Levenberg, Miles Osborne
CORR
2010
Springer
90views Education» more  CORR 2010»
14 years 7 months ago
Fast Pseudo-Random Fingerprints
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
Yoram Bachrach, Ely Porat