J
Jovan Dj. Golic
Researcher at Queensland University of Technology
Publications - 41
Citations - 1256
Jovan Dj. Golic is an academic researcher from Queensland University of Technology. The author has contributed to research in topics: Stream cipher & Correlation attack. The author has an hindex of 17, co-authored 41 publications receiving 1224 citations. Previous affiliations of Jovan Dj. Golic include Telecom Italia & University of Belgrade.
Papers
More filters
Book ChapterDOI
Multiplicative Masking and Power Analysis of AES
Jovan Dj. Golic,Christophe Tymen +1 more
TL;DR: It is shown that the multiplicative masking method can be modified so as to provide resistance to differential power analysis of nonideal but controllable security level, at the expense of increased computational complexity.
Book ChapterDOI
On the Security of Nonlinear Filter Generators
Jovan Dj. Golic,Jovan Dj. Golic +1 more
TL;DR: By regarding a nonlinear filter keystream generator as a finite input memory combiner, it is observed that a recent, important attack introduced by Anderson can be viewed as a conditional correlation attack.
Book ChapterDOI
The LILI-II Keystream Generator
Andrew Clark,Ed Dawson,Joanne Fuller,Jovan Dj. Golic,Hoon-Jae Lee,William Millan,S.-J. Moon,Leone Simpson +7 more
TL;DR: The LILI-II keystream generator is a LFSR based synchronous stream cipher with a 128 bit key that offers large period and linear complexity, is immune to currently known styles of attack, and is simple to implement in hardware or software.
Journal Article
Linear cryptanalysis of Bluetooth stream cipher
TL;DR: A large class of linear correlations in the Bluetooth combiner, unconditioned or conditioned on the output or on both the output and one input, are found and an attack on the Bluetooth stream cipher that can reconstruct the 128-bit secret key with complexity about 270 from about 45 initializations is proposed.
Book ChapterDOI
Embedding and probabilistic correlation attacks on clock-controlled shift registers
TL;DR: It is proved that the constrained embedding attack is successful for any d and the minimum necessary length of the known output sequence is shown to be linear in r, and at least exponential and at most superexponential in d.