On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator (Q6095188)

scientific article; zbMATH DE number 7735223

Language	Label	Description	Also known as
English	On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator	scientific article; zbMATH DE number 7735223

Statements

instance of

scholarly article

0 references

title

On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator (English)

0 references

0 references

0 references

0 references

Designs, Codes and Cryptography

0 references

publication date

7 September 2023

0 references

zbMATH Keywords

Boolean functions

0 references

local pseudorandom generator

0 references

algebraic immunity

0 references

resiliency

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10623-023-01220-w

0 references

cites work

Candidate weak pseudorandom functions in AC 0 ○ MOD 2

0 references

Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas

0 references

Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification

0 references

On the Security of Goldreich’s One-Way Function

0 references

Pseudorandom generators with long stretch and low locality from random local one-way functions

0 references

Cryptographic Hardness of Random Local Functions–Survey

0 references

Algebraic attacks against random local functions and their countermeasures

0 references

Algebraic Attacks against Random Local Functions and Their Countermeasures

0 references

On pseudorandom generators with linear stretch in $\mathrm{NC}^{0}$

0 references

A Dichotomy for Local Small-Bias Generators

0 references

A dichotomy for local small-bias generators

0 references

Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks

0 references

Q4940700

0 references

Exploring crypto dark matter: new simple PRF candidates and their applications

0 references

Efficient pseudorandom correlation generators from ring-LPN

0 references

On the Algebraic Immunity of Symmetric Boolean Functions

0 references

Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression

0 references

A Method of Construction of Balanced Functions with Optimum Algebraic Immunity

0 references

Boolean Functions for Cryptography and Coding Theory

0 references

An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity

0 references

Boolean Functions for Homomorphic-Friendly Stream Ciphers

0 references

A Complete Study of Two Classes of Boolean Functions: Direct Sums of Monomials and Threshold Functions

0 references

Algebraic immunity for cryptographically significant Boolean functions: analysis and construction

0 references

Further properties of several classes of Boolean functions with optimum algebraic immunity

0 references

Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks

0 references

A Novel Application of Boolean Functions With High Algebraic Immunity in Minimal Codes

0 references

Q4342497

0 references

On the One-Way Function Candidate Proposed by Goldreich

0 references

Q4434885

0 references

On the concrete security of Goldreich's pseudorandom generator

0 references

Q4779150

0 references

Fast evaluation, weights and nonlinearity of rotation-symmetric functions

0 references

Progress in Cryptology - INDOCRYPT 2004

0 references

Fast Software Encryption

0 references

Basic theory in construction of Boolean functions with maximum possible annihilator immunity

0 references

Computing the Algebraic Immunity Efficiently

0 references

Construction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity

0 references

Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification

0 references

Q3549728

0 references

How to leverage hardness of constant-degree expanding polynomials over $\mathbb{R}$ to build $i\mathcal{O}$

0 references

Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity > 240

0 references

Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity

0 references

On the Construction of Boolean Functions With Optimal Algebraic Immunity

0 references

Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks

0 references

Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction

0 references

Secondary constructions of Boolean functions with maximum algebraic immunity

0 references

Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks

0 references

Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation

0 references

Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts

0 references

Improved filter permutators for efficient FHE: better instances and implementations

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

A construction method of balanced rotation symmetric Boolean functions on arbitrary even number of variables with optimal algebraic immunity

0 references

Construction of 1-resilient Boolean functions with optimal algebraic immunity and good non\-linearity

0 references

Rotation-symmetric functions and fast hashing

0 references

On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation

0 references

Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity

0 references

Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)

0 references

Fast Software Encryption

0 references

Construction of rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity

0 references

Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks

0 references

A CLASS OF 1-RESILIENT BOOLEAN FUNCTIONS WITH OPTIMAL ALGEBRAIC IMMUNITY AND GOOD BEHAVIOR AGAINST FAST ALGEBRAIC ATTACKS

0 references

Construction of Highly Nonlinear 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Provably High Fast Algebraic Immunity

0 references

Q2707588

0 references

Construction of Resilient and Nonlinear Boolean Functions with Almost Perfect Immunity to Algebraic and Fast Algebraic Attacks

0 references

Revisiting the Concrete Security of Goldreich’s Pseudorandom Generator

0 references

More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks

0 references

A new construction of rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity

0 references

New constructions of even-variable rotation symmetric Boolean functions with maximum algebraic immunity

0 references

CONSTRUCTING 2m-VARIABLE BOOLEAN FUNCTIONSWITH OPTIMAL ALGEBRAIC IMMUNITY BASED ON POLAR DECOMPOSITION OF $\mathbb{F}^\ast_{2^{2m}}$

0 references

A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity

0 references

Boolean functions optimizing most of the cryptographic criteria

0 references

Identifiers

zbMATH Open document ID

1526.94061

0 references

DOI

10.1007/s10623-023-01220-w

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6095188