Nasour Bagheri

PhD Candidate

Electrical Engineering Department

Iran University of Science and Technology

 

 B.D. : 1978 A.D.
B.P. : Asman Abad.
n_bagheri@iust.ac.ir, na.bagheri@gmail.com

 [ Educational background ] [ Research Interests ] [ Publications ] [ Professional Experience ] [ Teaching Experience ] [ Familiarity with Computer Environments ]  [ Other Links ] 

Educational Background

Research Interests

Publications

 

1.                  N.Bagheri, S.H.R Adeli,” Design an 8051 microcontroller series based PLC system”, 3rd National Iranian EE student conference, Iran, Tehran, 2000, (in Persian).

2.                  N.Bagheri, M.Naderi,” Web Based Education”, 1st national conference in engineering development in Education, Iran, Tehran,2002,( in Persian).

3.                    Falahati, Aboifazl; Bagheri, Nasoor; Naderi, Majid; Mohajeri, Javad “A new distinguish attack against ABC stream cipher”, The 9th international conference on Advanced Communication Technology, 2007

Abstract: ABC is a synchronous stream cipher proposed by Anashin, Bogdanov, Kizhvatov and Kumar as a candidate for ECRYPT Project (call for Stream Cipher). ABC cipher consists of three component named A, B, and C and gets a key and an IV each of 128-bit length.

 In this paper we propose a new distinguish attack to finding the internal state of component B and C of ABC algorithm in time complexity of 2108. This attack is completely retrieves internal state of those components by analyzing the  32-bits word sequences of C component output of this cipher.

4.                  N.Bagheri, M.Naderi,” Cryptanalysis of proposed scheme for security of wireless Network in 3rd ISCC ”, submitted for ISCC 2007.

Abstract: In this paper, basic instructions for preparation of a paper for 12th international conference of CSI are presented. This document contains information about all formats, fonts, the styles and sizes. All required 'Styles' such as titles, subtitles, abstract, body and etc. are predefined, and so there is no need to define a new one. Just select the appropriate style with respect to different sections of a paper. Please note that the CSICC’07 committee has the right to reject any paper not according the predefined styles without further inspections.

The abstract part is limited to 200 words in one or two paragraphs. It should concisely state what was done, how it was done, why, and what is the primary result and its significance. The abstract cannot contain details, figures, tables, equations, or references.

5.                  N.Bagheri, M.Naderi,” New enhancement to MDx Hash Function class by linear error correction codes”, submitted for ISCC 2007.

6.                  N.Bagheri, M.Naderi, M.Safkhani “Cryptanlysis of AHS-AES Hash Structure” submitted for ISCC 2007.

7.                    N.Bagheri, J.Mohajeri, M.Salmasizadeh,” Differential cryptanalysis of AMIN-1 block cipher”, submitted for ISCC 2007.

8.                  N.Bagheri, M.Naderi, B.Sadeghiyan “Multi-collisions in Zipper Hash Structure”    H.CSSL.07.01, Technical Report, CSSRC, Iran University of Science and Technology, 2007.

Abstract: In this paper, we show the existence of multicollisions in Zipper Hash structure, new hash structure which was introduced for strength the current hash structures against multicollision attack proposed by Joux.

Our study show that finding multicollisions, i.e. 2k-way collision is not much harder than finding such a multicollisions in ordinary MD structure. In fact, the complexity of the attacks is approximately n/2 times harder than what has been found for MD structures. Then we use these large multicollisions as a tool to find D-way preimage for this structure. The complexity of finding 2K-way multicollision and 2k-way preimage are  and respectively. Similar to what has been proved by Joux for MD we show that this structure could not being used to create a hash function with 2n-bite length by concatenating this structure with any other hash structure by hash’s output length of n-bite. We show that the time complexity of finding a collision for this concatenated structure is   that much smaller than what expected from generic-birthday attack which should be.

9.              N.Bagheri, M.Naderi, B.Sadeghiyan “Multi-collisions in Ring Hash Structure” H.CSSL.07.02, Technical Report, CSSRC, Iran University of Science and Technology, 2007.

Abstract:In this paper, we show the existence of multi-collisions in Ring Hash structure, new hash structure which was introduced for strength the current hash structures against multi-collision attack proposed by Joux.

Our study show that finding multi-collisions, i.e. 2k-way collision is not much harder than finding such a multi-collisions in ordinary MD structure. In fact, the complexity of the attacks is approximately  times harder than what has been found for MD structures. Then we use these large multi-collisions as a tool to find D-way preimage for this structure. The complexity of finding 2K-way multi-collision and 2k-way preimage are  and respectively. Similar to what has been proved by Joux for MD we show that this structure could not being used to create a hash function with 2n-bite length by concatenating this structure with any other hash structure by hash’s output length of n-bite. We show that the time complexity of finding a collision for this concatenated structure is   that much smaller than what expected from generic-birthday attack which should be.

