| 1. |
- Bierbrauer, J., et al.
(author)
-
On the construction of universal families of hash functions via geometric codes and concatenation
- 1993
-
In: Advances in Cryptology / Lecture Notes in Computer Science. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783540577669 ; 773, s. 331-342
-
Conference paper (peer-reviewed)abstract
- In this paper we use coding theory to give simple explanations of some recent results on universal hashing. We first apply our approach to give a precise and elegant analysis of the Wegman-Carter construction for authentication codes. Using Reed-Solomon codes and the well known concept of concatenated codes we can then give some new constructions, which require much less key size than previously known constructions. The relation to coding theory allows the use of codes from algebraic curves for the construction of hash functions. Particularly, we show how codes derived from Artin-Schreier curves, Hermitian curves and Suzuki curves yield good classes of universal hash functions.
|
|
| 2. |
- Chepyzhov, Vladimir, et al.
(author)
-
On a fast correlation attack on certain streaxn ciphers
- 1991
-
In: Advances in Cryptology—EUROCRYPT 1991 : Workshop on the Theory and Application of Cryptographic Techniques, Proceedings - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783540464167 - 9783540546207 ; 547 LNCS, s. 176-185
-
Conference paper (peer-reviewed)abstract
- In this paper we present a new algorithm for the recovery of the initial state of a linear feedback shift register when a noisy output sequence is given. Our work is focussed on the investigation of the asymptotical behaviour of the recovery process rather than on the construction of an optimal recovery procedure. Our results show the importance of low-weight checks and show also that the complexity of the recovery problem grows less than exponentially with the length of the shift register, even if the number of taps grows linearly with the register length. Our procedure works for shift register with arbitrary feedback polynomial.
|
|
| 3. |
- Johansson, Thomas
(author)
-
On the construction of perfect authentication codes that permit arbitration
- 1993
-
In: Advances in Cryptology / Lecture Notes in Computer Science. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783540577669 ; 773, s. 343-354
-
Conference paper (peer-reviewed)abstract
- Authentication codes that permit arbitration are codes that unconditionally protect against deceptions from the outsiders and additionally also protect against some forms of deceptions from the insiders. Simmons introduced this authentication model and he also showed a way of constructing such codes, called the Cartesian product construction. We present a general way of constructing such codes and we also derive two specific classes of such codes. One that is perfect in the sense that it meets the lower bounds on the size of the transmitter’s and the receiver’s keys and one that allows the number of source states to be chosen arbitrarily large.
|
|
| 4. |
|
|
| 5. |
- Nilsson, Peter, et al.
(author)
-
A bit-serial CMOS digital IF-filter for mobile radio using an on-chip clock
- 1994
-
In: Mobile communications advanced systems and components / Lecture notes in Computer Science. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 3540578560 ; 783, s. 510-521
-
Conference paper (peer-reviewed)abstract
- A chip for digital intermediate frequency filtering is introduced. The filter is intended move most of the analog intermediate frequency filtering to the digital domain in systems like the American mobile radio system (IS-54). It is a wave digital lattice filter realized with bit-serial arithmetic. Furthermore, a technique for local clocks on chip is presented. The method is based on a ring oscillator and a cycle counter which is controlled from outside the chip. A 0.8 micron technology custom test chip has been fabricated and tested.
|
|
| 6. |
- Smeets, Ben, et al.
(author)
-
On the construction of authentication codes with secrecy and codes withstanding spoofing attacks of order L ≥ 2
- 1991
-
In: Advances in Cryptology — EUROCRYPT 1990 : Workshop on the Theory and Application of Cryptographic Techniques, Proceedings - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783540535874 - 9783540468776 ; 473 LNCS, s. 306-312
-
Conference paper (peer-reviewed)abstract
- We present an analysis of some known cartesian authentication codes and their modification into authentication codes with secrecy, with transmission rate R = r/n, where n = 2, 3, …, and 1 ≤ r ≤ n - 1 using (n - r)(r + 1) q-ary key digits. For this purpose we use a grouping technique. Essentially the same key grouping technique is used for the construction of codes that withstand spoofing attacks of order L ≥ 2. The information rate of this scheme is also r/n, and it requires (L + r)(n - r) q-ary key digits. Moreover these codes allow that previously transmitted source states can be reused.
|
|
| 7. |
- Åström, Kalle, et al.
(author)
-
Fundamental difficulties with projective normalization of planar curves
- 1994
-
In: Applications of Invariance in Computer Vision - 2nd Joint European - US Workshop, Proceedings. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783540582403 - 9783540485834 ; 825 LNCS, s. 199-214
-
Conference paper (peer-reviewed)abstract
- In this paper projective normalization and projective invariants of planar curves are discussed. It is shown that there exists continuous affine invariants. It is shown that many curves can be projected arbitrarily close to a circle in a strengthened Hausdorff metric. This does not infer any limitations on projective invariants, but it is clear that projective normalization by maximizing compactness is unsuitable. It is also shown that arbitrarily close to each of a finite number of closed planar curves there is one member of a set of projectively equivalent curves. Thus there can not exist continuous projective invariants, and a projective normalisation scheme can not have both the properties of continuity and uniqueness. Although uniqueness might be preferred it is not essential for recognition. This is illustrated with an example of a projective normalization scheme for non-algebraic, both convex and non-convex, curves.
|
|
| 8. |
- Natarajan, V, et al.
(author)
-
Priority and abstraction in process algebra
- 1994
-
In: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE. - : SPRINGER-VERLAG BERLIN. - 0302-9743. ; 880, s. 217-230
-
Journal article (other academic/artistic)abstract
- This paper defines a behavioral equivalence based on the notion of weak observational equivalence for processes in which actions may take priority over other actions. The largest congruence contained in this relation is then identified and given a complet
|
|
| 9. |
- Yi, W, et al.
(author)
-
Decidability of timed language-inclusion for networks of real-time communicating sequential processes
- 1994
-
In: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE. - : SPRINGER-VERLAG BERLIN. - 0302-9743. ; 880, s. 243-255
-
Journal article (other academic/artistic)abstract
- An important verification problem for concurrent systems in general is that of establishing whether one system is a correct implementation, or refinement, of another system. For untimed systems, trace inclusion (or variants such as failure inclusion) is o
|
|
