Weak Pseudorandom Functions in Minicrypt

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-70583-3_35
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Pseudorandom Functions and Lattices

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Parallelizable Rate-1 Authenticated Encryption From Pseudorandom Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

A Security Analysis of Key Expansion Functions Using Pseudorandom Permutations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

The Complexity of Constructing Pseudorandom Generators From Hard Functions

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2005English

Pseudorandom Generators

English

Weak Uniform Distribution for Divisor Functions. I

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1988English

Robust Pseudorandom Generators

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Axiomatic Characterization of Transit Functions of Weak Hierarchies

The Art of Discrete and Applied Mathematics
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy