On the fast algebraic immunity of threshold functions
From MaRDI portal
Publication:2121004
DOI10.1007/s12095-021-00505-yzbMath1492.94252OpenAlexW3177417274MaRDI QIDQ2121004
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
Related Items (4)
On the algebraic immunity of direct sum constructions ⋮ Weightwise perfectly balanced functions and nonlinearity ⋮ Weightwise almost perfectly balanced functions: secondary constructions for all \(n\) and better weightwise nonlinearities ⋮ On the weightwise nonlinearity of weightwise perfectly balanced functions
Cites Work
- Unnamed Item
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation
- Improved filter permutators for efficient FHE: better instances and implementations
- On the fast algebraic immunity of majority functions
- Balancedness and correlation immunity of symmetric Boolean functions
- Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
- Recent Results on Balanced Symmetric Boolean Functions
- Candidate One-Way Functions Based on Expander Graphs
- Boolean Functions for Homomorphic-Friendly Stream Ciphers
- Symmetric Boolean Functions
- On the Degree, Nonlinearity, Algebraic Thickness, and Nonnormality of Boolean Functions, With Developments on Symmetric Functions
- A Note on Symmetric Boolean Functions With Maximum Algebraic Immunity in Odd Number of Variables
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- Incidence Matrices of Subsets—A Rank Formula
- Algebraic Attacks against Random Local Functions and Their Countermeasures
- Maximum nonlinearity of symmetric Boolean functions on odd number of variables
- Constructing Symmetric Boolean Functions With Maximum Algebraic Immunity
- Boolean Functions for Cryptography and Coding Theory
- Two Classes of Symmetric Boolean Functions With Optimum Algebraic Immunity: Construction and Analysis
- Advances in Cryptology – CRYPTO 2004
- Algebraic attacks against random local functions and their countermeasures
- Advances in Cryptology - CRYPTO 2003
- On the Algebraic Immunity of Symmetric Boolean Functions
- Fast Software Encryption
This page was built for publication: On the fast algebraic immunity of threshold functions
