Lakshmy K. V.

Orcid: 0000-0001-5344-2855

Affiliations:
  • Amrita Vishwa Vidyapeetham, Amrita School of Engineering, Coimbatore, India


According to our database1, Lakshmy K. V. authored at least 15 papers between 2011 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Construction and enumeration of correlation immune rotation symmetric Boolean functions.
Discret. Appl. Math., 2026

2024
Generating Bent Functions and Dynamic Filters: A Novel Equivalence-Based Approach.
Symmetry, 2024

ALGAES: An Authenticated Lattice-based Generic Asymmetric Encryption Scheme.
IACR Cryptol. ePrint Arch., 2024

Construction and enumeration of balanced rotation symmetric Boolean functions.
Discret. Appl. Math., 2024

Improving the Security of the LCB Block Cipher Against Deep Learning-Based Attacks.
Cryptogr., 2024

Construction of Boolean Functions with 2k-Valued Walsh Spectrum and High Nonlinearity.
Proceedings of the Security and Privacy - 3rd International Conference, 2024

2021
Holistic Analytics of Digital Artifacts: Unique Metadata Association Model.
Int. J. Digit. Crime Forensics, 2021

On the Statistical Analysis of ZUC, Espresso and Grain v1.
Int. J. Comput., 2021

Panther: A Sponge Based Lightweight Authenticated Encryption Scheme.
Proceedings of the Progress in Cryptology - INDOCRYPT 2021, 2021

2018
HGKA: Hierarchical Dynamic Group Key Agreement Protocol for Machine Type Communication in LTE Networks.
Proceedings of the Security in Computing and Communications - 6th International Symposium, 2018

BVD - A Blockchain Based Vehicle Database System.
Proceedings of the Security in Computing and Communications - 6th International Symposium, 2018

2017
A Quasigroup Based Synchronous Stream Cipher for Lightweight Applications.
Proceedings of the Security in Computing and Communications - 5th International Symposium, 2017

2016
Affine equivalence of monomial rotation symmetric Boolean functions: A Pólya's theorem approach.
J. Math. Cryptol., 2016

2014
Counting rotation symmetric functions using Polya's theorem.
Discret. Appl. Math., 2014

2011
Complexity Measures of Cryptographically Secure Boolean Functions.
Proceedings of the Cyber Security, Cyber Crime and Cyber Forensics, 2011


  Loading...