Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Optimization of Tree Modes for Parallel Hash Functions: A Case Study   This paper focuses on parallel hash functions based on tree modes of
operation for an inner Variable-Input-Length function. This inner function can
be either a single-block-length (SBL) and prefix-free MD hash function, or a
sponge-based hash function. We discuss the various forms of optimality that can
be obtained when designing parallel hash functions based on trees where all
leaves have the same depth. The first result is a scheme which optimizes the
tree topology in order to decrease the running time. Then, without affecting
the optimal running time we show that we can slightly change the corresponding
tree topology so as to minimize the number of required processors as well.
Consequently, the resulting scheme decreases in the first place the running
time and in the second place the number of required processors.

16
The categories of this paper are: stat
12
The categories of this paper are: nucl-th
21
The categories of this paper are: adap-org
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th
3
The categories of this paper are: physics
36
The categories of this paper are: cmp-lg
5
The categories of this paper are: gr-qc
4
The categories of this paper are: cond-mat
9
The categories of this paper are: nlin
28
The categories of this paper are: alg-geom
17
The categories of this paper are: q-fin
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
14
The categories of this paper are: math-ph
13
The categories of this paper are: quant-ph