Pseudorandom Functions and Lattices

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-29011-4_42
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Construction of Pseudorandom Binary Lattices Using Elliptic Curves

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2011English

Weak Pseudorandom Functions in Minicrypt

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

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

Cone Lattices of Upper Semicontinuous Functions

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1982English

Characterization of Lattice Measurable Functions on Product Lattices

Asian Journal of Algebra
2012English

Two Extension Theorems. Modular Functions on Complemented Lattices

Czechoslovak Mathematical Journal
Mathematics
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy