• Diese Seite als PDF öffnen.

Index Coding & Coded Caching

Description

Coded caching problem has two phases, placement phase and delivery phase.

For a fixed placement scheme, designing the delivery protocol is equivalent to the index coding problem.

Transforming a coded caching problem with coded placement to the corresponding index coding problem is a hignly-interested topic and what is the optimal delivery scheme for a coded caching problem with coded placement is still an open problem.

References: 

[1] N. S. Karat, S. Samuel, and B. S. Rajan. Optimal error correcting index codes for some generalized index coding problems. IEEE Transactions on Communications, 67(2):929–942, 2019.

[2] Z. Chen, P. Fan, and K. B. Letaief. Fundamental limits of caching: improved bounds for users with small buffers. IET Communications, 10(17):2315–2318, 2016.

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Authentification based on DRAM PUFs

Keywords:
Cryptography, DRAM, PUFs

Description

Physically Unclonable Functions (PUFs) are proved to be an effective and low-cost measure against counterfeiting by probiding device authentication and secure key storage services. PUFs based on Dynamic Random Access Memory (DRAM) are particularly advantageous due to their large address space and multiple controllable parameters during respnse generations [1]. 

The security of an authentification protocol based on PUF devices comes from the intrisinc uniqueness of PUF devices. 

Several works (e.g. [2,3]) have been done in characterising DRAM PUFs and designing the authentification protocol for decay-based DRAM PUFs.

This task is to do further literature research on the characterization and cryptographic applications of DRAM PUFs.

References:

[1] Sutar, S., Raha, A., Kulkarni, D., Shorey, R., Tew, J., and Raghunathan, V. (2017). D-PUF: An intrinsically reconfigurable DRAM PUF for device authentication and random number generation. ACM Transactions on Embedded Computing Systems (TECS), 17(1), 1-31.

[2] Xiong, W., Schaller, A., Anagnostopoulos, N. A., Saleem, M. U., Gabmeyer, S., Katzenbeisser, S., and Szefer, J. (2016, August). Run-time accessible DRAM PUFs in commodity devices. In International Conference on Cryptographic Hardware and Embedded Systems (pp. 432-453). Springer, Berlin, Heidelberg.

[3] Schaller, A., Xiong, W., Anagnostopoulos, N. A., Saleem, M. U., Gabmeyer, S., Škori?, B., Katzenbeisser, S. and Szefer, J. (2018). Decay-based DRAM PUFs in commodity devices. IEEE Transactions on Dependable and Secure Computing, 16(3), 462-475.

Prerequisites

Contact

Supervisor:

• Diese Seite als PDF öffnen.

List decoding of Interleaved Goppa Codes

Keywords:
decoding; implementation

Description

Goal: implement a list decoding algorithm for binary interleaved Goppa codes and derive the decoding radius.

Fundalmentals on Goppa codes can be found in [2, Chap 12.3], [3, Chap 2].

Fundalmentals on list decoding can be found in [4, Chap 12], [5, Chap 9].

References:

[1] D. Augot, M. Barbier, and A. Couvreur, “List-decoding of binary goppa codes up to the binary johnson bound,” in 2011 IEEE Information Theory Workshop, pp. 229–233, Oct 2011.

[2] F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes. 1978.

[3] H. Liu, “Decoding of interleaved goppa codes and their applications in code-based cryptosystem,” Master’s thesis, Technical University of Munich, Dec. 2018.

[4] J. Justesen and T. Høholdt, A course in error-correcting codes. Z¨urich: European Mathematical Society (EMS), 2004.

[5] R. M. Roth, Introduction to Coding Theory. Cambridge University Press, 2006.

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Random Fraction Placement in Coded Caching

Keywords:
Coded caching; Index Coding

Description

In some communication systems end users are equiped with storages, the communication load during the peak hours can be reduced by having users pre-fetch part of the content during the scilent hours. Coded caching is a study to design the pre-fetching without the knowledge of users demands and the delivery scheme based on the users caches. However, many current schemes are facing the subpacketization problem in order to achieve the optimal load.

Prerequisites

Supervisor:

• Diese Seite als PDF öffnen.

Coded Placement in Coded Caching

Keywords:
Coded caching

Description

Coded caching is a study to reduce the transmission delay in broad-/multi-cast by designing the cached data and the transmitting data with coding strategies. There are two phases in coded cahing schemes, placement phase and delivery phase. Coding scheme can be applied in both phase in order to gain in reducing the transmission delay.

Prerequisites

Contact

Supervisor: