Search results
From MaRDI portal
- Paper A New Dedicated 256-Bit Hash Function: FORK-256 2009-04-02 Paper Preimage Attack on the Parallel FFT-Hashing Function 2009-03-06 Paper Improved Indifferentiability...10 bytes (13 words) - 17:50, 24 September 2023
- Preimage Attack on the Parallel FFT-Hashing Function 2009-03-06 Paper Related-Key Amplified Boomerang Attacks on the Full-Round Eagle-64 and Eagle-128 2009-03-06...10 bytes (13 words) - 21:41, 10 December 2023
- Preimage Attack on the Parallel FFT-Hashing Function 2009-03-06 Paper Related-Key Amplified Boomerang Attacks on the Full-Round Eagle-64 and Eagle-128 2009-03-06...10 bytes (13 words) - 21:41, 10 December 2023
- Paper A New Dedicated 256-Bit Hash Function: FORK-256 2009-04-02 Paper Preimage Attack on the Parallel FFT-Hashing Function 2009-03-06 Paper Provable Security...10 bytes (14 words) - 18:22, 9 December 2023
- from Fixed-Length PRPs 2009-04-29 Paper Preimage Attack on the Parallel FFT-Hashing Function 2009-03-06 Paper Cryptographic Hardness Based on the Decoding...10 bytes (15 words) - 09:21, 8 December 2023
- Without Quantum Computers: The Case of Multiquadratics 2017-06-13 Paper Hash-Function Based PRFs: AMAC and Its Multi-User Security 2016-09-09 Paper Dual EC:...10 bytes (17 words) - 07:07, 7 October 2023
- Nonmalleable Commitments 2008-12-22 Paper SWIFFT: A Modest Proposal for FFT Hashing 2008-09-18 Paper On Robust Combiners for Oblivious Transfer and Other...10 bytes (14 words) - 08:34, 7 October 2023
- de/entity/Q3549647 2009-01-05 Paper SWIFFT: A Modest Proposal for FFT Hashing 2008-09-18 Paper Limits on the hardness of lattice problems in \(\ell_{p}\) norms...10 bytes (15 words) - 06:39, 7 October 2023
- {F}_{q}+v^{2}\mathbb {F}_{q}\) 2018-07-19 Paper A Low-Complexity PTS-Based Radix FFT Method for PAPR Reduction in OFDM Systems 2018-06-27 Paper Double Point Compression...10 bytes (17 words) - 16:48, 8 December 2023
- Preimage Attack on the Parallel FFT-Hashing Function This page was built for publication: Preimages for the Tillich-Zémor hash function Report a bug (only...15 bytes (433 words) - 21:48, 3 February 2024
- for the Tillich-Zémor hash function 👍 👎 This page was built for publication: Preimage Attack on the Parallel FFT-Hashing Function Report a bug (only for...15 bytes (148 words) - 04:19, 5 February 2024
- memory-hard functions Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks Bandwidth-Hard Functions: Reductions...15 bytes (447 words) - 20:38, 8 February 2024
- knowledge via cycles of elliptic curves How to Build a Hash Function from Any Collision-Resistant Function Post-quantum cryptography: lattice signatures CCA...15 bytes (530 words) - 00:03, 5 February 2024
- NOT Yield Correlation Intractable Function Ensembles The GGM Function Family Is a Weakly One-Way Family of Functions Approximation, Randomization, and...15 bytes (1,162 words) - 10:26, 8 February 2024
- that?) Title not available (Why is that?) SWIFFT: A Modest Proposal for FFT Hashing Fast Cryptographic Primitives and Circular-Secure Encryption Based on...15 bytes (523 words) - 19:32, 3 February 2024
- tree dags on parallel architectures Algebraic methods in the congested clique Locality-preserving hash functions for general purpose parallel computation...15 bytes (263 words) - 17:05, 30 January 2024
- (65-XX) Computer science (68-XX) Cites Work SWIFFT: A Modest Proposal for FFT Hashing Generalized Compact Knapsacks Are Collision Resistant Theory of Cryptography...15 bytes (146 words) - 10:17, 8 February 2024
- octrees p4est: scalable algorithms for parallel adaptive mesh refinement on forests of octrees Publication:4473919 Parallel tree algorithms for AMR and non-standard...15 bytes (664 words) - 17:01, 4 February 2024
- arithmetic geometry (14G50) Cites Work SWIFFT: A Modest Proposal for FFT Hashing Trapdoors for hard lattices and new cryptographic constructions Efficient...15 bytes (575 words) - 15:22, 2 February 2024
- SWIFFT: A Modest Proposal for FFT Hashing Generalized compact knapsacks, cyclic lattices, and efficient one-way functions Fast Cryptographic Primitives...15 bytes (341 words) - 05:05, 1 February 2024
