Ian F. Blake
#154,209
Most Influential Person Now
Ian F. Blake's AcademicInfluence.com Rankings
Ian F. Blakemathematics Degrees
Mathematics
#7108
World Rank
#9729
Historical Rank
Number Theory
#229
World Rank
#293
Historical Rank
Measure Theory
#1873
World Rank
#2285
Historical Rank
Download Badge
Computer Science Mathematics
Why Is Ian F. Blake Influential?
(Suggest an Edit or Addition)Ian F. Blake's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Elliptic curves in cryptography (1999) (1904)
- Applications of Finite Fields (1992) (380)
- Introduction to the theory of error-correcting codes (1984) (352)
- Level-crossing problems for random processes (1973) (298)
- Algebraic-Geometry Codes (1998) (226)
- Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series) (2005) (213)
- Advances in Elliptic Curve Cryptography: Frontmatter (2005) (194)
- Low complexity normal bases (1989) (156)
- Strong Conditional Oblivious Transfer and Computing on Intervals (2004) (139)
- Codes Over Certain Rings (1972) (131)
- Codes over Integer Residue Rings (1975) (121)
- Finite Field Multiplier Using Redundant Representation (2002) (117)
- Group Codes for the Gaussian Channel (1975) (110)
- Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares (2010) (109)
- Elliptic Curves in Cryptography: Preface (1999) (107)
- The mathematical theory of coding (1975) (106)
- Coding with Permutations (1979) (102)
- New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases (1998) (101)
- Graphs with integral spectrum (2009) (86)
- Bit Serial Multiplication in Finite Fields (1990) (85)
- An Overview of Cryptography (2013) (82)
- Computing Logarithms in Finite Fields of Characteristic Two (1984) (82)
- Scalable, Server-Passive, User-Anonymous Timed Release Cryptography (2005) (79)
- On a class of processes arising in linear estimation theory (1968) (75)
- Refinements of Miller's algorithm for computing the Weil/Tate pairing (2006) (72)
- An Introduction to Applied Probability (1981) (70)
- On the Complete Weight Enumerator of Reed-Solomon Codes (1991) (61)
- Modeling burst channels using partitioned Fritchman's Markov models (1998) (60)
- Permutation Codes for Discrete Channels (1974) (60)
- Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions (2012) (56)
- Advances in Elliptic Curve Cryptography: Preface (2005) (48)
- Performance and Optimization of Amplify-and-Forward Cooperative Diversity Systems in Generic Noise and Interference (2011) (47)
- Permutation codes for discrete channels (Corresp.) (1974) (45)
- On the performance of fractal compression with clustering (1996) (43)
- Computational aspects of discrete logarithms (1996) (43)
- Scalable, Server-Passive, User-Anonymous Timed Release Public Key Encryption from Bilinear Pairing (2004) (42)
- Conditional Encrypted Mapping and Comparing Encrypted Numbers (2006) (42)
- Random Matrices and Codes for the Erasure Channel (2010) (41)
- Constructive problems for irreducible polynominals over finite fields (1993) (39)
- Hermitian codes as generalized Reed-Solomon codes (1992) (38)
- Performance Analysis of RFID Protocols: CDMA Versus the Standard EPC Gen-2 (2014) (38)
- Explicit factorization of $$x^{2^k }$$ + 1 overFp with primep≡3 mod 4 (1993) (38)
- Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials (1995) (36)
- An Introduction to Algebraic and Combinatorial Coding Theory (1976) (35)
- Enumeration of Markov chains and burst error statistics for finite state channel models (1999) (34)
- Construction and Distribution Problems for Irreducible Trinomials over Finite Fields (1996) (33)
- The capacity for a discrete-state code division multiple-access channel (1994) (31)
- Big Buckets Are (Are Not) Better! (1977) (30)
- New Classes of Partial Geometries and Their Associated LDPC Codes (2015) (30)
- Windowed Erasure Codes (2006) (30)
- Coding and Combinatorics (1975) (27)
- Probabilistic Analysis of Blocking Attack in RFID Systems (2011) (27)
- Trellis Complexity and Minimal Trellis Diagrams of Lattices (1998) (25)
- Probabilistic Analysis and Correction of Chen's Tag Estimate Method (2011) (23)
- Efficient Arithmetic in GF ( 2 n ) through Palindromic Representation (1998) (23)
- On the complexity of the discrete logarithm and Diffie-Hellman problems (2004) (22)
- Algebraic Coding Theory: History and Development (1982) (21)
- Addresses for graphs (1973) (21)
- Trellis complexity versus the coding gain of lattices I (1996) (20)
- Security Analysis and Complexity Comparison of Some Recent Lightweight RFID Protocols (2011) (20)
- Highly Regular Architectures for Finite Field Computation Using Redundant Basis (1999) (19)
- Nonadjacent Radix-τ Expansions of Integers in Euclidean Imaginary Quadratic Number Fields (2008) (18)
- Efficient algorithms for Koblitz curves over fields of characteristic three (2005) (18)
- Polynomials over Finite Fields and Applications (2006) (17)
- PROPERTIES OF RANDOM MATRICES AND APPLICATIONS (2006) (17)
- Trellis source codes designed by conjugate gradient optimization (1988) (17)
- A note on window tau-NAF algorithm (2005) (17)
- Majority logic decoding using combinatorial designs (Corresp.) (1975) (16)
- Arithmetic on an Elliptic Curve (1999) (16)
- One-round secure comparison of integers (2009) (16)
- Detection in multivariate non-Gaussian noise (1994) (16)
- The Leech Lattice as a Code for the Gaussian Channel (1971) (15)
- Elliptic Curves in Cryptography: Curve Examples (1999) (15)
- On the Security of the Digital Signature Algorithm (2002) (15)
- Communications and networks : a survey of recent advances (1986) (14)
- Computing Logarithms in GF(2n) (1985) (14)
- A note on complex sequences with low correlations (1982) (13)
- Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands (2018) (13)
- Complexity Issues for Public Key Cryptography (1988) (13)
- Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel (1993) (12)
- Normal and Self-dual Normal Bases from Factorization of c xq+1 + d xq - ax - b (1994) (12)
- Diversity and Coding for FH/MFSK Systems with Fading and Jamming - Part I: Multichannel Diversity (1987) (11)
- Concatenated coding performance for FSK modulation on time-correlated Rician fading channels (1998) (11)
- Computer security and protection structures (1977) (11)
- Efficient computations in finite fields with cryptographic significance (1999) (11)
- Rapid acquisition techniques in CDMA spread-spectrum systems (1984) (11)
- On Short Cycle Enumeration in Biregular Bipartite Graphs (2017) (10)
- Decentralized Coded Caching Without File Splitting (2017) (10)
- On the trellis complexity of root lattices and their duals (1999) (9)
- Communications and Networks (1986) (9)
- Approximations for the probability in the tails of the binomial distribution (1987) (9)
- On the mean number of encryptions for tree-based broadcast encryption schemes (2006) (9)
- Performance of multitone FFH/MFSK systems in the presence of jamming (1989) (9)
- Trellis source code design as an optimization problem (1988) (8)
- Specific irreducible polynomials with linearly independent roots over finite fields (1997) (8)
- An infinite class of generalized room squares (1975) (8)
- The linear random process (1968) (8)
- The Enumeration of Certain Run-Length Sequences (1982) (8)
- An optimization problem for unitary and orthogonal representations of finite groups (1972) (8)
- Sequence acquisition using bit estimation techniques (1984) (8)
- Curves, Codes and Cryptography (1998) (8)
- Elliptic Curves in Cryptography: Hyperelliptic Cryptosystems (1999) (8)
- On the Computation of Modular Polynomials for Elliptic Curves (7)
- Quasi-cyclic LDPC codes on Latin squares and the ranks of their parity-check matrices (2010) (7)
- Reducing Communication Overhead of Key Distribution Schemes for Wireless Sensor Networks (2007) (7)
- Multiparty Computation to Generate Secret Permutations (2007) (7)
- Non-interleaved Reed-Solomon coding performance on finite state channels (1997) (7)
- On the bit security of the Diffie-Hellman key (2005) (7)
- Trellis complexity versus the coding gain of lattices II (1996) (7)
- Configuration matrices of group codes (1974) (7)
- On the Trellis Complexity of the Densest Lattice Packings in Rn (1996) (7)
- A Probabilistic Approach for Detecting Blocking Attack in RFID Systems (2010) (6)
- Decoding complexity and trellis structure of lattices (1997) (6)
- Statistical distribution and collisions of VSH (2007) (6)
- Performance of Adaptive Transmission for FH/MFSK Signaling Over Jammed Fading Channels (1987) (6)
- Coding, diversity and minimum distance (1991) (6)
- Analytical modeling of RFID Generation-2 protocol using absorbing Markov chain theorem (2012) (6)
- LATTICES AND CRYPTOGRAPHY (2002) (6)
- Adaptive Delivery in Caching Networks (2016) (5)
- Error floors and finite geometries (2014) (5)
- Factoring Polynomials over Finite Fields (1993) (5)
- On a Generalization of the Pless Symmetry Codes (1975) (5)
- Two new decoding algorithms for Reed-Solomon codes (2005) (4)
- An algorithm for the design of generalized quantizers for detection (1990) (4)
- Elliptic Curves in Cryptography: Efficient Implementation of Elliptic Curves (1999) (4)
- Generalized t-Designs and Weighted Majority Decoding (1979) (4)
- Coding for frequency hopped spread spectrum satellite communications (1990) (4)
- Diversity and coding for FH/MFSK systems with fading and jamming. II. Selective diversity (1989) (4)
- Introduction to Finite Fields and Bases (1993) (4)
- Coding for slow frequency hopped differential phase shift keying (1990) (4)
- Error Control Coding (S. Lin and D. J. Costello; 2004) [book review] (2005) (4)
- On the enumeration of dyadic distributions (1993) (3)
- Polynomial approximation of bilinear Diffie-Hellman maps (2008) (3)
- Trellis complexity versus coding gain of lattice-based communication systems (1995) (3)
- Coding for Adder Channels (1994) (3)
- Codes and Designs (1979) (3)
- Analysis of the capacity for a Markovian multiple access channel (1993) (3)
- 3 – Coding and Combinatorics (1976) (3)
- Detector relative efficiency analysis in non-gaussian noise☆ (1988) (3)
- An area efficient surviving paths unit for the Viterbi algorithm (1999) (3)
- Construction of Extended Steiner Systems for Information Retrieval (2008) (3)
- Performance and Optimization of Cooperative Diversity Systems in Generic Noise and Interference 1 (2010) (3)
- A note on generalized Room squares (1978) (3)
- An adaptive rate algorithm for FH/BFSK signaling (1988) (3)
- Elliptic Curve Cryptosystems (1993) (3)
- Efficient computation of multiple points for elliptic curve cryptosystems (1998) (3)
- Minimal trellis diagrams of lattices (1997) (2)
- A construction method for generalized room squares (1975) (2)
- A construction method for generalized Room squares (1975) (2)
- Elliptic Curves in Cryptography: The Elliptic Curve Discrete Logarithm Problem (1999) (2)
- Combinatorial aspects of orthogonal parity checks (Corresp.) (1976) (2)
- Performance of Nonorthogonal Signaling on an Asynchronous Multiple Access On-Off Channel (1982) (2)
- Curves with Many Points and Their Applications (1999) (2)
- Trellis complexity versus the coding gain of lattices (1995) (2)
- Decoding the binary Golay code with miracle octad generators (Corresp.) (1978) (2)
- Low complexity parallel multiplier in F(q/sup n/) over F/sub q/ (2002) (2)
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface (2007) (2)
- On the solutions of an elliptic curve over a field of characteristic two (1998) (2)
- Mixed-Q linear space-time codes (2006) (2)
- On products of graphs for LDPC codes (2003) (1)
- Conditionally Verifiable Signatures (2005) (1)
- Finite Fields and Coding Theory (1975) (1)
- A perspective on coding theory (1991) (1)
- Basic coding properties and bounds (2013) (1)
- On the extendability of steiner t‐designs (1993) (1)
- The Discrete Logarithm Problem (1993) (1)
- Fast parallel algorithms for decoding Reed-Solomon codes (1994) (1)
- Linear filtering and piecewise linear correlation functions (1969) (1)
- Schoof's Algorithm and Extensions (1999) (1)
- Normal basis of the finite field F2(p-1)pm over F2 (1997) (1)
- Elliptic Curves over Finite Fields (1993) (1)
- A transform property of Kloosterman sums (2010) (1)
- Elliptic Curves in Cryptography: Introduction (1999) (1)
- 1 – Finite Fields and Coding Theory (1976) (1)
- Introduction to Algebraic Geometry (1993) (1)
- Low Complexity Parallel Multiplier in Over (2002) (1)
- of Group Codes (1974) (0)
- Low Density Parity Check Codes (2006) (0)
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (1993) (0)
- 5 – Group Representations (1975) (0)
- On the recoverability parameter for subset batch codes (2007) (0)
- Elliptic Curves in Cryptography: Finite Field Arithmetic (1999) (0)
- Algorithms and architectures for error-correction codes (1996) (0)
- Combinatorial Constructions and Coding (1975) (0)
- A note on diagonal and Hermitian surfaces (2014) (0)
- Construction of Irreducible Polynomials (1993) (0)
- Raptor codes (2013) (0)
- New family of binary one-step majority-logic decodable codes (1991) (0)
- New upper bounds on trellis complexity of lattices (1997) (0)
- A new modulation scheme for space-time codes (2005) (0)
- Multilevel codes based on matrix completion (1995) (0)
- Decoding Ag-codes and Let W Be a Vector Having Acknowledgments Decoding Ag-codes (2007) (0)
- Review of 'Introduction to the Theory of Error-Correcting codes' (Pless, V.; 1982) (1983) (0)
- VSH and multiplicative modular relations between small primes with polynomial exponents (2014) (0)
- Codes From Algebraic Geometry (1993) (0)
- Errors and erasures decoding for interference channels (1984) (0)
- Linear Filtering and Piecewise Correlation Functions Linear (1969) (0)
- Diversity and coding for an interference model (1989) (0)
- On the zeta functions of two towers of function fields (2004) (0)
- Advances in Elliptic Curve Cryptography: Bibliography (2005) (0)
- Coding for Interference Channels (1986) (0)
- A New Remainder Based Decoding Algorithm for Reed-Solomon Codes (1993) (0)
- Cu r ve s with M a ny Points an d Th e ir A p p lic ation s (1999) (0)
- The Structure of Semisimple Rings (1975) (0)
- LDPC and Gallager codes over finite fields (2013) (0)
- Determining the Group Order (1999) (0)
- Advances in Elliptic Curve Cryptography: Summary of Major LNCS Proceedings (2005) (0)
- A note on Kloosterman sums and its application (2008) (0)
- Higher dimensional varieties in coding theory (2015) (0)
- Low Complexity Linear Space-Time Codes (2004) (0)
- Combinatorial designs formed by patterns of subsets provide insight into the existence of useful codes. (2016) (0)
- Error Control Coding (2005) (0)
- 2 – Combinatorial Constructions and Coding (1976) (0)
- Speeding Up RSA and Elliptic Curve Systems by Choosing Suitable Moduli (2004) (0)
- REVIEWS AND DESCRIPTIONS OF TABLES AND BOOKS (2001) (0)
- Coding Cor InterCerence Channels (1986) (0)
- VSH and multiplicative modular relations between small primes with polynomial exponents (2014) (0)
- Abelian varieties in coding and cryptography (2010) (0)
- Erratum: New family of binary one-step majority-logic decodable codes (1991) (0)
- Conditionally Verifiable Signature (2006) (0)
- Elliptic Curves in Cryptography: Other Applications of Elliptic Curves (1999) (0)
- On an inverse for sections of a binomial matrix (1978) (0)
- Algebraic-geometry codes (invited paper) (2000) (0)
- Generating Curves using Complex Multiplication (1999) (0)
- Space-time codes with triangular core (2004) (0)
- Diversity Analysis for Frequency-Selective MlMO-OFDM Systems With General Spatial and Temporal Correlation Model (2006) (0)
- A note on diagonal and Hermitian hypersurfaces (2016) (0)
- Space-time codes from property-L (2004) (0)
- Review of 'Source and Channel Coding: An Algorithmic Approach' (Anderson, J.B., and Mohan, S.; 1991) (1994) (0)
- Error Floors and Finite Geometries (Invited Paper) (2014) (0)
- Expander graphs and codes (2003) (0)
- Guest Editorial: Special Issue in Honor of Scott A. Vanstone (2015) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Ian F. Blake?
Ian F. Blake is affiliated with the following schools:
