Publication:4409125
From MaRDI portal
zbMath1026.94541MaRDI QIDQ4409125
Publication date: 30 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2442/24420288.htm
68Q25: Analysis of algorithms and problem complexity
94A60: Cryptography
60C05: Combinatorial probability
94A62: Authentication, digital signatures and secret sharing
Related Items
Improved Zero-Knowledge Identification with Lattices, Interpreting Hash Function Security Proofs, 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, Walsh transforms and cryptographic applications in bias computing, Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x\) and some cryptographic applications], The extended \(k\)-tree algorithm, A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences, Espresso: a stream cipher for 5G wireless communication systems, Attacks on a double length blockcipher-based hash proposal, Asymptotic results for the number of Wagner's solutions to a generalised birthday problem, Cryptanalysis of an E0-like combiner with memory, An overview of distinguishing attacks on stream ciphers, A pseudorandom number generator based on worst-case lattice problems, A new diversity estimator, Slidex attacks on the Even-Mansour encryption scheme, A survey on fast correlation attacks, 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, 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, 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
