Stafford E. Tavares

From MaRDI portal
Person:1912766

Available identifiers

zbMath Open tavares.stafford-eWikidataQ3496350 ScholiaQ3496350MaRDI QIDQ1912766

List of research outcomes

PublicationDate of PublicationType
A Layered Broadcast Cryptographic System2022-01-08Paper
Sequence Complexity as a Test for Cryptographic Systems2017-04-10Paper
Toward the True Random Cipher: On Expected Linear Probability Values for SPNS with Randomly Selected S-Boxes2015-10-27Paper
On some probabilistic approximations for AES-like S-boxes2006-09-14Paper
Affine equivalence in the AES round function2005-08-17Paper
https://portal.mardi4nfdi.de/entity/Q47364262004-08-09Paper
Avalanche characteristics of substitution-permutation encryption networks2003-11-10Paper
https://portal.mardi4nfdi.de/entity/Q31496742002-12-03Paper
https://portal.mardi4nfdi.de/entity/Q49493282002-09-11Paper
https://portal.mardi4nfdi.de/entity/Q42508052000-02-02Paper
https://portal.mardi4nfdi.de/entity/Q42508122000-02-01Paper
https://portal.mardi4nfdi.de/entity/Q43187001999-08-30Paper
Information leakage of a randomly selected boolean function1998-11-17Paper
CRYPTANALYSIS OF SUBSTITUTION-PERMUTATION NETWORKS USING KEY-DEPENDENT DEGENERACY1997-12-15Paper
https://portal.mardi4nfdi.de/entity/Q43416821997-08-14Paper
https://portal.mardi4nfdi.de/entity/Q43416951997-06-18Paper
Comment on ``Bounds on the number of functions satisfying the Strict Avalanche Criterion1997-02-28Paper
Resistance of balanced s-boxes to linear and differential cryptanalysis1997-02-27Paper
Substitution-permutation networks resistant to differential and linear cryptanalysis1996-06-23Paper
A design of fast pipelined modular multiplier based on a diminished-radix algorithm1994-02-24Paper
An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks1993-05-18Paper
Generating bent sequences1993-01-17Paper
Generating and counting binary bent sequences1992-06-27Paper
The structured design of cryptographically good s-boxes1990-01-01Paper
The minimum distance of all binary cyclic codes of odd lengths from 69 to 991978-01-01Paper
Weight distribution of some 'best'<tex>(3m,2m)</tex>binary quasi-cyclic codes (Corresp.)1975-01-01Paper
Difference sets of the Hadamard type and quasi-cyclic codes1974-01-01Paper
Some rate-<tex>p/(p+1)</tex>quasi-cyclic codes (Corresp.)1974-01-01Paper
On binary majority-logic decodable codes (Corresp.)1974-01-01Paper
A note on the decomposition of cyclic codes into cyclic classes1973-01-01Paper
On the decomposition of cyclic codes into cyclic classes1971-01-01Paper
Synchronization of a class of codes derived from cyclic codes1970-01-01Paper
Further results on the synchronization of binary cyclic codes (Corresp.)1970-01-01Paper
Detecting and correcting multiple bursts for binary cyclic codes (Corresp.)1970-01-01Paper
Matrix approach to synchronization recovery for binary cyclic codes1969-01-01Paper
Synchronization of cyclic codes in the presence of burst errors1969-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Stafford E. Tavares