10.              N.Bagheri, M.Naderi, B.Sadeghiyan “Cryptanlysis of L-Pipe Hash Structure” H.CSSL.07.03, Technical Report, CSSRC, Iran University of Science and Technology, 2007.

Abstract: In this paper we cryptanalysis l-pipe hash function. L-pipe construction is the one method for creating a larger digest from smaller compression functions. We will show that the number of operations for finding preimage and collision is less than expected operations. We prove that the complexity of finding preimage is O(2) for all l. The complexity of finding collision  is O(2.

11.              N.Bagheri, M.Naderi, B.Sadeghiyan “Cryptanlysis of CRUSH Hash Structure” H.CSSL.07.04, Technical Report, CSSRC, Iran University of Science and Technology, 2007.

Abstract:In this paper, we’ll present the first attacks on CRUSH hash structure. Surprisingly, our attack could find preimage for any desired length of internal message. Time complexity of this attack is completely neglectable.  It will be prove that the time complexity of finding preimage for any length is . In this attack adversary could freely find certain preimage in her own choice length for any given message digits. Also, our attack can find preimage, collision, multicolision in the same complexity.

In this paper we will introduce stronger variant of algorithm, rater than what originally presented by CRUSH outers, we show that in this situation adversary could produce collision in time complexity less than what was expected from Birthday paradox. We’ll introduce sufficient condition for immunizing this structure in this paper.

12.              N.Bagheri, M.Naderi,A.Falahaty” A New block Cipher based on MDS codes and APN function”, BC.CSSL.06.01, Technical Report, CSSRC, Iran University of Science and Technology, 2006.

Abstract: in this paper a new block cipher named FBC will present. FBC is a 128-bit block cipher that accepts a 128-bit key. The cipher is based on using APN power function to create substitution box and use the good characteristic of MDS code to improvement the diffusion property of cipher due to shanon criteria. The cipher has semifistel structure whose inverse only differs from the forward operation in the key schedule. There are no hidden weaknesses inserted by the designers. The overall cipher designing follows the brief strategy, cipher criteria, and has a good efficiency for both software and hard ware implementation. According to cipher structure, we expect good resistance to all known attacks same as linear attack, differential attack, and algebraic attack and so on.

13.                N.Bagheri, J.Mohajeri, ” ECRYPT stream cipher primitives analysis and classification”, Technical Report, ERC, Sharif University of Technology, 2005.

14.              N.Bagheri,” Design and implementation of new block cipher”, Iran University of Science and Technology, MSc. thesis, 2002, (in Persian).

Abstract: The emergence of the Internet as a trusted technology or medium for communication and commerce has made cryptography an essential component of modern information systems. Cryptography provides the necessary mechanism to implement accountability, accuracy, and confidentiality in communication. As demands for secure communication bandwidth grow, efficient cryptographic processing will become increasingly vital to good system performance.

For achieve such a need, in this thesis, a SP-network symmetric cipher algorithm was designed and implemented. This algorithm has 16 rounds and after 5th round, each cipher text bits is depended on all plain text bits. This algorithm accepts a 128-bit blocks as input and converts it to 128-bit blocks as cipher blocks. The acceptable length of key streams is different from 0 to 256 bit; but the progress of cipher system was based on 256 bit key streams. Short keys with less than 256 bits are mapped to full-length keys of 256 bits by appending pseudo random stream to the MSB end to make up 256 bit. This algorithm is using an  array as a s-box that accept an 8-bit data as input and generate 4-bit data as output.

In this algorithm designing, some novel technique has been used that provide a strong and fast cipher algorithm that may implement efficiently in hardware and software implementation.  Because of simple and fast instruction has been used in this algorithm designing, efficient implementation of this cipher algorithm on the variety of platform with different words length is possible. The very short key expansion time made it suitable for the purpose that need very rapidly key changing. Cipher stability analysis against known attacks improves the cipher security and reliability.

15.              N.Bagheri,” Web Based Education”, Iran University of Science and Technology, MSc. Seminar, 2002, (in Persian).

16.              N.Bagheri, S.H.R Adeli,” Design a microcontroller based PLC system”, Mazandaran University, BS. Thesis, 2000, (in Persian).

Professional Experience

Teaching Experience

Familiarity with Computer Environments

Last Modified: Aug 30, 2007

Valid HTML 4.0 Transitional