• Publications
  • Influence
New Public-Key Cryptosystem Using Braid Groups
TLDR
The braid groups are infinite non-commutative groups naturally arising from geometric braids. Expand
  • 394
  • 39
  • PDF
An efficient key distribution scheme with self-healing property
TLDR
In this paper, we propose a new self-healing key distribution scheme, which is optimal in terms of user memory storage and more efficient in terms the communication complexity than the previous results. Expand
  • 71
  • 21
Related Key Differential Attacks on 27 Rounds of XTEA and Full-Round GOST
TLDR
In this paper, we present a related key truncated differential attack on 27 rounds of XTEA. Expand
  • 100
  • 5
  • PDF
Practical and Provable Security against Differential and Linear Cryptanalysis for Substitution‐Permutation Networks
We examine the diffusion layers of some block ciphers referred to as substitution-permutation networks. We investigate the practical and provable security of these diffusion layers againstExpand
  • 52
  • 3
  • PDF
Pseudorandomness of MISTY-Type Transformations and the Block Cipher KASUMI
TLDR
We examine the security of block ciphers on the view point of pseudorandomness. Expand
  • 20
  • 3
A Concrete Security Analysis for 3GPP-MAC
TLDR
We prove that f9 is a secure pseudorandom function by giving a concrete bound on an adversary’s inability to forge a MAC value in terms of her inability to distinguish the underlying block cipher from a random permutation. Expand
  • 11
  • 2
  • PDF
Provable Security of KASUMI and 3GPP Encryption Mode f8
TLDR
We investigate the pseudorandomness of the block cipher KASUMI and the provable security of f8 based on the adaptive distinguisher model by investigating the properties of round functions in a clear way. Expand
  • 32
  • 1
  • PDF
Dynamic ransomware protection using deterministic random bit generator
TLDR
We propose a dynamic ransomware protection method that replaces the random number generator of the OS with a user-defined generator. Expand
  • 9
  • 1
A Practical Privacy-Preserving Cooperative Computation Protocol without Oblivious Transfer for Linear Systems of Equations
TLDR
We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. Expand
  • 7
  • 1
  • PDF
An extension of TYT algorithm for GF((2n)m) using precomputation
TLDR
In this letter, we present a fast inversion algorithm in GF((2^n)^m) which improves the previous algorithms for multiplicative inversion in GF(2^m). Expand
  • 6
  • 1