On the fast algebraic immunity of threshold functions
From MaRDI portal
Publication:2121004
DOI10.1007/S12095-021-00505-YzbMATH Open1492.94252OpenAlexW3177417274MaRDI QIDQ2121004FDOQ2121004
Publication date: 1 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00505-y
Recommendations
- On the fast algebraic immunity of majority functions
- Algebraic attacks on stream ciphers: recent developments and new results
- Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks
- Fast algebraic immunity of Boolean functions
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
Cites Work
- Symmetric Boolean Functions
- On the Degree, Nonlinearity, Algebraic Thickness, and Nonnormality of Boolean Functions, With Developments on Symmetric Functions
- Title not available (Why is that?)
- Maximum nonlinearity of symmetric Boolean functions on odd number of variables
- Advances in Cryptology - CRYPTO 2003
- On the Algebraic Immunity of Symmetric Boolean Functions
- Fast Software Encryption
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Candidate One-Way Functions Based on Expander Graphs
- Recent Results on Balanced Symmetric Boolean Functions
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- Constructing Symmetric Boolean Functions With Maximum Algebraic Immunity
- Advances in Cryptology – CRYPTO 2004
- Balancedness and correlation immunity of symmetric Boolean functions
- A Note on Symmetric Boolean Functions With Maximum Algebraic Immunity in Odd Number of Variables
- Incidence Matrices of Subsets—A Rank Formula
- Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
- Two Classes of Symmetric Boolean Functions With Optimum Algebraic Immunity: Construction and Analysis
- Boolean Functions for Cryptography and Coding Theory
- Algebraic attacks against random local functions and their countermeasures
- On the fast algebraic immunity of majority functions
- Boolean Functions for Homomorphic-Friendly Stream Ciphers
- Improved filter permutators for efficient FHE: better instances and implementations
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- Algebraic Attacks against Random Local Functions and Their Countermeasures
Cited In (9)
- On the cryptographic properties of weightwise affine and weightwise quadratic functions
- Weightwise perfectly balanced functions and nonlinearity
- On the algebraic immunity of direct sum constructions
- Fast public-key silent OT and more from constrained Naor-Reingold
- On the weightwise nonlinearity of weightwise perfectly balanced functions
- On the fast algebraic immunity of majority functions
- Weightwise almost perfectly balanced functions: secondary constructions for all \(n\) and better weightwise nonlinearities
- On the algebraic immunity of weightwise perfectly balanced functions
- Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks
This page was built for publication: On the fast algebraic immunity of threshold functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2121004)
