Bassem Ammar

Interoperability of all actors involved in crisis and disaster management is an imperative pre-requirement for minimizing damage and losses in case of incidents. In order to enhance the opportunities of improved information exchange between involved stakeholders, the EU Commission funded the FP7 project EPISECC. The main objective of EPISECC is to...

Funded under the European Union's Horizon 2020 research and innovation programme, SAFEcrypto will provide a new generation of practical, robust and physically secure post-quantum cryptographic solutions that ensure long-term security for future ICT systems, services and applications. The project will focus on the remarkably versatile field of Latti...

Efficient communication and access to critical information is a key requirement for the operations of public safety and security services in disasters.

This paper deals with a communication infrastructure needed to allow a swarm of robots performing dust cleaning and garbage collection task in an urban area. It outlines the required communication links, analyses them regarding security, describes in details the implementation and figure out some performance test results.

Two classes of well-structured binary low-density parity check codes (LDPC) are described. The first class is based on a branch of combinatorial mathematics, known as the balanced incomplete block design (BIBD). Construction of three types of codes derived from BIBD designs is illustrated in addition to a family of LDPC codes constructed by decompo...

Not Available

This correspondence presents a method for constructing structured regular low-density parity-check (LDPC) codes based on a special type of combinatoric designs, known as balance incomplete block designs. Codes constructed by this method have girths at least 6 and they perform well with iterative decoding. Furthermore, several classes of these codes...

We present a new family of so-called reducible rank codes which are a generalization of rank product codes . This family includes maximal rank distance (MRD) codes for lengths n>N in the field F_N. We give methods for encoding and decoding reducible rank codes. A public key cryptosystem based on these codes and on the idea of a column scr...

We present a new family of so called reducible rank codes. For lengths n that are multiples of N the family contains optimal codes over F_N. A public key cryptosystem using these codes is proposed. To make the system resistant to structural attacks, row and column scramblers are used, as well as a special form of distortion matrix. A prel...

This paper presents a method for constructing low density parity check (LDPC) codes based on a special type of combinatoric designs, known as the balanced incomplete block designs (BIBDs). Several classes of BIBDs suitable for constructing LDPC codes are presented. Codes constructed based on these classes of BIBDs perform well with iterative decodi...