Titlebook: Computational Intelligence and Security; International Confer Yue Hao,Jiming Liu,Yong-Chang Jiao Conference proceedings 2005 Springer-Verla

表示问

仔细阅读

亲密

Ganglion

BILE

Cryptanalysis of a Cellular Automata CryptosystemIn this paper we show that the new Cellular Automata Cryptosystem (CAC) is insecure and can be broken by chosen-plaintexts attack with little computation. We also restore the omitted parts clearly by deriving the rotating number . of plaintext bytes and the procedure of Major CA. The clock circle Δ of Major CA and the key S. are also attacked.

富饶

Stability of the Linear Complexity of the Generalized Self-shrinking SequencesThe stability of the linear complexity of the generalized self-shrinking sequences over GF(2) with period .=2. is investigated. The main results follow: The linear complexity of the periodic sequences obtained by either deleting or inserting one symbol within one period are discussed, and the explicit values for the linear complexity are given.

MORT

笨重

https://doi.org/10.1007/11596981Bayesian networks; Fuzzy; architecture; cognition; computational intelligence; cryptographic protocols; da

粗鄙的人

合唱队

A Fast Inversion Algorithm and Low-Complexity Architecture over ,(2,)finite field, the multiplicative inversion is the most time consuming operation. In this paper, a fast inversion algorithm over .(2.) with the polynomial basis representation is proposed. The proposed algorithm executes in about 27.5% or 45.6% less iterations than the extended binary gcd algorithm (