Octal Bent Generalized Boolean Functions

In this paper we characterize (octal) bent generalized Boolean functions defined on \BBZ_2^n with values in \BBZ_8. Moreover, we propose several constructions of such generalized bent functions for both $n$ even and $n$ odd

Neutrosophic Boolean Function and Rejection Sampling in Post Quantum Cryptography

The use of random seeds to a deterministic random bit generator to generate uniform random sampling has been applied multiple times in post-quantum algorithms. The finalists Dilithium and Kyber use SHAKE and AES to generate the random sequence at multiple stages of the algorithm. Here we characterize one of the sampleing techniques available in Dilithium for a random sequence of length 256 with the help of the neutrosophic Boolean function. The idea of the neutrosophic Boolean function came from the theory of neutrosophy and it is useful to study any ternary distributions. We present the non-existence of neutrobalanced bent functions specifically with respect to the sampling named SampleInBall in Dilithium

Octal Generalized Boolean Functions

In this paper we characterize (octal) bent generalized Boolean functions defined on..