Seroussi, G. (Gadiel) 1955
Overview
Works:  53 works in 100 publications in 4 languages and 1,932 library holdings 

Roles:  Author, Editor, 958, Opponent 
Classifications:  QA76.9.A25, 005.82 
Publication Timeline
.
Most widely held works by
G Seroussi
Elliptic curves in cryptography by
Ian F Blake(
)
22 editions published between 1999 and 2006 in English and Italian and held by 1,217 WorldCat member libraries worldwide
Elliptic curve cryptography is a major challenger to the dominant RSA/DSA systems, with increased speed, less memory required and smaller key sizes. This book summarises knowledge built up within Hewlett Packard over a number of years
22 editions published between 1999 and 2006 in English and Italian and held by 1,217 WorldCat member libraries worldwide
Elliptic curve cryptography is a major challenger to the dominant RSA/DSA systems, with increased speed, less memory required and smaller key sizes. This book summarises knowledge built up within Hewlett Packard over a number of years
Advances in elliptic curve cryptography(
)
15 editions published between 2004 and 2007 in English and Undetermined and held by 631 WorldCat member libraries worldwide
Since the appearance of the authors' first volume on elliptic curve cryptography in 1999 there has been tremendous progress in the field. This second volume addresses these advances and brings the reader up to date. Prominent contributors to the research literature in these areas have provided articles that reflect the current state of these important topics
15 editions published between 2004 and 2007 in English and Undetermined and held by 631 WorldCat member libraries worldwide
Since the appearance of the authors' first volume on elliptic curve cryptography in 1999 there has been tremendous progress in the field. This second volume addresses these advances and brings the reader up to date. Prominent contributors to the research literature in these areas have provided articles that reflect the current state of these important topics
Advances in Elliptic Curve Cryptography by
Ian F Blake(
)
1 edition published in 2005 in English and held by 7 WorldCat member libraries worldwide
Since the appearance of the authors' first volume on elliptic curve cryptography in 1999 there has been tremendous progress in the field. In some topics, particularly point counting, the progress has been spectacular. Other topics such as the Weil and Tate pairings have been applied in new and important ways to cryptographic protocols that hold great promise. Notions such as provable security, side channel analysis and the Weil descent technique have also grown in importance. This second volume addresses these advances and brings the reader up to date. Prominent contributors to the research li
1 edition published in 2005 in English and held by 7 WorldCat member libraries worldwide
Since the appearance of the authors' first volume on elliptic curve cryptography in 1999 there has been tremendous progress in the field. In some topics, particularly point counting, the progress has been spectacular. Other topics such as the Weil and Tate pairings have been applied in new and important ways to cryptographic protocols that hold great promise. Notions such as provable security, side channel analysis and the Weil descent technique have also grown in importance. This second volume addresses these advances and brings the reader up to date. Prominent contributors to the research li
A symbolic derivation of Betasplines of arbitrary order by
G Seroussi(
Book
)
1 edition published in 1991 in English and held by 7 WorldCat member libraries worldwide
In this paper, we present a symbolic derivation of the Beta polynomials as polynomials over the field K[subscript n] of real rational functions in the indeterminates [beta][subscript s;i]. We prove, constructively, the existence and uniqueness of Betapolynomials satisfying the design objectives of geometric continuity, minimum spline order, invariance under translation, and linear independence, and we present an explicit symbolic procedure for their computation. The initial derivation, and the resulting procedure, are valid for the general case of discretelyshaped Betasplines of arbitrary order, over uniform knot sequences
1 edition published in 1991 in English and held by 7 WorldCat member libraries worldwide
In this paper, we present a symbolic derivation of the Beta polynomials as polynomials over the field K[subscript n] of real rational functions in the indeterminates [beta][subscript s;i]. We prove, constructively, the existence and uniqueness of Betapolynomials satisfying the design objectives of geometric continuity, minimum spline order, invariance under translation, and linear independence, and we present an explicit symbolic procedure for their computation. The initial derivation, and the resulting procedure, are valid for the general case of discretelyshaped Betasplines of arbitrary order, over uniform knot sequences
Application of finite fields to memory interleaving by
Abraham Lempel(
Book
)
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
Abstract: "A hashing scheme for memory interleaving, based on the properties of finite field exponentiation is presented. The scheme maps sequences of lbit addresses to sequences of mbit memory module numbers, with m <l. For input sequences that are in arithmetic progression, the output sequence has a provably uniform distribution on the average, and no 'pathologies' for a prescribed range of strides in the input sequence. We prove bounds on the lengths of runs in the output sequence, and prove the surprising result that when m/l is bounded away from both 0 and 1, the run length can be bounded by a constant. The proposed scheme is highly amenable to fast systolic implementation."
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
Abstract: "A hashing scheme for memory interleaving, based on the properties of finite field exponentiation is presented. The scheme maps sequences of lbit addresses to sequences of mbit memory module numbers, with m <l. For input sequences that are in arithmetic progression, the output sequence has a provably uniform distribution on the average, and no 'pathologies' for a prescribed range of strides in the input sequence. We prove bounds on the lengths of runs in the output sequence, and prove the surprising result that when m/l is bounded away from both 0 and 1, the run length can be bounded by a constant. The proposed scheme is highly amenable to fast systolic implementation."
Daen kyokusen angō(
Book
)
2 editions published in 2001 in Japanese and held by 3 WorldCat member libraries worldwide
2 editions published in 2001 in Japanese and held by 3 WorldCat member libraries worldwide
Locationcorrecting codes by
Ron M Roth(
Book
)
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We study codes over GF(q) that can correct t channel errors assuming the error values are known. This is a counterpart to the wellknown problem of erasure correction, where error values are found assuming the locations are known. The correction capabilities of these so called tlocation correcting codes (tLCCs) are characterized by a new metric, the decomposability distance, which plays a role analogous to that of the Hamming metric in conventional errorcorrecting codes (ECCs). Based on the new metric, we prove bounds on the parameters of tLCCs that are counterparts to the classical Singleton, sphere packing and GilbertVarshamov bounds for ECCs. In particular, we show examples of perfect LCCs, and we study optimal (MDSlike) LCCs that attain the Singletontype bound on the redundancy. We show that these optimal codes are generally much shorter than their erasure (or conventional ECC) analogues: The length n of any tLCC that attains the Singletontype bound for t> 1 is bounded from above by t + O([square root of q]), compared to length q+1 which is attainable in the conventional ECC case. We show constructions of optimal tLCCs for t [element of] [1,2,n2,n1,n] that attain the asymptotic length upper bounds, and constructions for other values of t that are optimal, yet their lengths fall short of the upper bounds. The resuling asymptotic gap remains an open research problem. All the constructions presented can be efficiently decoded."
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We study codes over GF(q) that can correct t channel errors assuming the error values are known. This is a counterpart to the wellknown problem of erasure correction, where error values are found assuming the locations are known. The correction capabilities of these so called tlocation correcting codes (tLCCs) are characterized by a new metric, the decomposability distance, which plays a role analogous to that of the Hamming metric in conventional errorcorrecting codes (ECCs). Based on the new metric, we prove bounds on the parameters of tLCCs that are counterparts to the classical Singleton, sphere packing and GilbertVarshamov bounds for ECCs. In particular, we show examples of perfect LCCs, and we study optimal (MDSlike) LCCs that attain the Singletontype bound on the redundancy. We show that these optimal codes are generally much shorter than their erasure (or conventional ECC) analogues: The length n of any tLCC that attains the Singletontype bound for t> 1 is bounded from above by t + O([square root of q]), compared to length q+1 which is attainable in the conventional ECC case. We show constructions of optimal tLCCs for t [element of] [1,2,n2,n1,n] that attain the asymptotic length upper bounds, and constructions for other values of t that are optimal, yet their lengths fall short of the upper bounds. The resuling asymptotic gap remains an open research problem. All the constructions presented can be efficiently decoded."
Vector sets for exhaustive testing of logic circuits by
G Seroussi(
Book
)
2 editions published in 1986 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1986 in English and held by 3 WorldCat member libraries worldwide
Systematic derivation of spline bases by
HewlettPackard Laboratories(
Book
)
3 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
Krzywe eliptyczne w kryptografii by
Ian F Blake(
Book
)
1 edition published in 2004 in Polish and held by 2 WorldCat member libraries worldwide
1 edition published in 2004 in Polish and held by 2 WorldCat member libraries worldwide
On cyclic MDS codes of length q over GF(q) by
Ron M Roth(
Book
)
1 edition published in 1984 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1984 in English and held by 2 WorldCat member libraries worldwide
On generator matrices of MDS codes by
Ron M Roth(
Book
)
2 editions published in 1984 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1984 in English and held by 2 WorldCat member libraries worldwide
Elliptic curves and cryptography by
Ian F Blake(
Book
)
2 editions published in 1999 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1999 in English and held by 2 WorldCat member libraries worldwide
On MDS extensions of generalized ReedSolomon codes by
G Seroussi(
Book
)
1 edition published in 1985 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1985 in English and held by 2 WorldCat member libraries worldwide
Generalizations of the normal basis theorem of finite fields by
Nader H Bshouty(
Book
)
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
On the complexity of multiplication in finite fields by
Makhon ṭekhnologi leYiśraʼel Ṭekhniyon(
Book
)
2 editions published in 1981 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1981 in English and held by 2 WorldCat member libraries worldwide
Encoding and decoding of BCH codes using light and short codewords by R.M Roth(
Book
)
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
Sequential prediction and ranking in universal context modeling and data compression by
HewlettPackard Laboratories(
Book
)
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
On MDS extensions of generalized ReedSolomon codes by
G Seroussi(
Book
)
1 edition published in 1985 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1985 in English and held by 2 WorldCat member libraries worldwide
Explicit formulas for selfcomplementary normal bases in certain finite fields by
HewlettPackard Laboratories(
Book
)
2 editions published in 1990 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1990 in English and held by 2 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Blake, Ian F. Author Editor Creator
 Smart, Nigel P. (Nigel Paul) 1967 Editor
 HewlettPackard Laboratories
 Roth, Ron M. Author
 Weinberger, Marcelo J. Author
 Barsky, Brian A. 1954
 Lempel, A. Author
 Lempel, Abraham Author
 London Mathematical Society
 Roth, R.M. Author