default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStafford E. Tavares
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j29]Amr M. Youssef, Stafford E. Tavares, Guang Gong:
On some probabilistic approximations for AES-like s-boxes. Discret. Math. 306(16): 2016-2020 (2006)- [e3]Bart Preneel, Stafford E. Tavares:
Selected Areas in Cryptography, 12th International Workshop, SAC 2005, Kingston, ON, Canada, August 11-12, 2005, Revised Selected Papers. Lecture Notes in Computer Science 3897, Springer 2006, ISBN 3-540-33108-5 [contents] - 2005
- [j28]Amr M. Youssef, Stafford E. Tavares:
Affine equivalence in the AES round function. Discret. Appl. Math. 148(2): 161-170 (2005) - 2004
- [i3]Liam Keliher, Henk Meijer, Stafford E. Tavares:
Completion of Computation of Improved Upper Bound on the Maximum Average Linear Hull Probabilty for Rijndael. IACR Cryptol. ePrint Arch. 2004: 74 (2004) - 2003
- [j27]Amr M. Youssef, Stafford E. Tavares:
Comments on the security of fast encryption algorithm for multimedia (FEA-M). IEEE Trans. Consumer Electron. 49(1): 168-170 (2003) - 2002
- [i2]Amr M. Youssef, Stafford E. Tavares:
On Some Algebraic Structures in the AES Round Function. IACR Cryptol. ePrint Arch. 2002: 144 (2002) - 2001
- [c19]Liam Keliher, Henk Meijer, Stafford E. Tavares:
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. EUROCRYPT 2001: 420-436 - [c18]Liam Keliher, Henk Meijer, Stafford E. Tavares:
Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael. Selected Areas in Cryptography 2001: 112-128 - [e2]Douglas R. Stinson, Stafford E. Tavares:
Selected Areas in Cryptography, 7th Annual International Workshop, SAC 2000, Waterloo, Ontario, Canada, August 14-15, 2000, Proceedings. Lecture Notes in Computer Science 2012, Springer 2001, ISBN 3-540-42069-X [contents] - [i1]Liam Keliher, Henk Meijer, Stafford E. Tavares:
Dual of New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. IACR Cryptol. ePrint Arch. 2001: 33 (2001)
1990 – 1999
- 1999
- [c17]Liam Keliher, Henk Meijer, Stafford E. Tavares:
Modeling Linear Characteristics of Substitution-Permutation Networks. Selected Areas in Cryptography 1999: 78-91 - [e1]Stafford E. Tavares, Henk Meijer:
Selected Areas in Cryptography '98, SAC'98, Kingston, Ontario, Canada, August 17-18, 1998, Proceedings. Lecture Notes in Computer Science 1556, Springer 1999, ISBN 3-540-65894-7 [contents] - 1998
- [c16]Zhi-Guo Chen, Stafford E. Tavares:
Toward Provable Security of Substitution-Permutation Encryption Networks. Selected Areas in Cryptography 1998: 43-56 - [c15]Serge Mister, Stafford E. Tavares:
Cryptanalysis of RC4-like Ciphers. Selected Areas in Cryptography 1998: 131-143 - 1997
- [j26]Joseph Lee, Howard M. Heys
, Stafford E. Tavares:
Resistance of a CAST-Like Encryption Algorithm to Linear and Differential Cryptanalysis. Des. Codes Cryptogr. 12(3): 267-282 (1997) - 1996
- [j25]Howard M. Heys, Stafford E. Tavares:
Cryptanalysis of Substitution-Permutation Networks Using Key-Dependent Degeneracy. Cryptologia 20(3): 258-274 (1996) - [j24]Amr M. Youssef, Stafford E. Tavares:
Comment on "Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion". Inf. Process. Lett. 60(5): 271-275 (1996) - [j23]Howard M. Heys, Stafford E. Tavares:
Substitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis. J. Cryptol. 9(1): 1-19 (1996) - 1995
- [j22]Amr M. Youssef, Stafford E. Tavares:
Resistance of Balanced s-Boxes to Linear and Differential Cryptanalysis. Inf. Process. Lett. 56(5): 249-252 (1995) - [j21]Howard M. Heys, Stafford E. Tavares:
Avalanche Characteristics of Substitution-Permutation Encryption Networks. IEEE Trans. Computers 44(9): 1131-1139 (1995) - [c14]Amr M. Youssef, Stafford E. Tavares:
Information Leakage of a Randomly Selected Boolean Function. Information Theory and Applications 1995: 41-52 - 1994
- [c13]Howard M. Heys, Stafford E. Tavares:
The Design of Substitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis. CCS 1994: 148-155 - [c12]M. Zhang, Stafford E. Tavares, L. Lorne Campbell:
Information Leakage of Boolean Functions and Its Relationship to Other Cryptographic Criteria. CCS 1994: 156-165 - 1993
- [j20]Glenn A. Orton, Lloyd E. Peppard, Stafford E. Tavares:
A Design of a Fast Pipelined Modular Multiplier Based on a Diminished-Radix Algorithm. J. Cryptol. 6(4): 183-208 (1993) - 1992
- [j19]Carlisle M. Adams, Stafford E. Tavares:
Generating Bent Sequences. Discret. Appl. Math. 39(2): 155-159 (1992) - [j18]Glenn A. Orton, Lloyd E. Peppard, Stafford E. Tavares:
New Fault Tolerant Techniques for Residue Number Systems. IEEE Trans. Computers 41(11): 1453-1464 (1992) - [c11]John Detombe, Stafford E. Tavares:
Constructing Large Cryptographically Strong S-boxes. AUSCRYPT 1992: 165-181 - [c10]Benjamin B. Nieh, Stafford E. Tavares:
Modelling and Analyzing Cryprographic Protocols Using Petri Nets. AUSCRYPT 1992: 275-295 - [c9]M. Sivabalan, Stafford E. Tavares, Lloyd E. Peppard:
On the Design of SP Networks From an Information Theoretic Point of View. CRYPTO 1992: 260-279 - 1991
- [c8]M. H. Dawson, Stafford E. Tavares:
An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks. EUROCRYPT 1991: 352-367 - 1990
- [j17]Carlisle M. Adams, Stafford E. Tavares:
The Structured Design of Cryptographically Good S-Boxes. J. Cryptol. 3(1): 27-41 (1990) - [j16]Carlisle M. Adams, Stafford E. Tavares:
Generating and counting binary bent sequences. IEEE Trans. Inf. Theory 36(5): 1170-1173 (1990)
1980 – 1989
- 1989
- [c7]Gerald C. Chick, Stafford E. Tavares:
Flexible Access Control with Master Keys. CRYPTO 1989: 316-322 - [c6]Carlisle M. Adams, Stafford E. Tavares:
Good S-Boxes Are Easy To Find. CRYPTO 1989: 612-615 - 1988
- [j15]P. Andrew Scott, Stanley J. Simmons, Stafford E. Tavares, Lloyd E. Peppard:
Architectures for exponentiation in GF(2m). IEEE J. Sel. Areas Commun. 6(3): 578-585 (1988) - 1986
- [j14]P. Andrew Scott, Stafford E. Tavares, Lloyd E. Peppard:
A Fast VLSI Multiplier for GF(2m). IEEE J. Sel. Areas Commun. 4(1): 62-66 (1986) - [c5]Glenn A. Orton, M. P. Roy, P. Andrew Scott, Lloyd E. Peppard, Stafford E. Tavares:
VLSI Implementation of Public-Key Encryption Algorithms. CRYPTO 1986: 277-301 - 1985
- [c4]T. E. Moore, Stafford E. Tavares:
A Layered Approach to the Design of Private Key Cryptosystems. CRYPTO 1985: 227-245 - [c3]A. F. Webster, Stafford E. Tavares:
On the Design of S-Boxes. CRYPTO 1985: 523-534 - 1984
- [c2]A. K. Leung, Stafford E. Tavares:
Sequence Complexity as a Test for Cryptographic Systems. CRYPTO 1984: 468-474 - 1982
- [c1]G. M. Avis, Stafford E. Tavares:
Using Data Uncertainty to Increase the Crypto-Complexity of Simple Private Key Enciphering Schemes. CRYPTO 1982: 139-143
1970 – 1979
- 1978
- [j13]Maurice Karlin, Vijay K. Bhargava, Stafford E. Tavares:
A Note on Extended Quaternary Quadratic Residue Codes and Their Binary Images. Inf. Control. 38(2): 148-153 (1978) - [j12]Gary Promhouse, Stafford E. Tavares:
The minimum distance of all binary cyclic codes of odd lengths from 69 to 99. IEEE Trans. Inf. Theory 24(4): 438-442 (1978) - 1975
- [j11]Jack M. Stein, Vijay K. Bhargava, Stafford E. Tavares:
Weight distribution of some 'best' (3m, 2m) binary quasi-cyclic codes (Corresp.). IEEE Trans. Inf. Theory 21(6): 708-711 (1975) - 1974
- [j10]Vijay K. Bhargava, Stafford E. Tavares, Saligram G. S. Shiva:
Difference Sets of the Hadamard Type and Quasi-Cyclic Codes. Inf. Control. 26(4): 341-350 (1974) - [j9]Saligram G. S. Shiva, Stafford E. Tavares:
On binary majority-logic decodable codes (Corresp.). IEEE Trans. Inf. Theory 20(1): 131-133 (1974) - [j8]Stafford E. Tavares, Vijay K. Bhargava, Saligram G. S. Shiva:
Some rate- p/(p+1) quasi-cyclic codes (Corresp.). IEEE Trans. Inf. Theory 20(1): 133-135 (1974) - 1973
- [j7]Paul E. Allard, Saligram G. S. Shiva, Stafford E. Tavares:
A Note on the Decomposition of Cyclic Codes into Cyclic Classes. Inf. Control. 22(1): 100-106 (1973) - 1971
- [j6]Stafford E. Tavares, Paul E. Allard, Saligram G. S. Shiva:
On the Decomposition of Cyclic Codes into Cyclic Classes. Inf. Control. 18(4): 342-354 (1971) - 1970
- [j5]Stafford E. Tavares, M. Fukada:
Synchronization of a Class of Codes Derived from Cyclic Codes. Inf. Control. 16(2): 153-166 (1970) - [j4]Stafford E. Tavares, M. Fukada:
Further results on the synchronization of binary cyclic codes (Corresp.). IEEE Trans. Inf. Theory 16(2): 238-241 (1970) - [j3]Stafford E. Tavares, Saligram G. S. Shiva:
Detecting and correcting multiple bursts for binary cyclic codes (Corresp.). IEEE Trans. Inf. Theory 16(5): 643-644 (1970)
1960 – 1969
- 1969
- [j2]Stafford E. Tavares, M. Fukada:
Synchronization of Cyclic Codes in the Presence of Burst Errors. Inf. Control. 14(5): 423-441 (1969) - [j1]Stafford E. Tavares, M. Fukada:
Matrix approach to synchronization recovery for binary cyclic codes. IEEE Trans. Inf. Theory 15(1): 93-101 (1969)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
