A discrete logarithm-based approach to compute low-weight multiples of binary polynomials

Being able to compute efficiently a low-weight multiple of a given binary polynomial is often a key ingredient of correlation attacks to LFSR-based stream ciphers. The best known general purpose algorithm is based on the generalized birthday problem. We describe an alternative approach which is based on discrete logarithms and can take advantage of the structure of the polynomial. In some cases it has much lower memory complexity requirements with a comparable time complexity.     

The independence of two randomness properties of sequences over finite fields

We prove the logical independence of a complexity-theoretic and a statistical randomness property of sequences over a finite field. The two properties relate to the linear complexity profile and to the ∞$\infty$-distribution of sequences, respectively. The proofs are given by constructing counterexamples to the presumed logical implications between these two properties.     

薤白挥发油成分的超临界CO2萃取及GC-MS分析

采取超临界CO2萃取和水蒸气蒸馏两种方法提取薤白中的挥发油,比较了两种提取方法得到的挥发油的理化性质,并利用GC-MS对它们进行了定性、定量分析。两种方法的主要提取物均为含硫化合物,但超临界CO2萃取法得到的含硫化合物的数量和质量都高于水蒸气蒸馏法得到的提取物。采用水蒸气蒸馏法提取8 h得到的萃取率为1.72%。通过设计的超临界CO2萃取的正交实验,得到了最佳萃取工艺条件为:压力25 MPa,温度40℃,CO2流量为25L/h。最佳萃取时间为120 min,萃取率为4.41%,是水蒸气蒸馏法萃取率的2.8倍。实验结果表明,超临界CO2萃取法简单易行,可以较快速、有效地提取薤白中的挥发油。