12,884 Hits in 3.6 sec

A Fast Correlation Attack on the Shrinking Generator [chapter]

Bin Zhang, Hongjun Wu, Dengguo Feng, Feng Bao
2005 Lecture Notes in Computer Science  
In this paper we demonstrate a fast correlation attack on the shrinking generator with known connections.  ...  Our result confirms Golić's conjecture that the shrinking generator may be vulnerable to fast correlation attacks without exhaustively searching through all possible initial states of some LFSR is correct  ...  Acknowledgements We would like to thank the anonymous reviewers for very helpful comments.  ... 
doi:10.1007/978-3-540-30574-3_7 fatcat:4e6dzygiyvgyzdhdnlhrs25yb4

An Improved Fast Correlation Attack on Stream Ciphers [chapter]

Bin Zhang, Dengguo Feng
2009 Lecture Notes in Computer Science  
At Crypto'2000, Johansson and Jönsson proposed a fast correlation attack on stream ciphers based on the Goldreich-Rubinfeld-Sudan algorithm.  ...  An application of the new algorithm results in the first-known near-practical key recovery attack on the shrinking generator with the parameters suggested by Krawczyk in 1994, which was verified in the  ...  We would like to thank the anonymous reviewers for very helpful comments. This paper is supported by the National Natural Science  ... 
doi:10.1007/978-3-642-04159-4_14 fatcat:xfs7qhyehrhqnc26vlf6viivte

Security Analysis of the Generalized Self-shrinking Generator [chapter]

Bin Zhang, Hongjun Wu, Dengguo Feng, Feng Bao
2004 Lecture Notes in Computer Science  
Our second attack is a fast correlation attack with the filter function (vector G) unknown.  ...  This attack shows that the generalized self-shrinking generator can not be more secure than the self-shrinking generator, although much more computations may be required by it.  ...  A Fast Correlation Attack with the Vector G Unknown In this section, we present a novel fast correlation attack on the generalized selfshrinking generator without the knowledge of G.  ... 
doi:10.1007/978-3-540-30191-2_30 fatcat:xmktxrcazvderf4nsmnnwnogve

Correlation Analysis of the Shrinking Generator [chapter]

Jovan D. Golić
2001 Lecture Notes in Computer Science  
A probabilistic analysis of the shrinking generator which shows that this generator can be vulnerable to a specific fast correlation attack is conducted.  ...  for fast correlation attacks on regularly clocked LFSR's.  ...  In conclusion, the second stage of the basic fast correlation attack on the shrinking generator may be successful for a large class of LFSR 1 feedback polynomials.  ... 
doi:10.1007/3-540-44647-8_26 fatcat:jyffdiray5fftk2janznjor3ky

Page 6506 of Mathematical Reviews Vol. , Issue 2003h [page]

2003 Mathematical Reviews  
A probabilistic analysis of the shrinking generator which shows that this generator can be vulnerable to a specific fast correlation attack is conducted.  ...  for fast correlation attacks on regularly INFORMATION AND COMMUNICATION, CIRCUITS 6506 clocked LFSR’s.  ... 

Fish: A fast software stream cipher [chapter]

Uwe Blöcher, Markus Dichtl
1994 Lecture Notes in Computer Science  
This paper describes a fast software stream cipher called Fish based on the shrinking principle applied to the lagged Fibonacci generator (Fish -Fibonacci shrinking).  ...  It is designed to make full use of the 32 bit word length of popular processors. On an Intc1486 clocked with 33 MHz a data rate of 15 Mbit/s is achieved with a C implementation.  ...  Acknowledgement We thank Johan Mordhorst for speeding up the C-implementation of Fish.  ... 
doi:10.1007/3-540-58108-1_4 fatcat:iqruk3mtcrertf6lqijusvoxb4

Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator

Sara D. Cardell, Amparo Fúster-Sabater, Adrián H. Ranea
2018 Open Mathematics  
In this work, emphasis is on the most representative decimation-based generator, the shrinking generator, which has been cryptanalyzed just by solving linear equation systems.  ...  Decimation-based sequence generators are a class of non-linear cryptographic generators designed to be used in hardware implementations.  ...  Acknowledgement: The work of the rst author was supported by FAPESP with process number 2015/07246-0.  ... 
doi:10.1515/math-2018-0058 fatcat:6iugqkbi6vd3baxia57wloyz4m

On Fibonacci keystream generators [chapter]

Ross Anderson
1995 Lecture Notes in Computer Science  
We then discuss how such attacks can be avoided, and present a new algorithm, PIKE, which is based on the A5 algorithm used in GSM telephones.  ...  A number of keystream generators have been proposed which are based on Fibonacci sequences, and at least one has been fielded.  ...  Acknowledgements: David Wheeler first expressed doubt about the nonlinear combining operations in FISH; Don Coppersmith pointed out the vulnerability of the sparse shrinking generator; David Wheeler pointed  ... 
doi:10.1007/3-540-60590-8_26 fatcat:kgy6iknbdbfe3klq6hxm6w6b5a

