Best practices in designing, sequencing, and identifying random DNA barcodes
Random DNA barcodes are a versatile tool for tracking cell lineages, with applications
ranging from development to cancer to evolution. Here, we review and critically evaluate …
ranging from development to cancer to evolution. Here, we review and critically evaluate …
Solving LPN using covering codes
We present a new algorithm for solving the LPN problem. The algorithm has a similar form
as some previous methods, but includes a new key step that makes use of approximations of …
as some previous methods, but includes a new key step that makes use of approximations of …
DEVELOPMENT AND ANALYSIS OF THE NEW HASHING ALGORITHM BASED ON BLOCK CIPHER.
K Sakan, S Nyssanbayeva… - Eastern-European …, 2022 - search.ebscohost.com
This paper proposes the new hash algorithm HBC256 (Hash based on Block Cipher) based
on the symmetric block cipher of the CF (Compression Function). The algorithm is based on …
on the symmetric block cipher of the CF (Compression Function). The algorithm is based on …
Improved Fast Correlation Attacks on the Sosemanuk Stream Cipher
B Zhang, R Liu, X Gong, L Jiao - IACR Transactions on Symmetric …, 2023 - tosc.iacr.org
In this paper, we present a new algorithm for fast correlation attacks on stream ciphers with
improved cryptanalysis results on the Sosemanuk stream cipher, one of the 7 finalists in the …
improved cryptanalysis results on the Sosemanuk stream cipher, one of the 7 finalists in the …
[HTML][HTML] Solving LPN using covering codes
We present a new algorithm for solving the LPN problem. The algorithm has a similar form
as some previous methods, but includes a new key step that makes use of approximations of …
as some previous methods, but includes a new key step that makes use of approximations of …
Memoryless near-collisions, revisited
M Lamberger, E Teufl - Information Processing Letters, 2013 - Elsevier
In this paper we discuss the problem of generically finding near-collisions for cryptographic
hash functions in a memoryless way. A common approach is to truncate several output bits …
hash functions in a memoryless way. A common approach is to truncate several output bits …
Near-collisions and their Impact on Biometric Security
A Durbet, PM Grollemund, P Lafourcade… - arxiv preprint arxiv …, 2022 - arxiv.org
Biometric recognition encompasses two operating modes. The first one is biometric
identification which consists in determining the identity of an individual based on her …
identification which consists in determining the identity of an individual based on her …
Time-memory trade-offs for near-collisions
G Leurent - International Workshop on Fast Software Encryption, 2013 - Springer
In this work we consider generic algorithms to find near-collisions for a hash function. If we
consider only hash computations, it is easy to compute a lower-bound for the complexity of …
consider only hash computations, it is easy to compute a lower-bound for the complexity of …
Some notes on code-based cryptography
C Löndahl - 2015 - portal.research.lu.se
Some Notes on Code-Based Cryptography Löndahl, Carl Page 1 Some Notes on Code-Based
Cryptography Löndahl, Carl 2015 Link to publication Citation for published version (APA) …
Cryptography Löndahl, Carl 2015 Link to publication Citation for published version (APA) …
Using random error correcting codes in near-collision attacks on generic hash-functions
I Polak, A Shamir - International Conference on Cryptology in India, 2014 - Springer
In this paper we consider the problem of finding near-collisions with Hamming distance
bounded by r in generic n-bit hash functions. In 2011, Lamberger and Rijmen proposed a …
bounded by r in generic n-bit hash functions. In 2011, Lamberger and Rijmen proposed a …