Publication | Date of Publication | Type |
---|
A Layered Broadcast Cryptographic System | 2022-01-08 | Paper |
Sequence Complexity as a Test for Cryptographic Systems | 2017-04-10 | Paper |
Toward the True Random Cipher: On Expected Linear Probability Values for SPNS with Randomly Selected S-Boxes | 2015-10-27 | Paper |
On some probabilistic approximations for AES-like S-boxes | 2006-09-14 | Paper |
Affine equivalence in the AES round function | 2005-08-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4736426 | 2004-08-09 | Paper |
Avalanche characteristics of substitution-permutation encryption networks | 2003-11-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q3149674 | 2002-12-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4949328 | 2002-09-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4250805 | 2000-02-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4250812 | 2000-02-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4318700 | 1999-08-30 | Paper |
Information leakage of a randomly selected boolean function | 1998-11-17 | Paper |
CRYPTANALYSIS OF SUBSTITUTION-PERMUTATION NETWORKS USING KEY-DEPENDENT DEGENERACY | 1997-12-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4341682 | 1997-08-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4341695 | 1997-06-18 | Paper |
Comment on ``Bounds on the number of functions satisfying the Strict Avalanche Criterion | 1997-02-28 | Paper |
Resistance of balanced s-boxes to linear and differential cryptanalysis | 1997-02-27 | Paper |
Substitution-permutation networks resistant to differential and linear cryptanalysis | 1996-06-23 | Paper |
A design of fast pipelined modular multiplier based on a diminished-radix algorithm | 1994-02-24 | Paper |
An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks | 1993-05-18 | Paper |
Generating bent sequences | 1993-01-17 | Paper |
Generating and counting binary bent sequences | 1992-06-27 | Paper |
The structured design of cryptographically good s-boxes | 1990-01-01 | Paper |
The minimum distance of all binary cyclic codes of odd lengths from 69 to 99 | 1978-01-01 | Paper |
Weight distribution of some 'best'<tex>(3m,2m)</tex>binary quasi-cyclic codes (Corresp.) | 1975-01-01 | Paper |
Difference sets of the Hadamard type and quasi-cyclic codes | 1974-01-01 | Paper |
Some rate-<tex>p/(p+1)</tex>quasi-cyclic codes (Corresp.) | 1974-01-01 | Paper |
On binary majority-logic decodable codes (Corresp.) | 1974-01-01 | Paper |
A note on the decomposition of cyclic codes into cyclic classes | 1973-01-01 | Paper |
On the decomposition of cyclic codes into cyclic classes | 1971-01-01 | Paper |
Synchronization of a class of codes derived from cyclic codes | 1970-01-01 | Paper |
Further results on the synchronization of binary cyclic codes (Corresp.) | 1970-01-01 | Paper |
Detecting and correcting multiple bursts for binary cyclic codes (Corresp.) | 1970-01-01 | Paper |
Matrix approach to synchronization recovery for binary cyclic codes | 1969-01-01 | Paper |
Synchronization of cyclic codes in the presence of burst errors | 1969-01-01 | Paper |