Sumanta Sarkar

According to our database1, Sumanta Sarkar authored at least 47 papers between 2006 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An efficient post-quantum secure dynamic EPID signature scheme using lattices.
Multim. Tools Appl., February, 2024

2023
Low Trace-Count Template Attacks on 32-bit Implementations of ASCON AEAD.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2023

2022
On the Lower Bound of Cost of MDS Matrices.
IACR Trans. Symmetric Cryptol., 2022

Sycon: a new milestone in designing ASCON-like permutations.
J. Cryptogr. Eng., 2022

PROV-FL: Privacy-preserving Round Optimal Verifiable Federated Learning.
Proceedings of the 15th ACM Workshop on Artificial Intelligence and Security, 2022

2021
Misuse-Free Key-Recovery and Distinguishing Attacks on 7-Round Ascon.
IACR Cryptol. ePrint Arch., 2021

DEFAULT: Cipher Level Resistance Against Differential Fault Attack.
IACR Cryptol. ePrint Arch., 2021

2020
A Coding Theoretic Approach towards Symmetrization in Reversible Circuit Synthesis.
J. Multiple Valued Log. Soft Comput., 2020

To infect or not to infect: a critical analysis of infective countermeasures in fault attacks.
J. Cryptogr. Eng., 2020

On the Design of Bit Permutation Based Ciphers - The Interplay Among S-box, Bit Permutation and Key-addition.
IACR Cryptol. ePrint Arch., 2020

PHyCT : Privacy preserving Hybrid Contact Tracing.
IACR Cryptol. ePrint Arch., 2020

2019
On the Relationship between Resilient Boolean Functions and Linear Branch Number of S-boxes.
IACR Cryptol. ePrint Arch., 2019

LIGHTER-R: Optimized Reversible Circuit Implementation For SBoxes.
Proceedings of the 32nd IEEE International System-on-Chip Conference, 2019

2018
MaRSChain: Framework for a Fair Manuscript Review System Based on Permissioned Blockchain.
Proceedings of the Euro-Par 2018: Parallel Processing Workshops, 2018

Bounds on Differential and Linear Branch Number of Permutations.
Proceedings of the Information Security and Privacy - 23rd Australasian Conference, 2018

2017
Lightweight Design Choices for LED-like Block Ciphers.
IACR Cryptol. ePrint Arch., 2017

Bounds on the Differential Branch Number of Permutations.
IACR Cryptol. ePrint Arch., 2017

Analysis of Toeplitz MDS Matrices.
IACR Cryptol. ePrint Arch., 2017

Redefining the transparency order.
Des. Codes Cryptogr., 2017

On some permutation binomials and trinomials over $$\mathbb {F}_{2^n}$$ F 2 n.
Des. Codes Cryptogr., 2017

2016
Involutions Over the Galois Field 𝔽<sub><sup>n</sup></sub>.
IEEE Trans. Inf. Theory, 2016

Lightweight Diffusion Layer: Importance of Toeplitz Matrices.
IACR Cryptol. ePrint Arch., 2016

A deeper understanding of the XOR count distribution in the context of lightweight cryptography.
IACR Cryptol. ePrint Arch., 2016

2015
Dickson Polynomials that are Involutions.
IACR Cryptol. ePrint Arch., 2015

Initial results on the rotation symmetric bent-negabent functions.
Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015

On involutions of finite fields.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Redefining the Transparency Order.
IACR Cryptol. ePrint Arch., 2014

Some Results on Bent-Negabent Boolean Functions over Finite Fields.
CoRR, 2014

Differential Power Analysis in Hamming Weight Model: How to Choose among (Extended) Affine Equivalent S-boxes.
Proceedings of the Progress in Cryptology - INDOCRYPT 2014, 2014

2013
RAFR: remote assessment of file redundancy.
Proceedings of the 2013 International Workshop on Security in Cloud Computing, 2013

2012
On Some Permutation Binomials of the Form $x^{\frac{2^n-1}{k}+1} +ax$ over $\mathbb{F}_{2^n}$ : Existence and Count.
Proceedings of the Arithmetic of Finite Fields - 4th International Workshop, 2012

Characterizing Negabent Boolean Functions over Finite Fields.
Proceedings of the Sequences and Their Applications - SETA 2012, 2012

Proofs of Retrievability via Fountain Code.
Proceedings of the Foundations and Practice of Security - 5th International Symposium, 2012

2011
Polynomials With Linear Structure and Maiorana-McFarland Construction.
IEEE Trans. Inf. Theory, 2011

On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1}.
Proceedings of the Cryptography and Coding - 13th IMA International Conference, 2011

2010
On the lower bounds of the second order nonlinearities of some Boolean functions.
Inf. Sci., 2010

2009
On the Lower Bounds of the Second Order Nonlinearity of some Boolean Functions.
IACR Cryptol. ePrint Arch., 2009

Results on rotation symmetric bent functions.
Discret. Math., 2009

Construction of Rotation Symmetric Boolean Functions with optimal Algebraic Immunity.
Computación y Sistemas, 2009

On affine (non)equivalence of Boolean functions.
Computing, 2009

On the Symmetric Negabent Boolean Functions.
Proceedings of the Progress in Cryptology, 2009

2008
RSA Cryptanalysis with Increased Bounds on the Secret Exponent using Less Lattice Dimension.
IACR Cryptol. ePrint Arch., 2008

Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros.
Des. Codes Cryptogr., 2008

2007
Construction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity on Odd Number of Variables.
IACR Cryptol. ePrint Arch., 2007

Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity.
Proceedings of the Applied Algebra, 2007

2006
Enumeration of 9-variable Rotation Symmetric Boolean Functions having Nonlinearity > 240.
IACR Cryptol. ePrint Arch., 2006

Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity.
Des. Codes Cryptogr., 2006


  Loading...