Editorial: Cryptography and Communications, Volume 1, Issue 1 Claude Carlet EditorialNotes 19 March 2009 Pages: 1 - 2
Joint linear complexity of multisequences consisting of linear recurring sequences Fang-Wei FuHarald NiederreiterFerruh Ă–zbudak OriginalPaper 16 January 2008 Pages: 3 - 29
Small stopping sets in Steiner triple systems Charles J. ColbournYuichiro Fujiwara OriginalPaper 05 April 2008 Pages: 31 - 46
New criteria for linear maps in AES-like ciphers Joan DaemenVincent Rijmen OriginalPaper 25 April 2008 Pages: 47 - 69
An overview of distinguishing attacks on stream ciphers Martin HellThomas JohanssonLennart Brynielsson Review Article 17 October 2008 Pages: 71 - 94
Lower bounds on error complexity measures for periodic LFSR and FCSR sequences Ramakanth KavuluruAndrew Klapper OriginalPaper 08 August 2008 Pages: 95 - 116
How to determine linear complexity and k-error linear complexity in some classes of linear recurring sequences Wilfried Meidl OriginalPaper 05 November 2008 Pages: 117 - 133