scholarly journals Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs

2012 ◽  
pp. 68-85 ◽  
Author(s):  
Eric Miles ◽  
Emanuele Viola
Keyword(s):  
Pseudorandom Functions ◽  
Permutation Networks

scholarly journals Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs

2015 ◽  
Vol 62 (6) ◽  
pp. 1-29 ◽  
Author(s):  
Eric Miles ◽  
Emanuele Viola
Keyword(s):  
Pseudorandom Functions ◽  
Permutation Networks

Characterizing bit permutation networks

Networks ◽  
1999 ◽  
Vol 33 (4) ◽  
pp. 261-267 ◽  
Author(s):  
Gerard J. Chang ◽  
Frank K. Hwang ◽  
Li-Da Tong
Keyword(s):  
Permutation Networks

scholarly journals On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks

2009 ◽  
Vol 23 (3) ◽  
pp. 1612-1645
Author(s):  
Juraj Hromkovič ◽  
PrzemysŁawa Kanarek ◽  
Ralf Klasing ◽  
Krzysztof Loryś ◽  
Walter Unger ◽  
...  
Keyword(s):  
Bounded Degree ◽  
Efficient Simulation ◽  
Permutation Networks

Substitution–Permutation Networks

2020 ◽  
pp. 165-186
Author(s):  
William Easttom
Keyword(s):  
Permutation Networks

scholarly journals Cryptanalysis of PMACx, PMAC2x, and SIVx

2017 ◽  
pp. 162-176
Author(s):  
Kazuhiko Minematsu ◽  
Tetsu Iwata
Keyword(s):  
Provable Security ◽  
Block Cipher ◽  
Query Complexity ◽  
Block Length ◽  
Encryption Scheme ◽  
Authenticated Encryption ◽  
Pseudorandom Functions ◽  
Tweakable Block Cipher ◽  
Deterministic Authenticated Encryption ◽  
Provably Secure

At CT-RSA 2017, List and Nandi proposed two variable input length pseudorandom functions (VI-PRFs) called PMACx and PMAC2x, and a deterministic authenticated encryption scheme called SIVx. These schemes use a tweakable block cipher (TBC) as the underlying primitive, and are provably secure up to the query complexity of 2n, where n denotes the block length of the TBC. In this paper, we falsify the provable security claims by presenting concrete attacks. We show that with the query complexity of O(2n/2), i.e., with the birthday complexity, PMACx, PMAC2x, and SIVx are all insecure.

Round-Optimal Verifiable Oblivious Pseudorandom Functions from Ideal Lattices

2021 ◽  
pp. 261-289
Author(s):  
Martin R. Albrecht ◽  
Alex Davidson ◽  
Amit Deo ◽  
Nigel P. Smart
Keyword(s):  
Ideal Lattices ◽  
Pseudorandom Functions

Realization of sets of permutations by permutation networks

1989 ◽  
pp. 326-331
Author(s):  
R. Pöschel ◽  
F. Wächter ◽  
F. Börner
Keyword(s):  
Permutation Networks
Sign in / Sign up

Export Citation Format

Share Document