Cooling-Shrinking Attack: Blinding the Tracker with Imperceptible Noises [article]

Bin Yan and Dong Wang and Huchuan Lu and Xiaoyun Yang
2020 arXiv   pre-print
In this paper, a cooling-shrinking attack method is proposed to deceive state-of-the-art SiameseRPN-based trackers.  ...  An effective and efficient perturbation generator is trained with a carefully designed adversarial loss, which can simultaneously cool hot regions where the target exists on the heatmaps and force the  ...  The speed of our attacking algorithm is also extremely fast.  ... 
arXiv:2003.09595v1 fatcat:xy33cpybene75ks5nwc5eewho4

Some Attacks on the Bit-Search Generator [chapter]

Martin Hell, Thomas Johansson
2005 Lecture Notes in Computer Science  
The bit-search generator (BSG) was proposed in 2004 and can be seen as a variant of the shrinking and self-shrinking generators.  ...  We present various attacks on the BSG based on the fact that the output sequence can be uniquely defined by the differential of the input sequence.  ...  The well known fast correlation attack, see [15] , depends on the existence of low weight multiples of modest degree of the LFSR feedback polynomial.  ... 
doi:10.1007/11502760_14 fatcat:34j6xmz3hrfgnewcbyd4svhiu4

Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers [chapter]

Jovan Dj. Golić
1995 Lecture Notes in Computer Science  
A theoretical framework for fast correlation attacks on irregularly clocked linear feedback shift registers (LFSRs) based on a recently established linear statistical weakness of decimated LFSR sequences  ...  A convergence condition in terms of the numbers of the parity-check sums needed for successful reconstruction and the required polynomial computational complexity indicate that the proposed fast correlation  ...  In general, the chances for success of the proposed fast correlation attack appear to be greater in the constrained clocking case than in the unconstrained one.  ... 
doi:10.1007/3-540-49264-x_20 fatcat:cyeubs5korgyxhfwuvmzj6qeoq

Lifting Wavelet Transform with Singular Value Decomposition for Robust Digital Image Watermarking

Sushma G.Kejgir, Manesh Kokare
2012 International Journal of Computer Applications  
The proposed algorithm is tested for robustness against eighteen attacks on each of the five different images.  ...  Also, use of SVD lends noninvertible property to the watermarking so that fake watermarked image cannot be generated.  ...  [3] proposed a blind digital image watermarking scheme based on SVD and fast Independent Component Analysis (ICA) algorithm.  ... 
doi:10.5120/5078-7193 fatcat:ylowyeentzbvbj46ppeqpv5jc4

New Cryptanalysis of Irregularly Decimated Stream Ciphers [chapter]

Bin Zhang
2009 Lecture Notes in Computer Science  
Then new correlation attacks are launched against the shrinking generator with Krawczyk's parameters, LILI-, DECIM v2 and DECIM-128 to access the security margin of these ciphers.  ...  We also examine the main design idea behind DECIM, i.e., to filter and then decimate the output using the ABSG algorithm, by showing a class of correlations in the ABSG mechanism and mounting attacks faster  ...  The Shrinking Generator For the SG with Krawczyk's parameters, we use the correlations specified in Table 3 to mount a correlation attack as follows.  ... 
doi:10.1007/978-3-642-05445-7_28 fatcat:562qpmxkgzgxbbhdnydb7ldbbi

Using Linear Hybrid Cellular Automata to Attack the Shrinking Generator

2006 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
This paper describes a new known-plaintext attack based on the computation of the characteristic polynomials of sub-automata and on the generation of the Galois field associated to one of the Linear Feedback  ...  The aim of this research is the efficient cryptanalysis of the Shrinking Generator through its characterization by means of Linear Hybrid Cellular Automata.  ...  The authors of [3] described a correlation attack targeting the second LFSR. A correlation attack based on searching specific subsequences of the output sequence was introduced in [4] .  ... 
doi:10.1093/ietfec/e89-a.5.1166 fatcat:ur7dwlkxmjcfnad3ga3tiywi6y

Randomness Analysis for the Generalized Self-Shrinking Sequences

Sara D. Cardell, Verónica Requena, Amparo Fúster-Sabater, Amalia B. Orúe
2019 Symmetry  
We find that the t-modified self-shrunken sequences can be generated from a generalized self-shrinking generator.  ...  Then, an in-depth analysis of randomness focused on the generalized sequences by means of complete and powerful batteries of statistical tests and graphical tools is done, providing a useful vision of  ...  Fausto Montoya for his help with the analysis of the sequences. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/sym11121460 fatcat:hpgtuutw4nbgzjeqoqwjln4t54
« Previous Showing results 1 — 15 out of 12,884 results