Results 11 to 20 of about 12,248 (142)
Revisiting Variable Output Length XOR Pseudorandom Function
Let σ be some positive integer and C ⊆ {(i, j) : 1 ≤ i < j ≤ σ}. The theory behind finding a lower bound on the number of distinct blocks P1, . . . , Pσ ∈ {0, 1}n satisfying a set of linear equations {Pi ⊕Pj = ci,j : (i, j) ∈ C} for some ci,j ∈ {0, 1}n ...
Srimanta Bhattacharya, Mridul Nandi
doaj +1 more source
Exploring Crypto-Physical Dark Matter and Learning with Physical Rounding
State-of-the-art re-keying schemes can be viewed as a tradeoff between efficient but heuristic solutions based on binary field multiplications, that are only secure if implemented with a sufficient amount of noise, and formal but more expensive solutions
Sébastien Duval +3 more
doaj +3 more sources
Revisiting structure graphs: Applications to CBC-MAC and EMAC
In [2], Bellare, Pietrzak and Rogaway proved an O(ℓq2/2n)${O(\ell q^{2}/2^{n})}$ bound for the PRF (pseudorandom function) security of the CBC-MAC based on an n-bit random permutation Π, provided ...
Jha Ashwin, Nandi Mridul
doaj +1 more source
A Note on Quantum-Secure PRPs [PDF]
We show how to construct pseudorandom permutations (PRPs) that remain secure even if the adversary can query the permutation, both in the forward and reverse directions, on a quantum superposition of inputs.
Mark Zhandry
doaj +1 more source
Currently, heuristic methods based on iterative changing of feasible solutions set provide a perspective tool for generation equipment maintenance scheduling in power systems.
Pavel Yu. Gubin, Vladislav P. Oboskalov
doaj +1 more source
Farfalle: parallel permutation-based cryptography
In this paper, we introduce Farfalle, a new permutation-based construction for building a pseudorandom function (PRF). The PRF takes as input a key and a sequence of arbitrary-length data strings, and returns an arbitrary-length output.
Guido Bertoni +5 more
doaj +1 more source
Privacy protection key distribution protocol for edge computing
Aiming at the privacy protection problem in the multi-application scenarios of edge computing, two policy-based key distribution protocols were proposed.The proposed protocols are based on the concept of constrained pseudo-random functions to achieve ...
Jian SHEN +3 more
doaj +3 more sources
Pseudorandom Noise Forced Oscillation Technique to Assess Lung Function in Prematurely Born Children
The forced oscillation technique (FOT) is a non-volitional assessment that is used during tidal breathing. A variant of FOT uses a pseudorandom noise (PRN) signal which we postulated might have utility in assessing lung function in prematurely born ...
Shannon Gunawardana +2 more
doaj +1 more source
Pseudorandom Function from Learning Burnside Problem
We present three progressively refined pseudorandom function (PRF) constructions based on the learning Burnside homomorphisms with noise (Bn-LHN) assumption. A key challenge in this approach is error management, which we address by extracting errors from
Dhiraj K. Pandey, Antonio R. Nicolosi
doaj +1 more source
Optimal pseudorandom sequence selection for online c-VEP based BCI control applications.
BackgroundIn a c-VEP BCI setting, test subjects can have highly varying performances when different pseudorandom sequences are applied as stimulus, and ideally, multiple codes should be supported.
Jonas L Isaksen +2 more
doaj +1 more source

