Results 1 
3 of
3
Synchronization of PseudoRandom Signals by ForwardOnly Message Passing with Application to Electronic Circuits
, 2005
"... Abstract—It has been observed that a linearfeedback shiftregister (LFSR) sequence can be synchronized by feeding the modulated sequence into a “soft ” (or “analog”) version of the LFSR. In this paper, the “soft LFSR ” is derived as forwardonly message passing in the corresponding factor graph. A ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
Abstract—It has been observed that a linearfeedback shiftregister (LFSR) sequence can be synchronized by feeding the modulated sequence into a “soft ” (or “analog”) version of the LFSR. In this paper, the “soft LFSR ” is derived as forwardonly message passing in the corresponding factor graph. A continoustime analog (suitable for realization as a clockless electronic circuit) is then given of both the LFSR and the soft LFSR. A connection is thus established between statistical state estimation and the phenomenon of entrainment of dynamical systems, which opens the prospect of deriving dynamical systems (such as electronic circuits) with strong entrainment capabilities from more powerful message passing algorithms. Keywords—LFSR, synchronization, factor graphs, message passing, nonlinear filtering, circuits, dynamical systems, entrainment. 1
Analogdecoder experiments with subthreshold CMOS softgates
 Proc. 2003 IEEE Int. Symp. on Circuits and Systems
"... A collection of analog “softgate ” CMOS ASICs operating in subthresholdmode was implemented in a lowcost semicustom 0.8 µm technology. These softgates allow, in particular, the realization of various decoders for simple error correcting codes on the breadboard level. Measurement results are pre ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
A collection of analog “softgate ” CMOS ASICs operating in subthresholdmode was implemented in a lowcost semicustom 0.8 µm technology. These softgates allow, in particular, the realization of various decoders for simple error correcting codes on the breadboard level. Measurement results are presented for an (8,4,4) Hamming code. 1.
TABLE II OUR ATTACK COMPARED TO A GENERIC TIME/MEMORY/DATA TRADEOFF ATTACK
"... From the table it is clear that using the same time complexity and amount of keystream the generic time/memory/data tradeoff attack requires an infeasible amount of memory and precomputation. A typical point on the curve, mentioned in [9], is € a „ aP HXTTv and w a h aP HXQQv. This point will give m ..."
Abstract
 Add to MetaCart
(Show Context)
From the table it is clear that using the same time complexity and amount of keystream the generic time/memory/data tradeoff attack requires an infeasible amount of memory and precomputation. A typical point on the curve, mentioned in [9], is € a „ aP HXTTv and w a h aP HXQQv. This point will give more realistic values, and comparing it to our attack we see that it uses both more data and more computation than a typical point on our curve. VII. CONCLUSION Since the introduction of the selfshrinking generator in 1994 several attacks have been proposed, some requiring only a small known keystream while others need longer sequence to succeed. In this correspondence, we presented two new attacks on the selfshrinking generator, one using a short keystream and one requiring a longer keystream. In the first attack, operating on a very short known keystream, we showed that the complexity is approximately the same as the best previously