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
On pairing-free blind signature schemes in the algebraic group model, SR-MuSig2: a scalable and reconfigurable multi-signature scheme and its applications, Analysis of (U,U+V)-code problem with Gramian over binary and ternary fields, Non-interactive Mimblewimble transactions, revisited, A non-heuristic approach to time-space tradeoffs and optimizations for BKW, Correlated pseudorandomness from expand-accumulate codes, Lifting standard model reductions to common setup assumptions, Universally composable \(\varSigma \)-protocols in the global random-oracle model, Information set decoding for Lee-metric codes using restricted balls, Statistical decoding 2.0: reducing decoding to LPN, Unnamed Item, Improved Zero-Knowledge Identification with Lattices, Interpreting Hash Function Security Proofs, Некоторые методы анализа функций хэширования и их применение к алгоритму ГОСТ Р 34.11-94, Quantum Hardness of Learning Shallow Classical Circuits, Streebog compression function as PRF in secret-key settings, A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes, Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes, Syndrome Decoding Estimator, Орбитальные производные над кольцом вычетов. Часть I. Общие свойства, 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, TinyKeys: a new approach to efficient multi-party computation, 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, Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices, On the (in)security of ROS, On the (im)possibility of secure ElGamal blind signatures, Pseudorandom correlation functions from variable-density LPN, revisited, S-semantics -- an example, Solving the learning parity with noise problem using quantum algorithms, Finding low-weight polynomial multiples using the rho method, 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, Revisiting Gilbert's known-key distinguisher, Improvements to RSA key generation and CRT on embedded devices, FROST: Flexible round-optimized Schnorr threshold signatures, 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, Quantum algorithms for the \(k\)-XOR problem, 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, 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, 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
