Filters








3,361 Hits in 7.4 sec

The power of collision: Randomized parallel algorithms for chaining and integer sorting [chapter]

Rajeev Raman
1990 Lecture Notes in Computer Science  
The algorithms for chaining and integer sorting both make use of efficient algorithms for the construction of the fast priority queue of van Emde Boas [35].  ...  We address the problem of sorting n integers each in the range {l, ... ,m}, for m = nO(l), in parallel on the PRAM model of computation.  ...  Also, when we say CReW PRAM for the rest of this section, we mean anyone of PRIORITY, ARBITRARY and COLLISION (i.e., COMMON will be denoted separately).  ... 
doi:10.1007/3-540-53487-3_42 fatcat:6bwpuzmkabbjtpizcr22g3qlbq

Non-uniform Cracks in the Concrete: The Power of Free Precomputation [chapter]

Daniel J. Bernstein, Tanja Lange
2013 Lecture Notes in Computer Science  
This paper analyzes the magnitude of the flaw in detail, showing how it varies across cryptosystems and across cost metrics, and discusses several strategies for fixing the definitions.  ...  far lower security level to each of these primitives and protocols.  ...  A batch of n independent random accesses to the same table of size n has similar cost in both metrics (since it can be simulated by sorting), but many algorithms require serial random accesses.  ... 
doi:10.1007/978-3-642-42045-0_17 fatcat:eh677w5xbbcfnlfq25642mfeyq

Efficient mesoscale hydrodynamics: Multiparticle collision dynamics with massively parallel GPU acceleration

Michael P. Howard, Athanassios Z. Panagiotopoulos, Arash Nikoubashman
2018 Computer Physics Communications  
We present an efficient open-source implementation of the multiparticle collision dynamics (MPCD) algorithm that scales to run on hundreds of graphics processing units (GPUs).  ...  We especially focus on optimizations for modern GPU architectures and communication patterns between multiple GPUs.  ...  Acknowledgements This research is part of the Blue Waters sustained-petascale computing project, which is supported by the  ... 
doi:10.1016/j.cpc.2018.04.009 fatcat:7mdnhg63vng5vmy7i4dy2b5oxm

Low-gate Quantum Golden Collision Finding [article]

Samuel Jaques, André Schrottenloher
2020 IACR Cryptology ePrint Archive  
The quantum circuit model implies a linear cost for random access, which annihilates the exponential advantage of the previous quantum collision-nding algorithms over Grover's algorithm or classical van  ...  Under the assumption of a two-dimensional connectivity layout, we provide better quantum parallelization methods for generic and golden collision nding.  ...  S.J. was supported by the University of Oxford Clarendon fund, and would like to thank Christophe Petit and Richard Meister for helpful comments.  ... 
dblp:journals/iacr/JaquesS20 fatcat:nkuetroefvfzlana4xvb2p7egm

Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures

Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
1997 Information and Computation  
We consider randomized simulations of shared memory on a distributed memory machine (DMM) where the n processors and the n memory modules of the DMM are connected via a reconfigurable architecture.  ...  Here the n processors and n modules are connected via an n_n reconfigurable mesh.  ...  ACKNOWLEDGMENT We are grateful to Assaf Schuster for pointing out the problem of simulations on a reconfigurable mesh. Received February 22, 1996; final manuscript received March 25, 1997  ... 
doi:10.1006/inco.1997.2642 fatcat:6p23hty4wvdqhoeq5az2c4hxp4

Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions [chapter]

Ilan Komargodski, Moni Naor, Eylon Yogev
2018 Lecture Notes in Computer Science  
Collision resistant hash functions are one of the more useful cryptographic primitives both in theory and in practice and two prominent applications are in signature schemes and succinct zero-knowledge  ...  We show that for some of the major applications of CRH functions it is possible to replace them by the weaker notion of an Multi-CRH, albeit at the price of adding interaction: we show a statistically  ...  Acknowledgments We are grateful to Noga Ron-Zewi for telling us about list-recoverable codes, for multiple useful discussions, and for sharing with us a preliminary version of [HRZW17] .  ... 
doi:10.1007/978-3-319-78375-8_6 fatcat:ikqwey5xpff55nysmvvu7nmvd4

Collision-Resolution Algorithms and Random-Access Communications [chapter]

James L. Massey
1981 Multi-User Communication Systems  
RANDOM-ACCESS VIA COLLISION-RESOLUTION The Obvious Random-Access Algorithm We now consider the use of a collision-resolution algorithm as the key part of a random-access algorithm for the idealized situation  ...  Definition of. a Collision-Resolution Algorithm By a collision-resolution algorithm for the random-accessing of a collision-type channel with feedback, we mean a protocol for the transmission and retransmission  ... 
doi:10.1007/978-3-7091-2900-5_4 fatcat:kxsn63knfnfwljyzz7i2qkyojm

Collision Times in Multicolor Urn Models and Sequential Graph Coloring With Applications to Discrete Logarithms [article]

