3 citations · 10 across the 9 of their papers we have counts for
10 papers
Quantum-Accelerated Gowers Norm for Bent Boolean Functions
Rajdeep Dwivedi, C. A. Jothiwashran, Sugata Gangopadhyay +1
Bent Boolean functions extremal objects that maximally resist affine approximation are notoriously hard to construct for large numbers of variables. We propose a hybrid quantum-cla…
On Learning with LAD
C. A. Jothishwaran, Biplav Srivastava, Jitin Singla +1
The logical analysis of data, LAD, is a technique that yields two-class classifiers based on Boolean functions having disjunctive normal form (DNF) representation. Although LAD alg…
Lattice attack on group ring NTRU: The case of the dihedral group
Vikas Kumar, Ali Raya, Sugata Gangopadhyay +1
Group ring NTRU (GR-NTRU) provides a general structure to design different variants of NTRU-like schemes by employing different groups. Although, most of the schemes in literature…
Rayleigh quotients of Dillon's functions
Aditi Kar Gangopadhyay, Mansi, Bimal Mandal +2
The Walsh--Hadamard spectrum of a bent function uniquely determines a dual function. The dual of a bent function is also bent. A bent function that is equal to its dual is called a…
A quantum algorithm to estimate the closeness to the Strict Avalanche criterion in Boolean functions
C. A. Jothishwaran, Abhishek Chakraborty, Vishvendra Singh Poonia +2
We propose a quantum algorithm (in the form of a quantum oracle) that estimates the closeness of a given Boolean function to one that satisfies the ``strict avalanche criterion'' (…
SSIDS: Semi-Supervised Intrusion Detection System by Extending the Logical Analysis of Data
Tanmoy Kanti Das, S. Gangopadhyay, Jianying Zhou
Prevention of cyber attacks on the critical network resources has become an important issue as the traditional Intrusion Detection Systems (IDSs) are no longer effective due to the…