A generalized birthday problem
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Cryptanalysis of an E0-like combiner with memory
- An overview of distinguishing attacks on stream ciphers
- An O(n log n) algorithm for the generalized birthday problem
- Quantum algorithms for the \(k\)-XOR problem
- Birthday type attacks to the Naccache-Stern knapsack cryptosystem
- A pseudorandom number generator based on worst-case lattice problems
- A new diversity estimator
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
- An algorithmic framework for the generalized birthday problem
- Slidex attacks on the Even-Mansour encryption scheme
- Tight time-space lower bounds for finding multiple collision pairs and their applications
- Compactness of hashing modes and efficiency beyond Merkle tree
- Lattice-based blind signatures, revisited
- Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
- Attacks on beyond-birthday-bound MACs in the quantum setting
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Optimal merging in quantum k-xor and k-sum algorithms
- Two-round trip Schnorr multi-signatures via delinearized witnesses
- MuSig2: simple two-round Schnorr multi-signatures
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- One-more unforgeability of blind ECDSA
- A new approach for finding low-weight polynomial multiples
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- Information-set decoding with hints
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
- On the security of ECDSA with additive key derivation and presignatures
- Refined cryptanalysis of the GPRS ciphers GEA-1 and GEA-2
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- Characterizing collision and second-preimage resistance in Linicrypt
- Generic attacks on hash combiners
- Fast computation of linear approximation over certain composition functions and applications to SNOW 2.0 and SNOW 3G
- A method of evaluating the security of Snow 2.0-like ciphers against correlation attacks over the finite extensions of two element field
- Simple Schnorr multi-signatures with applications to bitcoin
- A survey on fast correlation attacks
- Asymptotically efficient lattice-based digital signatures
- Computational aspects of retrieving a representation of an algebraic geometry code
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\)
- Integral distinguishers for reduced-round Stribog
- Refining the asymptotic approximation of the group size in the birthday paradox
- Robust and timely communication over highly dynamic sensor networks
- Enhancing the security of perfect blind DL-signatures
- Results on multiples of primitive polynomials and their products over GF(2)
- A discrete logarithm-based approach to compute low-weight multiples of binary polynomials
- On the hardness of module learning with errors with short distributions
- Walsh transforms and cryptographic applications in bias computing
- Safe-errors on SPA protected implementations with the atomicity technique
- Constructing Carmichael numbers through improved subset-product algorithms
- Boomerang distinguishers on MD4-family: first practical results on full 5-pass HAVAL
- Improved analysis of ECHO-256
- Boomerang Attacks on Hash Function Using Auxiliary Differentials
- Really fast syndrome-based hashing
- Fast Correlation Attacks: Methods and Countermeasures
- Analysis of Reduced-SHAvite-3-256 v2
- Better key sizes (and attacks) for LWE-based encryption
- Zero-sum distinguishers for iterated permutations and application to Keccak-f and Hamsi-256
- Parallel-CFS
- Subspace distinguisher for 5/8 rounds of the ECHO-256 hash function
- Cryptanalysis of Luffa v2 components
- Decoding one out of many
- Boomerang attack on step-reduced SHA-512
- New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba
- Syndrome Based Collision Resistant Hashing
- Cryptanalysis of the GOST Hash Function
- One-Round ID-Based Blind Signature Scheme without ROS Assumption
- Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security
- Cryptanalysis of Tweaked Versions of SMASH and Reparation
- scientific article; zbMATH DE number 4072862 (Why is no real title available?)
- scientific article; zbMATH DE number 4096476 (Why is no real title available?)
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications
- scientific article; zbMATH DE number 58016 (Why is no real title available?)
- The extended \(k\)-tree algorithm
- The extended \(k\)-tree algorithm
- The general birthday problem
- A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences
- scientific article; zbMATH DE number 6122929 (Why is no real title available?)
- Improved Zero-Knowledge Identification with Lattices
- Interpreting hash function security proofs
- Some methods of hash functions analysis with application to the GOST P 34.11-94 algorithm
- Quantum hardness of learning shallow classical circuits
- Streebog compression function as PRF in secret-key settings
- Espresso: a stream cipher for 5G wireless communication systems
- A digital signature scheme \(\text{mCFS}^{\text{QC-LDPC}}\) based on QC-LDPC codes
- Equal-subset-sum faster than the meet-in-the-middle
- Time-memory tradeoffs for large-weight syndrome decoding in ternary codes
- Syndrome Decoding Estimator
- Orbital derivatives on residue rings. I: General properties
- Multi party computation motivated by the birthday problem
- Birthday Paradox for Multi-collisions
- Known-Key Distinguishers for Some Block Ciphers
- An Improved Multi-set Algorithm for the Dense Subset Sum Problem
- Generalized birthday problems in the large-deviations regime
- Linearization Attacks Against Syndrome Based Hashes
- Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- Improved algorithms for the approximate k-List problem in Euclidean norm
- On the (in)security of ROS
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- TinyKeys: a new approach to efficient multi-party computation
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- On the (in)security of ROS
This page was built for publication: A generalized birthday problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409125)