Bhaswar B. Bhattacharya
2016 arXiv   pre-print
The results can be used to obtain the limiting distributions of running times in various birthday problem based algorithms for solving the discrete logarithm problem, generalizing previous results which  ...  Joint distribution of successive collision times and multi-fold collision times are also derived.  ...  The author also thanks an anonymous referee for carefully reading the manuscript and for providing many helpful comments, which improved the quality and presentation of the paper.  ... 
arXiv:1311.4243v5 fatcat:4izvo2t34bgfhnzy6v455ie7py

Page 5647 of Mathematical Reviews Vol. , Issue 91J [page]

1991 Mathematical Reviews  
RCT-C) The power of collision: randomized parallel algorithms for chaining and integer sorting.  ...  The techniques used extend to improved randomized algorithms for the problem of chaining, which is the following: Given an array X1,°°:,X, such that m of the locations contain nonzero elements, chain together  ... 

Page 61 of Journal of Research and Practice in Information Technology Vol. 27, Issue 2 [page]

1995 Journal of Research and Practice in Information Technology  
RAMAN. (1990): The power of collision: randomized parallel algorithms for chaining and integer sorting, Proceedings FSTTCS.  ...  REIF, J.H. (1985): An optimal parallel algorithm for integer sorting, Pro- ceedings 26th Symp on Foundations of Computer Science, 496-504.  ... 

Chosen-prefix collisions for MD5 and applications

Marc Stevens, Arjen K. Lenstra, Benne De Weger
2012 International Journal of Applied Cryptography  
The practical attack potential of this construction of chosen-prefix collisions is of greater concern than the MD5-collisions that were published before.  ...  We have shown how, at an approximate expected cost of 2 39 calls to the MD5 compression function, for any two chosen message prefixes P and P , suffixes S and S can be constructed such that the concatenated  ...  We are grateful for comments and assistance re- This work has been supported in part by the Swiss National Science Foundation under grant number 206021-117409, by EPFL DIT, and by the European Commission  ... 
doi:10.1504/ijact.2012.048084 fatcat:ykzgio3vpzd3hk5ufr7g66zmpa

Collision times in multicolor urn models and sequential graph coloring with applications to discrete logarithms

Bhaswar B. Bhattacharya
2016 The Annals of Applied Probability  
The results can be used to obtain the limiting distributions of running times in various birthday problem based algorithms for solving the discrete logarithm problem, generalizing previous results which  ...  The results can be used to obtain the limiting distributions of running times in various birthday problem based algorithms for solving the discrete logarithm problem, generalizing previous results which  ...  The author also thanks an anonymous referee for carefully reading the manuscript and for providing many helpful comments, which improved the quality and presentation of the paper.  ... 
doi:10.1214/16-aap1176 fatcat:r2o5llb6yngk3fh7kfuu3v7wta

On the Practical (In-)Security of 64-bit Block Ciphers: Collision Attacks on HTTP over TLS and OpenVPN [article]

Karthikeyan Bhargavan, Gaëtan Leurent
2016 IACR Cryptology ePrint Archive  
Indeed, practical collision attacks have never been demonstrated against any mainstream security protocol, leading to the continued use of 64-bit ciphers on the Internet.  ...  We discuss mitigations, such as disabling all 64-bit block ciphers, and report on the response of various software vendors to our responsible disclosure of these attacks.  ...  For example, the OpenSSL library supports five versions of TLS and hundreds of ciphersuites, even though many of these ciphersuites include weak algorithms like RC4 and MD5.  ... 
dblp:journals/iacr/BhargavanL16 fatcat:ighusk3rjjhnvd2j3mp5lirbna

On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography [chapter]

Douglas Miller, Adam Scrivener, Jesse Stern, Muthuramakrishnan Venkitasubramaniam
2016 Lecture Notes in Computer Science  
First, we determine tight lower bounds on the negation complexity of collision-resistant and target collision-resistant hash-function families. 2.  ...  pseudo-random functions, error-correcting codes, hardcore-predicates and randomness extractors.  ...  The views expressed are those of the authors and do not reflect the official policy or position of Google, the Department of Defense, the National Science Foundation, or the U.S. Government.  ... 
doi:10.1007/978-3-319-49890-4_19 fatcat:dghht4htafajvmaaliac6pagqm

A Top-Down Parallel Semisort

Yan Gu, Julian Shun, Yihan Sun, Guy E. Blelloch
2015 Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures - SPAA '15  
We use ideas from the parallel integer sorting algorithm of Rajasekaran and Reif, but instead of processing bits of a integers in a reduced range in a bottom-up fashion, we process the hashed values of  ...  We describe a (randomized) parallel algorithm for the problem that is theoretically efficient (linear work and logarithmic depth), but is designed to be more practically efficient than previous algorithms  ...  Acknowledgments This work is partially supported by the National Science Foundation under grant CCF-1218188, and by the Intel Science and Technology Center for Cloud Computing.  ... 
doi:10.1145/2755573.2755597 dblp:conf/spaa/GuSSB15 fatcat:nexgxl375vckzgfhs73rwryfyu
« Previous Showing results 1 — 15 out of 3,361 results