Santanu Sarkar

Publications114
h-index19
Citations1,008
Highly Influential Citations67
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • S. Maitra
  • 281 Publications • 5,266 Citations
  • W. Meier
  • 160 Publications • 7,256 Citations
  • Subhadeep Banik
  • 82 Publications • 1,362 Citations
  • Alexander May
  • 74 Publications • 2,679 Citations
  • Publications
  • Influence
Dependence in IV-Related Bytes of RC4 Key Enhances Vulnerabilities in WPA
TLDR
A disciplined study of RC4 biases resulting specifically in such a scenario, and proves the interesting sawtooth distribution of the first byte in WPA and the similar nature for the biases in the initial keystream bytes towards zero.
View via Publisher
(Non-)Random Sequences from (Non-)Random Permutations—Analysis of RC4 Stream Cipher
TLDR
The effect of RC4 keylength on its keystream is investigated, and significant biases involving the length of the secret key are reported, and the existence of positive biases towards zero for all the initial bytes 3 to 255 is proved and exploited towards a generalized broadcast attack on RC4.
View on Springer
A Differential Fault Attack on the Grain Family of Stream Ciphers
TLDR
It is shown that the differential fault attack can indeed be efficiently mounted for the Boolean function used in Grain v1 and the exact design criteria for Boolean functions to be used in grain like structure is provided.
View via Publisher
Some Combinatorial Results towards State Recovery Attack on RC4
TLDR
This paper performs a combinatorial analysis of the complexity of RC4 state recovery under the assumption that the values of j are known for several rounds, and reveals a nice combinatorsial structure of the RC4 evolution and establishes certain interesting results related to the complex of state recovery.
View via Publisher
Approximate Integer Common Divisor Problem Relates to Implicit Factorization
TLDR
This paper analyzes how to calculate the GCD of k ( ≥ 2) many large integers, given their approximations, and relates the approximate common divisor problem to the implicit factorization problem as well.
View on IEEE
Revisiting Wiener's Attack - New Weak Keys in RSA
TLDR
Wiener's method (IEEE-IT, 1990) of continued fraction (CF) is revisited to find new weaknesses in RSA and it is shown that, the RSA keys are weak when d and eis O(N^{\frac{3}{2}-2\delta})$ for $\delta \leq \frac{1}{2}.
View via Publisher
Differential Fault Attack against Grain Family with Very Few Faults and Minimal Assumptions
TLDR
This paper presents a significantly improved scenario from the adversarial point of view for DFA against the Grain family of stream ciphers, and considers that the cipher has to be re-keyed only a few times and faults can be injected at any random location and at anyrandom point of time.
View on IEEE
Small secret exponent attack on RSA variant with modulus $$N=p^rq$$N=prq
  • Santanu Sarkar
  • Mathematics, Computer Science
    Des. Codes Cryptogr.
  • 1 November 2014
TLDR
This paper improves the bound when $$r \le 5$$r≤5, and provides detailed experimental results to justify the claim.
View on Springer
A Differential Fault Attack on the Grain Family under Reasonable Assumptions
TLDR
A differential fault attack against ciphers having the same physical structure as in the Grain family is studied and the situation in which more than one consecutive locations of the LFSR are flipped as result of a single fault injection is considered.
View via Publisher
Key Recovery from State Information of Sprout: Application to Cryptanalysis and Fault Attack
TLDR
The designers claim that the secret key of Sprout can not be recovered efficiently from the complete state information using a guess and determine attack, but it is shown that it is possible with a few hundred bits in practical time.
View Paper
...
...