default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDesigns, Codes and Cryptography, Volume 28, 2003
Volume 28, Number 1, January 2003
- David Pointcheval, Guillaume Poupard:
A New NP-Complete Problem and Public-Key Identification. Des. Codes Cryptogr. 28(1): 5-31 (2003) - Simon Joseph Agou, Marc Deléglise, Jean-Louis Nicolas:
Short Polynomial Representations for Square Roots Modulo rho. Des. Codes Cryptogr. 28(1): 33-44 (2003) - Emily H. Moore, Harriet Pollatsek:
Looking for Difference Sets in Groups with Dihedral Images. Des. Codes Cryptogr. 28(1): 45-50 (2003) - Patrick Govaerts, Leo Storme:
On a Particular Class of Minihypers and Its Applications. I. The Result for General varrho. Des. Codes Cryptogr. 28(1): 51-63 (2003) - Vito Abatangelo, Bambina Larato:
Doubly beta-Derived Translation Planes. Des. Codes Cryptogr. 28(1): 65-74 (2003) - K. T. Arasu, Kevin J. Player:
A New Family of Cyclic Difference Sets with Singer Parameters in Characteristic Three. Des. Codes Cryptogr. 28(1): 75-91 (2003) - Xiang-dong Hou:
On Binary Resilient Functions. Des. Codes Cryptogr. 28(1): 93-112 (2003)
Volume 28, Number 2, March 2003
- Laurie Law, Alfred Menezes, Minghua Qu, Jerome A. Solinas, Scott A. Vanstone:
An Efficient Protocol for Authenticated Key Agreement. Des. Codes Cryptogr. 28(2): 119-134 (2003) - Sergei Konyagin, Tanja Lange, Igor E. Shparlinski:
Linear Complexity of the Discrete Logarithm. Des. Codes Cryptogr. 28(2): 135-146 (2003) - Vassili C. Mavron, T. P. McDonough, Mohan S. Shrikhande:
Quasi-Symmetric Designs with Good Blocks and Intersection Number One. Des. Codes Cryptogr. 28(2): 147-162 (2003) - Stefka Bouyuklieva, Masaaki Harada:
Extremal Self-Dual [50, 25, 10] Codes with Automorphisms of Order 3 and Quasi-Symmetric 2-(49, 9, 6) Designs. Des. Codes Cryptogr. 28(2): 163-169 (2003) - Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada:
Extremal Self-Dual Codes over F2 × F2. Des. Codes Cryptogr. 28(2): 171-186 (2003) - Sheng-Bo Xu, Jeroen Doumen, Henk C. A. van Tilborg:
On the Security of Digital Signature Schemes Based on Error-Correcting Codes. Des. Codes Cryptogr. 28(2): 187-199 (2003) - Svetla Nikova, Ventzislav Nikov:
Improvement of the Delsarte Bound for t-Designs When It Is Not the Best Bound Possible. Des. Codes Cryptogr. 28(2): 201-222 (2003)
Volume 28, Number 3, April 2003
- Mida Guillermo, Keith M. Martin, Christine M. O'Keefe
:
Providing Anonymity in Unconditionally Secure Secret Sharing Schemes. 227-245 - Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth:
3-Designs from the Z4-Goethals Codes via a New Kloosterman Sum Identity. 247-263 - Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes. 265-282 - David Masson:
Designs and Representation of the Symmetric Group. 283-302 - Klaus Huber:
Taking pth Roots Modulo Polynomials over Finite Fields. 303-311
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.
last updated on 2024-11-04 20:44 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:
