Neutrosophic Boolean Function and Rejection Sampling in Post Quantum Cryptography

Shashi Kant Pandey

Paper 2023/1333

Neutrosophic Boolean Function and Rejection Sampling in Post Quantum Cryptography

Shashi Kant Pandey

, Society for Electronic Transection and Security (SETS)

Abstract

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.

Metadata

Available format(s): PDF
Category: Attacks and cryptanalysis
Publication info: Preprint.
Keywords: Post-quantum cryptography Bent function Neutrosophy Linear structure
Contact author(s): shashikantshvet @ gmail com
History: 2023-09-08: approved; 2023-09-07: received; See all versions
Short URL: https://ia.cr/2023/1333
License: CC BY

BibTeX

@misc{cryptoeprint:2023/1333,
      author = {Shashi Kant Pandey},
      title = {Neutrosophic Boolean Function and Rejection Sampling in Post Quantum Cryptography},
      howpublished = {Cryptology ePrint Archive, Paper 2023/1333},
      year = {2023},
      note = {\url{https://eprint.iacr.org/2023/1333}},
      url = {https://eprint.iacr.org/2023/1333}
}