A Security Analysis of Key Expansion Functions Using Pseudorandom Permutations

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-43826-8_2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Construction for Super Pseudorandom Permutations From a Single Pseudorandom Function

English

Pseudorandom Functions and Lattices

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Weak Pseudorandom Functions in Minicrypt

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Unbelievable Security Matching AES Security Using Public Key Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

About the Security of Ciphers (Semantic Security and Pseudo-Random Permutations)

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Defect Level Estimation for Pseudorandom Testing Using Stochastic Analysis

VLSI Design
Electronic EngineeringComputer GraphicsHardwareElectricalArchitectureComputer-Aided Design
2001English

Parallelizable Rate-1 Authenticated Encryption From Pseudorandom Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Javascript Security Using Cryptographic Hash Functions

Advanced Information Systems
2019English

The Complexity of Constructing Pseudorandom Generators From Hard Functions

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy