Guest editorial: Special issue in honor of Scott A. Vanstone
From MaRDI portal
Publication:887413
DOI10.1007/s10623-015-0106-2zbMath1323.00055OpenAlexW2177905199WikidataQ56340549 ScholiaQ56340549MaRDI QIDQ887413
No author found.
Publication date: 26 October 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0106-2
Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Codes based on complete graphs
- Existence results for doubly near resolvable \((v,3,2)\)-BIBDs
- Hanani triple systems
- Asymptotic properties of locally extensible designs
- On primitive polynomials over finite fields
- On the chromatic index of a finite projective space
- The existence of skew Howell designs of side 2n and order \(2n+2\)
- On splitting sets in block designs and finding roots of polynomials
- Balanced tournament designs and resolvable (v,3,2)-BIBDs
- Low complexity normal bases
- A Kirkman square of order 51 and block size 3
- On strong starters in cyclic groups
- Elliptic semiplanes and group divisible designs with orthogonal resolutions
- Orthogonal packings in PG(5,2)
- Existence results for \(KS_ 3(v;2,4)s\)
- Designs with mutually orthogonal resolutions
- The existence of orthogonal resolutions of lines in AG(n,q)
- Hyperplane skew resolutions and their applications
- On resolvable designs \(S_ 3(3;4,v)\)
- Coverings of pairs by quintuples
- Conical embeddings of Steiner systems
- On designs (22,33,12,8,4)
- Optimal normal bases in \(GF(p^ n)\)
- Orthogonal resolutions in odd balanced tournament designs
- Doubly resolvable designs from generalized Bhaskar Rao designs
- Doubly resolvable designs
- On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays
- Transversal designs and doubly-resolvable designs
- On the existence of frames
- The existence of Howell designs of side n+1 and order 2n
- Isomorphism of strong starters in cyclic groups
- The existence of non-trivial hyperfactorizations of \(K_{2n}\)
- Triple systems in \(\text{PG}(2,q)\)
- Class-uniformly resolvable pairwise balanced designs with block size two and three
- The spectrum of \(\alpha\)-resolvable block designs with block size 3
- A note on cyclic groups, finite fields, and the discrete logarithm problem
- On Kirkman triple systems of order 33
- Advances in Cryptology - CRYPTO '90. A conference on the theory and application of Cryptography, Univ. of California, Santa Barbara, USA, August 11--15, 1990. Proceedings
- Arithmetic operations in \(GF(2^ m)\)
- A construction for equidistant permutation arrays of index one
- Embedding (r,1)-designs in finite projective planes
- Orthogonal systems
- Bounds for permutation arrays
- Extremal \((r,\lambda)\)-designs
- Pairwise Orthogonal generalized room squares and equidistant permutation arrays
- On the structure of regular pairwise balanced designs
- Elliptic curve cryptosystems and their implementation
- Factorizations in the elementary abelian \(p\)-group and their cryptographic significance
- An application of difference sets to a problem concerning graphical codes
- Discrete logarithm based cryptosystems in quadratic function fields of characteristic 2
- \(q\)-ary graphical codes
- The existence of simple \(S_ 3(3,4,\nu)\)
- Balanced tournament designs and related topics
- Orthogonal resolutions of lines in AG(n,q)
- Recursive constructions for skew resolutions in affine geometries
- Subspaces and polynomial factorizations over finite fields
- An efficient protocol for authenticated key agreement
- Short RSA keys and their generation
- An application of coding theory to a problem in graphical enumeration
- The state of elliptic curve cryptography
- An implementation for a fast public-key cryptosystem
- Computing Logarithms in Finite Fields of Characteristic Two
- Kirkman Cubes
- On the Number of Self-Dual Bases of GF(q m ) Over GF(q)
- A Note on the Existence of Strong Kirkman Cubes
- On L2-Golourings of a Graph
- A Combinatorial Approach to Threshold Schemes
- Some Results on the Existence of Squares
- Steiner Systems and Room Squares
- On Maximal Equidistant Permutation Arrays
- Subgroup Refinement Algorithms for Root Finding in $GF(q)$
- Pair-Splitting Sets in $AG ( m,q )$
- The Asymptotic Behaviour of Equidistant Permutation Arrays
- Class-uniformly resolvable designs with block sizes 2 and 3
- Counting Points on Elliptic Curves Over F 2 m
- Reducing elliptic curve logarithms to logarithms in a finite field
- Graphical codes revisited
- Elliptic curve cryptosystems using curves of smooth order over the ring Z/sub n/
- Validation of Elliptic Curve Public Keys
- Improving the parallelized Pollard lambda search on anomalous binary curves
- A geometric approach to root finding in GT(q/sup m/)
- Affine Geometries Obtained from Projective Planes and Skew Resolutions on AG(3,q)
- On Mutually Orthogonal Resolutions and Near-Resolutions
- On Orders of Optimal Normal Basis Generators
- Accelerated Verification of ECDSA Signatures
This page was built for publication: Guest editorial: Special issue in honor of Scott A. Vanstone
