how to cite this article: akhondian j, ashrafzadeh f, beiraghi toosi m, hashemi n. a rare presentation of neurobrucellosis in a child with recurrent transient ischemic attacks and pseudotumor cerebri (a case report and review of literature). iran j child neurol. 2014 spring; 8(2):65-69.   brucellosis is a multi-system infectious disease that presents with various manifestations and complication...

In this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by Jannati and Falahati (so-called JF). We prove that an adversary can recover key bits of JF protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. In addition, we propose an improved protocol and prove that the improved protocol is resistant to mafia frau...

in this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by jannati and falahati (so-called jf). we prove that an adversary can recover key bits of jf protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. in addition, we propose an improved protocol and prove that the improved protocol is resistant to mafia frau...

Various attacks against RC5 have been analyzed intensively([1], [2], [4]–[7]). A known plaintext attack([2]) has not been reported that it works on so higher round as a chosen plaintext attack([1]), but it can work more efficiently and practically. In this paper we investigate a known plaintext attack against RC5 by improving a correlation attack ([7]). As for a known plaintext attack against R...

CTC is a toy cipher designed by Courtois in order to prove the strength of algebraic attacks. In this paper we study the differential and the linear behavior of the 85 S-boxes version, which is attacked using algebraic techniques faster than exhaustive key search. We show that an n-round variant of the cipher can be attacked by a linear attack using only 2 known plaintexts, with a negligible ti...

The shrinking generator is a well-known key stream generator composed of two LFSR’s, LFSRx and LFSRc, where LFSRx is clock-controlled according to the regularly clocked LFSRc. In this paper we investigate the minimum required length of the output sequence for successful reconstruction of the LFSRx initial state in an optimal probabilistic divide and conquer correlation attack. We extract an exa...

The history of integral cryptanalysis is a little complicated, and the most important papers to study regarding it are not in fact the ones in which it was first defined. We give a brief recap here: In 1997, Daemen, Knudsen, and Rijmen published a paper [3] describing a new cipher. This cipher, SQUARE, was a forerunner of Rijndael [10], the eventual AES, and was designed using the same wide tra...

The resilience of cyberphysical systems (CPS) to denial of service (DoS) and integrity attacks is studied. The CPS is modeled as a linear structured system, and its resilience to various attack scenarios is interpreted in a graph theoretical framework. The structural resilience of the CPS to DoS and integrity attacks is characterized in terms of unmatched vertices in maximum matchings of the bi...