All Outputs (4)

Improving search space analysis of fuzzing mutators using cryptographic structures (2023)
Conference Proceeding
Chafjiri, S. B., Legg, P., Tsompanas, M., & Hong, J. (in press). Improving search space analysis of fuzzing mutators using cryptographic structures. In Lecture Notes in Network Security

This paper introduces a novel approach to enhance the performance of software fuzzing mutator tools, by leveraging cryptographic structures known as substitution-permutation networks and Feistel networks. By integrating these structures into the exis... Read More about Improving search space analysis of fuzzing mutators using cryptographic structures.

Stop at the red-light is no longer boring (2022)
Presentation / Conference
Bamohabbat Chafjiri, S. (2022, June). Stop at the red-light is no longer boring

The poster is about charging stations for electric vehicles installed at intersections. It is specifically designed for cities where there is sufficient rainfall as well as a solar resource throughout the year. The solution focuses on generating elec... Read More about Stop at the red-light is no longer boring.

Related-key impossible differential cryptanalysis of full-round HIGHT (2013)
Conference Proceeding
Rostami, S., Bamohabbat Chafjiri, S., & Tabatabaei, S. A. H. (2015). Related-key impossible differential cryptanalysis of full-round HIGHT. In 2013 International Conference on Security and Cryptography (SECRYPT) (1-6)

The HIGHT algorithm is a 64-bit block cipher with 128-bit key length, at CHES'06 as a lightweight cryptographic algorithm. In this paper, a new related-key impossible differential attack on the full-round algorithm is introduced. Our cryptanalysis re... Read More about Related-key impossible differential cryptanalysis of full-round HIGHT.

Rate secrecy of networks with game theory approach (2011)
Conference Proceeding
Bamohabbat Chafjiri, S., Tebbi, M. A., & Karimian, Y. (2011). Rate secrecy of networks with game theory approach. In G. Lee (Ed.), Proceedings of the 2011 International Conference on Mechanical Engineering and Technology (ICMET 2011) (833-837). https://doi.org/10.1115/1.859896.paper172

In this paper, we introduce a three-way discrete memoryless Broadcast channel (T-DMBC) between a transmitter (Alice), a receiver (Bob), and an intruder (Eve). We represent a protocol for secret key establishment (SKE) between Alice and Bob so that Ev... Read More about Rate secrecy of networks with game theory approach.