کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4603577 1336964 2008 16 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
F2 Lanczos revisited
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
F2 Lanczos revisited
چکیده انگلیسی

We present a new variant of the block Lanczos algorithm for finding vectors in the kernel of a symmetric matrix over F2. Our algorithm is at least as efficient as that of Montgomery [Peter L. Montgomery, A block Lanczos algorithm for finding dependencies over GF(2). in: Advances in Cryptology—EUROCRYPT’95 (Saint-Malo, 1995), Lecture Notes in Comput. Sci., vol. 921, Springer, Berlin, 1995, pp. 106–120], while the sequence of matrices Wi constructed here have different algebraic properties that may be useful in eventually providing a provable upper bound on the time required to solve this problem. Namely, our Wi satisfy for i≠j as opposed to in [6].

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 428, Issue 4, 1 February 2008, Pages 1135-1150