The following pages link to (Q4409125):
Displayed 50 items.
- Walsh transforms and cryptographic applications in bias computing (Q276565) (← links)
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications (Q398976) (← links)
- The extended \(k\)-tree algorithm (Q431783) (← links)
- A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences (Q488250) (← links)
- Espresso: a stream cipher for 5G wireless communication systems (Q505077) (← links)
- Revisiting Gilbert's known-key distinguisher (Q780379) (← links)
- Improvements to RSA key generation and CRT on embedded devices (Q826302) (← links)
- FROST: Flexible round-optimized Schnorr threshold signatures (Q832324) (← links)
- Attacks on a double length blockcipher-based hash proposal (Q892386) (← links)
- Asymptotic results for the number of Wagner's solutions to a generalised birthday problem (Q900974) (← links)
- Cryptanalysis of an E0-like combiner with memory (Q1021238) (← links)
- An overview of distinguishing attacks on stream ciphers (Q1032489) (← links)
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- A pseudorandom number generator based on worst-case lattice problems (Q1675485) (← links)
- A new diversity estimator (Q1690075) (← links)
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem (Q1715853) (← links)
- An algorithmic framework for the generalized birthday problem (Q1999907) (← links)
- Slidex attacks on the Even-Mansour encryption scheme (Q2018815) (← links)
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- Compactness of hashing modes and efficiency beyond Merkle tree (Q2056724) (← links)
- Lattice-based blind signatures, revisited (Q2096538) (← links)
- Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric (Q2118524) (← links)
- Attacks on beyond-birthday-bound MACs in the quantum setting (Q2118560) (← links)
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model (Q2119006) (← links)
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms (Q2119016) (← links)
- Two-round trip Schnorr multi-signatures via delinearized witnesses (Q2120071) (← links)
- MuSig2: simple two-round Schnorr multi-signatures (Q2120074) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- One-more unforgeability of blind ECDSA (Q2148761) (← links)
- A new approach for finding low-weight polynomial multiples (Q2151296) (← links)
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions (Q2161418) (← links)
- Information-set decoding with hints (Q2163764) (← links)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) (← links)
- On the security of ECDSA with additive key derivation and presignatures (Q2170006) (← links)
- Refined cryptanalysis of the GPRS ciphers GEA-1 and GEA-2 (Q2170080) (← links)
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD (Q2170098) (← links)
- Characterizing collision and second-preimage resistance in Linicrypt (Q2175923) (← links)
- Generic attacks on hash combiners (Q2188959) (← links)
- Fast computation of linear approximation over certain composition functions and applications to SNOW 2.0 and SNOW 3G (Q2205894) (← links)
- A method of evaluating the security of Snow 2.0-like ciphers against correlation attacks over the finite extensions of two element field (Q2215268) (← links)
- Simple Schnorr multi-signatures with applications to bitcoin (Q2324793) (← links)
- A survey on fast correlation attacks (Q2376656) (← links)
- Asymptotically efficient lattice-based digital signatures (Q2413615) (← links)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) (Q2448084) (← links)
- Integral distinguishers for reduced-round Stribog (Q2448116) (← links)
- Robust and timely communication over highly dynamic sensor networks (Q2460202) (← links)
- Enhancing the security of perfect blind DL-signatures (Q2489230) (← links)
- Results on multiples of primitive polynomials and their products over GF(2) (Q2566016) (← links)
- A discrete logarithm-based approach to compute low-weight multiples of binary polynomials (Q2634391) (← links)