Author

Sanjesh Sadanand Pawale

Department of Computer Engineering, Vishwakarma University, Pune, Maharashtra, 411048, India

Published papers: 2
Citations: 0
Views: 12
Downloads: 7

Publications

2 papers

Open Access Research Article·pp. 4225–4236·Vol. 29, Issue 10-BOct 2026

Boolean function analysis for enhancing nonlinearity and resistance against linear and differential cryptanalysis

Aitha Srividya, Samaksh Goyal, Yazdani Hasan, Sanjesh Sadanand Pawale, Shakhboz Meylikulov, Chetansinh R. Vaghela, Umidjon Musaev

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3046

In this paper: The analysis of Boolean functions is a core part of the design of secure cryptographic primitives, especially to make them more resistant to linear and differential cryptanalysis. This work explores f...

Abstract References Full Text PDF (600 KB)Views: 7Downloads: 4Citations: 0

Open Access Research Article·pp. 4249–4259·Vol. 29, Issue 10-BOct 2026

Algebraic graph theory in secure communication design

Tanveer Ahmad Wani, Nitinkumar M. Patel, Kotte Navya, Samir N. Ajani, Prakhar Goyal, Sanjesh Sadanand Pawale

Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3048

In this paper: The algebraic graph theory has a framework to study and construct secure communication systems based on a combination of structural graph properties, spectral graph properties and cryptographic concep...

Abstract References Full Text PDF (671 KB)Views: 5Downloads: 3Citations: 0