In the past Xiangxue Li has collaborated on articles with Yu Yu. One of their most recent publications is Balanced 2p-variable rotation symmetric Boolean functions with optimal algebraic immunity, good nonlinearity, and good algebraic degree. Which was published in journal Journal of Mathematical Analysis and Applications.

More information about Xiangxue Li research including statistics on their citations can be found on their Copernicus Academic profile page.

Xiangxue Li's Articles: (2)

Balanced 2p-variable rotation symmetric Boolean functions with optimal algebraic immunity, good nonlinearity, and good algebraic degree

AbstractIn designing cryptographic Boolean functions, it is challenging to achieve at the same time the desirable features of algebraic immunity, balancedness, nonlinearity, and algebraic degree for necessary resistance against algebraic attack, correlation attack, Berlekamp–Massey attack, etc. This paper constructs balanced rotation symmetric Boolean functions on n variables where n=2p and p is an odd prime. We prove the construction has an optimal algebraic immunity and is of high nonlinearity. We check that, at least for those primes p which are not of the form of a power of two plus one, the algebraic degree of the construction achieves in fact the upper bound n−1.

Pseudorandom generators from regular one-way functions: New constructions with improved parameters☆

AbstractWe revisit the problem of basing pseudorandom generators on regular one-way functions, and present the following constructions:•For any known-regular one-way function (on n-bit inputs) that is known to be ε-hard to invert, we give a neat (and tighter) proof for the folklore construction of pseudorandom generator of seed length Θ(n) by making a single call to the underlying one-way function.•For any unknown-regular one-way function with known ε-hardness, we give a new construction with seed length Θ(n) and O(n/log⁡(1/ε)) calls. Here the number of calls is also optimal by matching the lower bounds of Holenstein and Sinha (2012) [6]. Both constructions require the knowledge about ε, but the dependency can be removed while keeping nearly the same parameters. In the latter case, we get a construction of pseudo-random generator from any unknown-regular one-way function using seed length O˜(n) and O˜(n/log⁡n) calls, where O˜ omits a factor that can be made arbitrarily close to constant (e.g. log⁡log⁡log⁡n or even less). This improves the randomized iterate approach by Haitner et al. (2006) [4] which requires seed length O(n⋅log⁡n) and O(n/log⁡n) calls.

Join Copernicus Academic and get access to over 12 million papers authored by 7+ million academics.
Join for free!

Contact us