Stafford E. Tavares

According to our database, Stafford E. Tavares authored at least 51 papers between 1969 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2006

On some probabilistic approximations for AES-like s-boxes.

Amr M. Youssef, Stafford E. Tavares, Guang Gong

Discret. Math., 2006

2005

Affine equivalence in the AES round function.

Amr M. Youssef, Stafford E. Tavares

Discret. Appl. Math., 2005

2004

Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael.

Liam Keliher, Henk Meijer, Stafford E. Tavares

IACR Cryptol. ePrint Arch., 2004

2003

Comments on the security of fast encryption algorithm for multimedia (FEA-M).

Amr M. Youssef, Stafford E. Tavares

IEEE Trans. Consumer Electron., 2003

2002

On Some Algebraic Structures in the AES Round Function.

Amr M. Youssef, Stafford E. Tavares

IACR Cryptol. ePrint Arch., 2002

2001

Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs.

Liam Keliher, Henk Meijer, Stafford E. Tavares

IACR Cryptol. ePrint Arch., 2001

Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael.

Liam Keliher, Henk Meijer, Stafford E. Tavares

Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs.

Liam Keliher, Henk Meijer, Stafford E. Tavares

Proceedings of the Advances in Cryptology, 2001

1999

Modeling Linear Characteristics of Substitution-Permutation Networks.

Liam Keliher, Henk Meijer, Stafford E. Tavares

Proceedings of the Selected Areas in Cryptography, 6th Annual International Workshop, 1999

1998

Cryptanalysis of RC4-like Ciphers.

Serge Mister, Stafford E. Tavares

Proceedings of the Selected Areas in Cryptography '98, 1998

Toward Provable Security of Substitution-Permutation Encryption Networks.

Zhi-Guo Chen, Stafford E. Tavares

Proceedings of the Selected Areas in Cryptography '98, 1998

1997

Resistance of a CAST-Like Encryption Algorithm to Linear and Differential Cryptanalysis.

Joseph Lee, Howard M. Heys, Stafford E. Tavares

Des. Codes Cryptogr., 1997

1996

Substitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis.

Howard M. Heys, Stafford E. Tavares

J. Cryptol., 1996

Comment on "Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion".

Amr M. Youssef, Stafford E. Tavares

Inf. Process. Lett., 1996

Cryptanalysis of Substitution-Permutation Networks Using Key-Dependent Degeneracy.

Howard M. Heys, Stafford E. Tavares

Cryptologia, 1996

1995

Avalanche Characteristics of Substitution-Permutation Encryption Networks.

Howard M. Heys, Stafford E. Tavares

IEEE Trans. Computers, 1995

Resistance of Balanced s-Boxes to Linear and Differential Cryptanalysis.

Amr M. Youssef, Stafford E. Tavares

Inf. Process. Lett., 1995

Information Leakage of a Randomly Selected Boolean Function.

Amr M. Youssef, Stafford E. Tavares

Proceedings of the Information Theory and Applications II, 1995

1994

Information Leakage of Boolean Functions and Its Relationship to Other Cryptographic Criteria.

M. Zhang, Stafford E. Tavares, L. Lorne Campbell

Proceedings of the CCS '94, 1994

The Design of Substitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis.

Howard M. Heys, Stafford E. Tavares

Proceedings of the CCS '94, 1994

1993

A Design of a Fast Pipelined Modular Multiplier Based on a Diminished-Radix Algorithm.

Glenn A. Orton, Lloyd E. Peppard, Stafford E. Tavares

J. Cryptol., 1993

1992

New Fault Tolerant Techniques for Residue Number Systems.

Glenn A. Orton, Lloyd E. Peppard, Stafford E. Tavares

IEEE Trans. Computers, 1992

Generating Bent Sequences.

Carlisle M. Adams, Stafford E. Tavares

Discret. Appl. Math., 1992

On the Design of SP Networks From an Information Theoretic Point of View.

M. Sivabalan, Stafford E. Tavares, Lloyd E. Peppard

Proceedings of the Advances in Cryptology, 1992

Modelling and Analyzing Cryprographic Protocols Using Petri Nets.

Benjamin B. Nieh, Stafford E. Tavares

Proceedings of the Advances in Cryptology, 1992

Constructing Large Cryptographically Strong S-boxes.

John Detombe, Stafford E. Tavares

Proceedings of the Advances in Cryptology, 1992

1991

An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks.

M. H. Dawson, Stafford E. Tavares

Proceedings of the Advances in Cryptology, 1991

1990

Generating and counting binary bent sequences.

Carlisle M. Adams, Stafford E. Tavares

IEEE Trans. Inf. Theory, 1990

The Structured Design of Cryptographically Good S-Boxes.

Carlisle M. Adams, Stafford E. Tavares

J. Cryptol., 1990

1989

Flexible Access Control with Master Keys.

Gerald C. Chick, Stafford E. Tavares

Proceedings of the Advances in Cryptology, 1989

Good S-Boxes Are Easy To Find.

Carlisle M. Adams, Stafford E. Tavares

Proceedings of the Advances in Cryptology, 1989

1988

Architectures for exponentiation in GF(2^m).

P. Andrew Scott, Stanley J. Simmons, Stafford E. Tavares, Lloyd E. Peppard

IEEE J. Sel. Areas Commun., 1988

1986

A Fast VLSI Multiplier for GF(2^m).

P. Andrew Scott, Stafford E. Tavares, Lloyd E. Peppard

IEEE J. Sel. Areas Commun., 1986

VLSI Implementation of Public-Key Encryption Algorithms.

Glenn A. Orton, M. P. Roy, P. Andrew Scott, Lloyd E. Peppard, Stafford E. Tavares

Proceedings of the Advances in Cryptology, 1986

1985

On the Design of S-Boxes.

A. F. Webster, Stafford E. Tavares

Proceedings of the Advances in Cryptology, 1985

A Layered Approach to the Design of Private Key Cryptosystems.

T. E. Moore, Stafford E. Tavares

Proceedings of the Advances in Cryptology, 1985

1984

Sequence Complexity as a Test for Cryptographic Systems.

A. K. Leung, Stafford E. Tavares

Proceedings of the Advances in Cryptology, 1984

1982

Using Data Uncertainty to Increase the Crypto-Complexity of Simple Private Key Enciphering Schemes.

G. M. Avis, Stafford E. Tavares

Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1978

A Note on Extended Quaternary Quadratic Residue Codes and Their Binary Images

Maurice Karlin, Vijay K. Bhargava, Stafford E. Tavares

Inf. Control., August, 1978

The minimum distance of all binary cyclic codes of odd lengths from 69 to 99.

Gary Promhouse, Stafford E. Tavares

IEEE Trans. Inf. Theory, 1978

1975

Weight distribution of some 'best' (3m, 2m) binary quasi-cyclic codes (Corresp.).

Jack M. Stein, Vijay K. Bhargava, Stafford E. Tavares

IEEE Trans. Inf. Theory, 1975

1974

Difference Sets of the Hadamard Type and Quasi-Cyclic Codes

Vijay K. Bhargava, Stafford E. Tavares, Saligram G. S. Shiva

Inf. Control., December, 1974

Some rate- p/(p+1) quasi-cyclic codes (Corresp.).

Stafford E. Tavares, Vijay K. Bhargava, Saligram G. S. Shiva

IEEE Trans. Inf. Theory, 1974

On binary majority-logic decodable codes (Corresp.).

Saligram G. S. Shiva, Stafford E. Tavares

IEEE Trans. Inf. Theory, 1974

1973

A Note on the Decomposition of Cyclic Codes into Cyclic Classes

Paul E. Allard, Saligram G. S. Shiva, Stafford E. Tavares

Inf. Control., February, 1973

1971

On the Decomposition of Cyclic Codes into Cyclic Classes

Stafford E. Tavares, Paul E. Allard, Saligram G. S. Shiva

Inf. Control., May, 1971

1970

Synchronization of a Class of Codes Derived from Cyclic Codes

Stafford E. Tavares, M. Fukada

Inf. Control., April, 1970

Detecting and correcting multiple bursts for binary cyclic codes (Corresp.).

Stafford E. Tavares, Saligram G. S. Shiva

IEEE Trans. Inf. Theory, 1970

Further results on the synchronization of binary cyclic codes (Corresp.).

Stafford E. Tavares, M. Fukada

IEEE Trans. Inf. Theory, 1970

1969

Synchronization of Cyclic Codes in the Presence of Burst Errors

Stafford E. Tavares, M. Fukada

Inf. Control., May, 1969

Matrix approach to synchronization recovery for binary cyclic codes.

Stafford E. Tavares, M. Fukada

IEEE Trans. Inf. Theory, 1969