Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ayantika Laha

dblp:334/4634 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0001-8406-3006ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
block cipher
0.612022
On the Structure of Format Preserving Sets in the Diffusion Layer of Block Ciphers · IEEE Trans. Inf. Theory 2022
Cryptographic primitives and cryptanalysis › block cipher
diffusion layer
0.612022
On the Structure of Format Preserving Sets in the Diffusion Layer of Block Ciphers · IEEE Trans. Inf. Theory 2022
Cryptographic primitives and cryptanalysis › encryption › property-preserving encryption
format-preserving encryption
0.612022
On the Structure of Format Preserving Sets in the Diffusion Layer of Block Ciphers · IEEE Trans. Inf. Theory 2022
Coding theory › error-correcting codes › block codes
linear code
0.612022
On the Structure of Format Preserving Sets in the Diffusion Layer of Block Ciphers · IEEE Trans. Inf. Theory 2022
Coding theory
MDS matrices
0.612022
On the Structure of Format Preserving Sets in the Diffusion Layer of Block Ciphers · IEEE Trans. Inf. Theory 2022

Methods — techniques the papers use, named apart from their topics

module theory · 1.1finite ring theory · 1.1
YearPublicationVenuePosition
2022 On the Structure of Format Preserving Sets in the Diffusion Layer of Block Ciphers
abstract
In 2016, Chang et al. proposed a Format Preserving Encryption (FPE) scheme over a finite field and used an MDS matrix in the diffusion layer of the scheme for optimal diffusion. Later that year, Gupta et al. defined an algebraic structure named Format Preserving Set (FPS) is the diffusion layer of an FPE scheme. In 2018, Barua et al. showed that it is not possible to construct an FPS over a finite field in the diffusion layer of an FPE scheme if the cardinality of the set is not a power of prime. They extended the search of FPS over a finite commutative ring$\mathcal {R}$and showed that if an FPS$S \subseteq \mathcal {R}$is closed under addition then it gets module structure over some subring of$\mathcal {R}$. Moreover, in this case, the only possible cardinalities of FPS are some power of the cardinalities of subrings when the module is free. The purpose of this article is twofold. Firstly, we show that it is possible to construct format preserving sets over a finite commutative ring which are not closed under addition. Secondly, we search for format preserving sets and MDS matrices over torsion modules. We provide examples of format preserving sets of cardinalities 26 and 52 over torsion modules and rings. These cardinalities are interesting because they correspond to the set of English alphabets, without and with capitalization. By considering a finite Abelian group as a torsion module over a PID, we show that a matrix$M$with entries from the PID is MDS if and only if$M$is MDS under the projection map on the same Abelian group.
Tapas Chatterjee, Ayantika Laha, Somitra Kumar Sanadhya
IEEE Trans. Inf. Theory2