A Proof of Security in O(2 N ) for the Xor of Two Random Permutations

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-85093-9_22
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

A Simple Proof of a Theorem of Schmerl and Trotter for Permutations

Journal of Combinatorics
2015English

Dominated Permutations of Subsequences of Random Variables

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1986English

Improving Automatic Verification of Security Protocols With XOR

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Subroutine for Generating All Permutations of N Integers

Behavior Research Methods
DevelopmentalArtsPsychologyEducational PsychologyCognitive PsychologyHumanitiesExperimental
1975English

A Security Analysis of Key Expansion Functions Using Pseudorandom Permutations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

The Number of Cycles in Random Permutations Without Long Cycles Is Asymptotically Gaussian

Alea
StatisticsProbability
2017English

One, Two and Three Times Log N/N for Paths in a Complete Graph With Random Weights

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
1999English

CIL Security Proof for a Password-Based Key Exchange

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy