I. Blake

发表

Computing Logarithms in Finite Fields of Characteristic Two

S. Vanstone, I. Blake, R. Fuji-Hara, 1984 .

Applications of Finite Fields

A. Menezes, I. Blake, 1992 .

Group Codes for the Gaussian Channel

I. Blake, R. Mullin, 1975 .

Elliptic Curves in Cryptography: Efficient Implementation of Elliptic Curves

G. Seroussi, N. Smart, I. Blake, 1999 .

Elliptic Curves in Cryptography: Hyperelliptic Cryptosystems

G. Seroussi, N. Smart, I. Blake, 1999 .

Elliptic Curves in Cryptography: The Elliptic Curve Discrete Logarithm Problem

G. Seroussi, N. Smart, I. Blake, 1999 .

Elliptic Curves in Cryptography: Preface

Nigel P. Smart, I. Blake, G. Seroussi, 1999 .

An Introduction to Algebraic and Combinatorial Coding Theory

I. Blake, R. Mullin, 1976 .

Level-crossing problems for random processes

Ian F. Blake, William C. Lindsey, I. Blake, 1973, IEEE Trans. Inf. Theory.

Arithmetic on an Elliptic Curve

G. Seroussi, N. Smart, I. Blake, 1999 .

3 – Coding and Combinatorics

I. Blake, 1976 .

Trellis source codes designed by conjugate gradient optimization

Jon W. Mark, Ian F. Blake, George H. Freeman, 1988, IEEE Trans. Commun..

Factoring Polynomials over Finite Fields

S. Vanstone, I. Blake, R. Mullin, 1993 .

LATTICES AND CRYPTOGRAPHY

I. Blake, 2002 .

Decoding complexity and trellis structure of lattices

I. Blake, A. Banihashemi, 1997 .

Curves, Codes and Cryptography

I. Blake, 1998 .

Codes From Algebraic Geometry

S. Vanstone, I. Blake, R. Mullin, 1993 .

Introduction to Finite Fields and Bases

S. Vanstone, I. Blake, R. Mullin, 1993 .

New family of binary one-step majority-logic decodable codes

I. Blake, Chen Zhi, 1991 .

Codes and Designs

I. Blake, 1979 .

Construction and Distribution Problems for Irreducible Trinomials over Finite Fields

I. Blake, Shuhong Gao, R. Lambert, 1996 .

Algebraic Coding Theory: History and Development

I. Blake, 1982 .

Polynomials over Finite Fields and Applications

Ian F. Blake, Daniel Panario, Stephen D. Cohen, 2006 .

Elliptic Curves in Cryptography: Curve Examples

Nigel P. Smart, I. Blake, G. Seroussi, 1999 .

Decoding Ag-codes and Let W Be a Vector Having Acknowledgments Decoding Ag-codes

U. Vazirani, M. Sudan, I. Blake, 2007 .

On the recoverability parameter for subset batch codes

I. Blake, E. C. Park, 2007 .

PROPERTIES OF RANDOM MATRICES AND APPLICATIONS

IAN F. BLAKE, I. Blake, C. Studholme, 2006 .

Efficient Arithmetic in GF ( 2 n ) through Palindromic Representation

G. Seroussi, I. Blake, R. Roth, 1998 .

Computational aspects of discrete logarithms

I. Blake, R. Lambert, 1996 .

Minimal trellis diagrams of lattices

I. Blake, A. Banihashemi, 1997, Proceedings of IEEE International Symposium on Information Theory.

Elliptic Curves over Finite Fields

S. Vanstone, I. Blake, R. Mullin, 1993 .

Approximations for the probability in the tails of the binomial distribution

Ian F. Blake, H. Darabian, I. Blake, 1987, IEEE Trans. Inf. Theory.

The linear random process

I. F. Blake, J. B. Thomas, J. Thomas, 1968 .

Cu r ve s with M a ny Points an d Th e ir A p p lic ation s

I. Blake, 1999 .

The Discrete Logarithm Problem

Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone, 1993 .

A note on Kloosterman sums and its application

I. Blake, T. Garefalakis, 2008, 2008 Information Theory and Applications Workshop.

Construction of Irreducible Polynomials

S. Vanstone, I. Blake, R. Mullin, 1993 .

On the mean number of encryptions for tree-based broadcast encryption schemes

I. Blake, E. C. Park, 2006, J. Discrete Algorithms.

Linear Filtering and Piecewise Correlation Functions Linear

I. Blake, 1969 .

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Hsinchun Chen, Daniel Zeng, David Madigan, 2007, KDD 2013.

An Introduction to Applied Probability

I. Blake, 1981 .

Codes and Designs

I. Blake, 1979 .

Low complexity parallel multiplier in F(q/sup n/) over F/sub q/

I. Blake, M. Hasan, Huapeng Wu, 2002 .

Advances in Elliptic Curve Cryptography: Preface

Ian F. Blake, Gadiel Seroussi, Nigel P. Smart, 2005 .

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Stefan Katzenbeisser, L. Jean Camp, Michael K. Reiter, 2007, Knowledge Discovery and Data Mining.

Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)

Nigel P. Smart, I. Blake, J. W. S. Cassels, 2005 .

Elliptic Curve Cryptosystems

S. Vanstone, I. Blake, R. Mullin, 1993 .

Expander graphs and codes

Kenneth W. Shum, Ian F. Blake, K. Shum, 2003, Algebraic Coding Theory and Information Theory.

Communications and Networks

Ian F. Blake, H. Vincent Poor, H. Poor, 1986 .

LDPC and Gallager codes over finite fields

Ian F. Blake, W. Cary Huffman, I. Blake, 2013, Handbook of Finite Fields.

Coding Cor InterCerence Channels

Ian F. Blake, I. Blake, 1986 .

A note on generalized Room squares

Ian F. Blake, J. J. Stiffler, I. Blake, 1978, Discret. Math..

A construction method for generalized room squares

I. Blake, J. Stiffler, 1975 .

Coding for frequency hopped spread spectrum satellite communications

T. Aaron Gulliver, Ian F. Blake, Vijay K. Bhargava, 1990 .

Raptor codes

Ian F. Blake, W. Cary Huffman, I. Blake, 2013, Handbook of Finite Fields.

Combinatorial designs formed by patterns of subsets provide insight into the existence of useful codes.

Ian F. Blake, I. Blake, 2016 .

An Overview of Cryptography

Ian F. Blake, Vincent Wai Sum Wong, Ehsan Vahedi, 2013 .

Basic coding properties and bounds

Ian F. Blake, W. Cary Huffman, I. Blake, 2013, Handbook of Finite Fields.

A note on diagonal and Hermitian surfaces pdf

Ian F. Blake, V. Kumar Murty, Hamid Usefi, 2014, ArXiv.

Computer security and protection structures

Ian F. Blake, Bruce James Walker, I. Blake, 1977 .

Review of 'Introduction to the Theory of Error-Correcting codes' (Pless, V.; 1982)

Ian F. Blake, I. Blake, 1983, IEEE Transactions on Information Theory.

Specific irreducible polynomials with linearly independent roots over finite fields

Ian F. Blake, Shuhong Gao, Ronald C. Mullin, 1997 .

Linear filtering and piecewise linear correlation functions

Ian F. Blake, I. Blake, 1969, IEEE Trans. Inf. Theory.

Trellis complexity versus the coding gain of lattices II

Vahid Tarokh, Ian F. Blake, V. Tarokh, 1996, IEEE Trans. Inf. Theory.

Advances in Elliptic Curve Cryptography: Bibliography

Ian F. Blake, Gadiel Seroussi, Nigel P. Smart, 2005 .

Review of 'Source and Channel Coding: An Algorithmic Approach' (Anderson, J.B., and Mohan, S.; 1991)

Ian F. Blake, I. Blake, 1994, IEEE Trans. Inf. Theory.

Advances in Elliptic Curve Cryptography: Summary of Major LNCS Proceedings

Ian F. Blake, Gadiel Seroussi, Nigel P. Smart, 2005 .

Trellis complexity versus coding gain of lattice-based communication systems

Vahid Tarokh, Ian F. Blake, V. Tarokh, 1995 .

Permutation Codes for Discrete Channels

Ian F. Blake, I. Blake, 1974 .

Constructive problems for irreducible polynominals over finite fields

Ian F. Blake, Shuhong Gao, Robert J. Lambert, 1993, Information Theory and Applications.

On the Computation of Modular Polynomials for Elliptic Curves

G. Seroussi, J. Csirik, I. Blake, 2022 .

Schoof's Algorithm and Extensions

Nigel P. Smart, I. Blake, G. Seroussi, 1999 .

Efficient Arithmetic in GF ( 2 n ) through Palindromic Representation

G. Seroussi, I. Blake, R. Roth, 1998 .

On the extendability of steiner t‐designs

I. Blake, A. Baartmans, V. Tonchev, 1993 .

Guest Editorial: Special Issue in Honor of Scott A. Vanstone

Douglas R Stinson, A. Menezes, I. Blake, 2015, Des. Codes Cryptogr..

Detector relative efficiency analysis in non-gaussian noise☆

Benny C. Y. Wong, I. Blake, 1988 .

