On the joint linear complexity profile of explicit inversive multisequences

被引:10
|
作者
Meidl, W
Winterhof, A
机构
[1] Austrian Acad Sci, Johann Radon Inst Computat & Appl Math, A-4040 Linz, Austria
[2] Natl Univ Singapore, Temasek Labs, Singapore 117508, Singapore
基金
奥地利科学基金会;
关键词
linear complexity profile; multisequences; nonlinear pseudorandom numbers; inversive method; parallelization;
D O I
10.1016/j.jco.2004.09.001
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We prove lower bounds on the joint linear complexity profile of multisequences obtained by explicit inversive methods and show that for some suitable choices of parameters these joint linear complexity profiles are close to be perfect. (c) 2004 Elsevier Inc. All rights reserved.
引用
收藏
页码:324 / 336
页数:13
相关论文
共 50 条