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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Suman Sekhar Jana

dblp:241/4297 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

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

Systems, architecture and hardware · 2

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
Hardware security and side channels · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Hardware security and side channels › hardware obfuscation
finite state machine obfuscation		 0.412019
A Cellular Automata Guided Obfuscation Strategy For Finite-State-Machine Synthesis · DAC 2019
Electronic design automation › logic synthesis
finite state machine synthesis		 0.412019
A Cellular Automata Guided Obfuscation Strategy For Finite-State-Machine Synthesis · DAC 2019

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

cellular automata · 0.8D1*CA · 0.8
YearPublicationVenuePosition
2020 A cellular automata guided two level obfuscation of Finite-State-Machine for IP protection
Rajit Karmakar, Suman Sekhar Jana, Santanu Chattopadhyay
 Integr.2
2019 A Cellular Automata Guided Obfuscation Strategy For Finite-State-Machine Synthesis
abstract
A popular countermeasure against IP piracy relies on obfuscating the Finite State Machine (FSM), which is assumed to be the heart of a digital system. In this paper, we propose to use a special class of non-group additive cellular automata (CA) called D1 * CA, and it's counterpart D1 * CAdual to obfuscate each state-transition of an FSM. The synthesized FSM exhibits correct state-transitions only for a correct key, which is a designer's secret. The proposed easily testable key-controlled FSM synthesis scheme can thwart reverse engineering attacks, thus offers IP protection.
Rajit Karmakar, Suman Sekhar Jana, Santanu Chattopadhyay
 DAC2