Martin Bossert's research while affiliated with Ulm University and other places

... In this paper, we will discuss only code-based cryptography. It includes all the cryptosystems in which security depends upon the hardness of encoding and decoding of the error-correcting codes like Goppa codes [8], Bose-Chaudhuri-Hocquenghem (BCH) codes [9], and Reed-Solomon codes [10]. In 1978, McEliece introduced the first code-based public-key cryptosystem [11]. ...

... This paper focuses on computing at cryogenic temperatures, for example, required to implement quantum computers. For this reason, the retention of DRAM memory modules was examined on temperatures from 358 K, 77 K and 263 K. Müelich et al. [20] present a theoretical model which captures the instabilities of PUF responses. DRAM retention PUFs are evaluated on temperatures from 25°C to 90°C. ...

... This gap can be closed in Step 3 with BMD(C 01 ), which is able to nd the correct solution since d 01 ≥ δ (r) 1,R = d f,R . The complexity is determined by the complexity of the BMD rank block error-erasure decoders from Table 6.1 (realized e.g., as in [SKK08,GPB10] and Subsection 3. ...

... In this sense, we can suppose that we are facing a microscopic communication system that to transfer information. Therefore in the procedure of translating genome sequence, it can be infered that genome sequence is the source of information transmission during genome sequence biological translation [5,6] and based on this fact, we suggest a source coding method for converting the gene sequence to a decimal sequence. After providing a digital signal for any given gene of genome sequence, since frequently have been observed that genome sequence demonstrate cyclic pattern [7], a powerful tools named HP filter will be applied to this decimal sequence to decompose it to trend component and Cyclic component. ...

... There are various error correction codes of PUFs that focus on optimizing the code in terms of implementation overhead, decoding complexity and hardware resources [BGS + 08, MVHV12, HKS20, MHK + 19, PMB + 15] applying Bose Chaudhuri Hocquenghem (BCH), Reed Solomon or Reed Muller Codes. Another way of reducing the implementation overhead is by including soft and reliability information [MTV09a,MTV09b,MPB18,HOSB16]. Apart from implementation efficiency, secrecy leakage is a known issue for PUFs. ...

... As this work focuses on the helper data generation and ECC parts, all bit mapping aspects are subsumed under the PUF and the output is interpreted as PUF response in the following. Incorporating the helper data into a specific ECC for each PUF, as it was shown in [55] for LDPC codes, would further increase the efficiency but is not possible for many use cases. ...

... In this model, corrupted symbols are usually seen as row errors and column errors and since those errors are generally bursty, codes designed for the hamming metric are not generally suitable in these situations. Note that those codes have also been used in the design of cryptosystems [17] and space-time codes [18], [19]. ...

... In (Roth, 1996;Augot et al., 2018), constructions of Gabidulin codes over arbitrary Galois field extensions were given. Decoding of Gabidulin codes over Galois extensions was studied by Robert (2016), Müelich et al. (2016), and Augot et al. (2018). For exact computation domains (such as number fields), it is still an open problem to properly analyze the intermediate coefficient growth in these decoding algorithms, e.g., analog to (Sippel et al., 2019) for Reed-Solomon codes. ...

... Streaming applications require low latency decoding of the received data blocks and it has been shown that, under such constraints, convolutional codes perform well [18], [19] for different erasure channels. When considering errors, convolutional codes are sensitive to burst errors but good at handling well-distributed errors [20]. ...

... A variety of methods [3], [5]- [7], [23], [32], [35], [36] exist for obtaining space-time codes from codes over finite fields. We set aside those focused on binary fields because linearized Reed-Solomon codes are only interesting when nonbinary due to the q > L requirement. ...