Multiparty Computation to Generate Secret Permutations

Ian F. Blake, Chris Studholme, I. Blake, 2007, IACR Cryptol. ePrint Arch..

Conditionally Verifiable Signatures

Ian F. Blake, Aldar C.-F. Chan, I. Blake, 2005, IACR Cryptol. ePrint Arch..

On a class of processes arising in linear estimation theory

Ian F. Blake, John B. Thomas, John B. Thomas, 1968, IEEE Trans. Inf. Theory.

Elliptic curves in cryptography

Ian F. Blake, Nigel P. Smart, G. Seroussi, 1999 .

Introduction to the theory of error-correcting codes

I.F. Blake, I. Blake, 1984, Proceedings of the IEEE.

Quasi-cyclic LDPC codes on Latin squares and the ranks of their parity-check matrices

Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar, 2010, 2010 Information Theory and Applications Workshop (ITA).

Algebraic-Geometry Codes

Ian F. Blake, Chris Heegard, Tom Høholdt, 1998, IEEE Trans. Inf. Theory.

Hermitian codes as generalized Reed-Solomon codes

Ian F. Blake, Tomik Yaghoobian, I. Blake, 1992, Des. Codes Cryptogr..

Performance Analysis of RFID Protocols: CDMA Versus the Standard EPC Gen-2

Rabab Kreidieh Ward, Ian F. Blake, Ehsan Vahedi, 2014, IEEE Transactions on Automation Science and Engineering.

Reducing Communication Overhead of Key Distribution Schemes for Wireless Sensor Networks

Ian F. Blake, E. C. Park, I. Blake, 2007, 2007 16th International Conference on Computer Communications and Networks.

Detection in multivariate non-Gaussian noise

Ian F. Blake, Benny C. Y. Wong, I. Blake, 1994, IEEE Trans. Commun..

On the complexity of the discrete logarithm and Diffie-Hellman problems

Ian F. Blake, Theodoulos Garefalakis, I. Blake, 2004, J. Complex..

Coding for Interference Channels

Ian F. Blake, I. Blake, 1986 .

Speeding Up RSA and Elliptic Curve Systems by Choosing Suitable Moduli

I. Blake, Huapeng Wu, M. A. Hasan, 2004 .

Finite Field Multiplier Using Redundant Representation

Ian F. Blake, M. Anwar Hasan, Shuhong Gao, 2002, IEEE Trans. Computers.

Highly Regular Architectures for Finite Field Computation Using Redundant Basis

Ian F. Blake, M. Anwar Hasan, Huapeng Wu, 1999, CHES.

Modeling burst channels using partitioned Fritchman's Markov models

Cecilio Pimentel, I. F. Blake, I. Blake, 1998 .

New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases

M.A. Hasan, H. Wu, I.F. Blake, 1998, IEEE Trans. Computers.

New Classes of Partial Geometries and Their Associated LDPC Codes

Qiuju Diao, Shu Lin, Ian F. Blake, 2015, IEEE Transactions on Information Theory.

Advances in Elliptic Curve Cryptography: Frontmatter

Ian F. Blake, Gadiel Seroussi, Nigel P. Smart, 2005 .

Curves with Many Points and Their Applications

Ian F. Blake, I. Blake, 1999, AAECC.

Conditionally Verifiable Signature

Ian F. Blake, Aldar C.-F. Chan, I. Blake, 2006, INDOCRYPT.

Trellis Complexity and Minimal Trellis Diagrams of Lattices

Ian F. Blake, Amir H. Banihashemi, I. Blake, 1998, IEEE Trans. Inf. Theory.

Finite Fields and Coding Theory

I. Blake, R. Mullin, 1975 .

On Short Cycle Enumeration in Biregular Bipartite Graphs

Shu Lin, Ian F. Blake, Shu Lin, 2017, IEEE Transactions on Information Theory.

Coding with Permutations

Gérard D. Cohen, Ian F. Blake, Mikhail Deza, 1979, Inf. Control..

Graphs with integral spectrum

Noga Alon, Igor E. Shparlinski, Ian F. Blake, 2009 .

Error floors and finite geometries

Qiuju Diao, Shu Lin, Ian F. Blake, 2014, 2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

Coding and Combinatorics

Ian F. Blake, Ronald C. Mullin, I. Blake, 1975 .

A transform property of Kloosterman sums

Ian F. Blake, Theodoulos Garefalakis, I. Blake, 2010, Discret. Appl. Math..

On the solutions of an elliptic curve over a field of characteristic two

G. Seroussi, I. Blake, R. Roth, 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

Explicit factorization of $$x^{2^k }$$ + 1 overFp with primep≡3 mod 4

Ian F. Blake, Shuhong Gao, Ronald C. Mullin, 1993, Applicable Algebra in Engineering, Communication and Computing.

Complexity Issues for Public Key Cryptography

Ian F. Blake, Paul C. van Oorschot, Scott A. Vanstone, 1988 .

Performance and Optimization of Amplify-and-Forward Cooperative Diversity Systems in Generic Noise and Interference

Robert Schober, Ian F. Blake, Amir Nasri, 2011, IEEE Transactions on Wireless Communications.

Statistical distribution and collisions of VSH

Igor E. Shparlinski, Ian F. Blake, I. Blake, 2007, J. Math. Cryptol..

Scalable, Server-Passive, User-Anonymous Timed Release Public Key Encryption from Bilinear Pairing

Ian F. Blake, Aldar C.-F. Chan, I. Blake, 2004, IACR Cryptol. ePrint Arch..

Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares

Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar, 2010, IEEE Transactions on Communications.

Scalable, Server-Passive, User-Anonymous Timed Release Cryptography

Ian F. Blake, Aldar C.-F. Chan, I. Blake, 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

Refinements of Miller's algorithm for computing the Weil/Tate pairing

Ian F. Blake, Guangwu Xu, V. Kumar Murty, 2006, J. Algorithms.

Random Matrices and Codes for the Erasure Channel

Ian F. Blake, Chris Studholme, I. Blake, 2010, Algorithmica.

Low Density Parity Check Codes

I. Blake, 2006 .

Windowed Erasure Codes

Ian F. Blake, Chris Studholme, I. Blake, 2006, 2006 IEEE International Symposium on Information Theory.

Error Floors and Finite Geometries (Invited Paper)

Qiuju Diao, Ian Blake, Shu Lin, 2014 .

An algorithm for the design of generalized quantizers for detection

Ian F. Blake, Benny C. Y. Wong, I. Blake, 1990, IEEE Trans. Commun..

Decentralized Coded Caching Without File Splitting

Ian F. Blake, Lutz Lampe, Seyed Ali Saberali, 2017, IEEE Transactions on Wireless Communications.

Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands

I. Blake, L. Lampe, S. A. Saberali, 2018, IEEE Transactions on Information Theory.

Adaptive Delivery in Caching Networks

Lutz H.-J. Lampe, Ian F. Blake, Hamidreza Ebrahimzadeh Saffar, 2016, IEEE Communications Letters.

Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel

I. Blake, S. Bross, I.F. Blake, 1993, Proceedings. IEEE International Symposium on Information Theory.

Nonadjacent Radix-τ Expansions of Integers in Euclidean Imaginary Quadratic Number Fields

Ian F. Blake, Guangwu Xu, I. Blake, 2008, Canadian Journal of Mathematics.

A note on window tau-NAF algorithm

Ian F. Blake, Guangwu Xu, V. Kumar Murty, 2005, Inf. Process. Lett..

Efficient algorithms for Koblitz curves over fields of characteristic three

Ian F. Blake, Guangwu Xu, V. Kumar Murty, 2005, J. Discrete Algorithms.

On the bit security of the Diffie-Hellman key

Igor E. Shparlinski, Ian F. Blake, Theodoulos Garefalakis, 2005, Applicable Algebra in Engineering, Communication and Computing.

On the Security of the Digital Signature Algorithm

Ian F. Blake, Theodoulos Garefalakis, I. Blake, 2002, Des. Codes Cryptogr..

Enumeration of Markov chains and burst error statistics for finite state channel models

Cecilio Pimentel, I. F. Blake, I. Blake, 1999 .

Abelian varieties in coding and cryptography

Ian F. Blake, I. Blake, 2010, 2010 IEEE Information Theory Workshop.

Low complexity normal bases

Ian F. Blake, Scott A. Vanstone, David W. Ash, 1989, Discret. Appl. Math..

Computing Logarithms in GF(2n)

Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone, 1985, CRYPTO.

Sequence acquisition using bit estimation techniques

Gordon L. Stüber, Jon W. Mark, Ian F. Blake, 1984, Inf. Sci..

On products of graphs for LDPC codes

Shu Lin, Ian F. Blake, Jun Xu, 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

Introduction to Algebraic Geometry

S. Vanstone, I. Blake, R. Mullin, 1993 .

The Enumeration of Certain Run-Length Sequences

Ian F. Blake, I. Blake, 1982, Inf. Control..

Strong Conditional Oblivious Transfer and Computing on Intervals

Ian F. Blake, Vladimir Kolesnikov, I. Blake, 2004, ASIACRYPT.