| 1. |
- Ekdahl, Patrik, et al.
(författare)
-
Another attack on A5/1
- 2001
-
Ingår i: [Host publication title missing]. - 0780371232 ; , s. 160-160
-
Konferensbidrag (refereegranskat)abstract
- A5/1 is a stream cipher used in the GSM system. Several time-memory trade-off attacks against A5/1 have been proposed previously. This paper presents a completely different attack, based on ideas from correlation attacks.
|
|
| 2. |
|
|
| 3. |
- Handlery, Marc, et al.
(författare)
-
Some distance properties of tailbiting codes
- 2001
-
Ingår i: [Host publication title missing]. - 0780371232 ; , s. 290-290
-
Konferensbidrag (refereegranskat)abstract
- The active tailbiting segment distance for convolutional codes is introduced. Together with the earlier defined active burst distance, it describes the error correcting capability of a tailbiting code encoded by a convolutional encoder. Lower bounds on the new active distance as well as an upper bound on the ratio between tailbiting length and memory of the encoder such that its minimum
|
|
| 4. |
|
|
| 5. |
- Jönsson, Fredrik, et al.
(författare)
-
Correlation attacks on stream ciphers over GF(2^n)
- 2001
-
Ingår i: [Host publication title missing]. - 0780371232 ; , s. 140-140
-
Konferensbidrag (refereegranskat)abstract
- An algorithm for correlation attacks on stream ciphers over GF(2 n) is proposed. Furthermore, the performance of the algorithm is analysed by using a random coding bound.
|
|
| 6. |
- Lentmaier, Michael, et al.
(författare)
-
Analysis of the asymptotic iterative decoding performance of turbo codes
- 2001
-
Ingår i: [Host publication title missing]. - 0780371232
-
Konferensbidrag (refereegranskat)abstract
- We analyse the iterative decoding performance of conventional rate R=1/3 turbo codes, when both code length and number of iterations tend to infinity. To obtain a rigorous bound on the iterative limit, we introduce a two-phase decoding algorithm which can be analyzed asymptotically
|
|
| 7. |
- Thorén, Karl, et al.
(författare)
-
Precision Issues in the implementation of BCJR decoders
- 2001
-
Ingår i: [Host publication title missing]. - 0780371232 ; , s. 289-289
-
Konferensbidrag (refereegranskat)abstract
- The BCJR algorithm is a symbol-bysymbol soft-output MAP decoder for trellis codes. This paper studies the effect of wordlength variations on the BCJR performance and looks at two strategies for reducing the wordlength.
|
|
| 8. |
- Truhachev, Dmitri, et al.
(författare)
-
Mathematical analysis of iterative decoding of LDPC convolutional codes
- 2001
-
Ingår i: [Host publication title missing]. - 0780371232
-
Konferensbidrag (refereegranskat)abstract
- Asymptotic iterative decoding performance of low-density parity-check (LDPC) convolutional codes is analyzed. An important role within the analysis is a theorem on the minimal length of cycles in the Tanner graph describing a code
|
|
