Janusz Szmidt

Dr. Janusz Szmidt


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2012 in Fundamenta Informaticae
Verified
Journal Article
Open access
PDF file
PMPiotr Mroczkowski
Piotr Mroczkowski
JSJanusz Szmidt
Janusz Szmidt
In 2008 I. Dinur and A. Shamir presented a new type of algebraic attack on symmetric ciphers named cube attack. The method has been applied to reduced variants of stream ciphers Trivium and Grain-128, reduced variants of the block ciphers Serpent and

2 September 2024 in Cryptography and Communications
Verified
Journal Article
Open access
PDF file
AAAbbas Alhakim
Abbas Alhakim
CMChris J. Mitchell
Chris J. Mitchell
JSJanusz Szmidt
Janusz Szmidt
PWPeter R. Wild
Peter R. Wild
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either direction. In particular we establish how two variants of a generalised Lempel homomorphism can be used to recursively construct such sequences, generalising previous work on the binary case. We also derive an upper bound on the period of an orientable sequence.

28 February 2018
Verified
Book Chapter
Closed access
PDF file
PDPrzemysław Dąbrowski
Przemysław Dąbrowski
RGRafał Gliwa
Rafał Gliwa
JSJanusz Szmidt
Janusz Szmidt
RWRobert Wicik
Robert Wicik

2 June 2021 in SN Computer Science
Verified
Journal Article
Closed access
PDF file
ZCZULING CHANG
ZULING CHANG
MEMartianus Frederic Ezerman
Martianus Frederic Ezerman
AFAdamas Aqsa Fahreza
Adamas Aqsa Fahreza
SLSan Ling
San Ling
JSJanusz Szmidt
Janusz Szmidt
Huaxiong WangHuaxiong Wang
Huaxiong Wang

28 February 2018
Verified
Book Chapter
Closed access
PDF file
JSJanusz Szmidt
Janusz Szmidt

2 November 2017 in arXiv
Verified
Preprint
Open access
PDF file
JSJanusz Szmidt
Janusz Szmidt
We construct feedback functions of Nonlinear Feedback Shift Registers from those of Linear Feedback Shift Registers using the cross-join pairs method and the Zech logarithms in finite fields. We present a hypothetical algorithm to generate all de Bruijn sequences of a given order.