Results 51 to 60 of about 475 (134)

Parameterization of Boolean functions by vectorial functions and associated constructions [PDF]

open access: yes, 2022
Despite intensive research on Boolean functions for cryptography for over thirty years, there are very few known general constructions allowing to satisfy all the necessary criteria for ensuring the resistance against all the main known attacks on the ...
Claude Carlet
core  

on the resistance of boolean functions against fast algebraic attacks

open access: yes, 2012
Boolean functions with large algebraic immunity resist algebraic attacks to a certain degree, but they may not resist fast algebraic attacks (FAA's). It is necessary to study the resistance of Boolean functions against FAA's.
Zhang Fangguo, Du Yusong, Liu Meicheng
core  

New balanced Boolean functions satisfying all the main cryptographic criteria [PDF]

open access: yes, 2008
We study an infinite class of functions which provably achieve an optimum algebraic immunity, an optimum algebraic degree and a good nonlinearity.
Claude Carlet, Keqin Feng
core  

A complete study of two classes of Boolean functions for homomorphic-friendly stream ciphers [PDF]

open access: yes, 2020
In this paper, we completely study two classes of Boolean functions that are suited for hybrid symmetric-FHE encryption with stream ciphers like FiLIP.
Claude Carlet, Pierrick Méaux
core  

ANALYSIS OF LIGHTWEIGHT STREAM CIPHERS [PDF]

open access: yes, 2008
Stream ciphers are fast cryptographic primitives to provide confidentiality of electronically transmitted data. They can be very suitable in environments with restricted resources, such as mobile devices or embedded systems.
Simon Fischer, Fischer, Simon
core   +1 more source

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

open access: yes, 2018
The algebraic immunity of Boolean functions is studied in this paper. More precisely, having the prominent Carlet–Feng construction as a starting point, we propose a new method to construct a large number of functions with maximum algebraic immunity. The
Kolokotronis, N., Limniotis, K.
core  

Almost fully optimized infinite classes of Boolean functions resistant to (fast) algebraic cryptanalysis

open access: yes, 2013
In this paper the possibilities of an iterative concatenation method towards construction of Boolean functions resistant to algebraic cryptanalysis are investigated.
Pašalić, Enes
core  

Vectorial Boolean functions and induced algebraic equations

open access: yes, 2004
A general mathematical framework behind algebraic cryptanalytic attacks is developed. The framework relates to finding algebraic equations induced by vectorial Boolean functions and, in particular, equations of low algebraic degree.
Jovan Dj. Golic
core  

Use of Simple Arithmetic Operations to Construct Efficiently Implementable Boolean functions Possessing High Nonlinearity and Good Resistance to Algebraic Attacks [PDF]

open access: yes
We describe a new class of Boolean functions which provide the presently best known trade-off between low computational complexity, nonlinearity and (fast) algebraic immunity.
Palash Sarkar, Claude Carlet
core  

Home - About - Disclaimer - Privacy