Skip to main Skip to footer
University of Waterloo
  • Admissions
  • About Waterloo
  • Faculties & academics
  • Offices & services
  • Support Waterloo
  • COVID-19
Search
  • Combinatorics and Optimization home
  • Our people
  • Research and awards
    • Research areas
    • Awards and achievements
    • Research Chairs
    • Centres and institutes
    • Journal of Combinatorial Theory, Series B
    • Technical reports
    • Faculty Lectures
    • Faculty book list
  • Career opportunities
  • News
  • Events
    • Tutte Colloquium Series
    • Tutte's Distinguished Lecture Series
  • Contact us
  • Undergraduate students
    • Contact
    • Degrees
    • Courses
    • Degree checklists
    • Undergraduate Research Assistantship Spring Program
      • Spring Noticeboard
      • Spring URA Application
      • URA FAQs
      • URA Job Board Fall and Winter terms
    • Frequently Asked Questions
  • Graduate students
    • Contact us
    • Applying
    • Programs
    • Courses
    • Milestones for PhD students
      • PhD Thesis Proposal
    • Teaching Assistant position
    • Travel and Expense Claims
    • Alumni profiles
    • Student profiles
    • PhD recipients
    • MMath theses
    • MMath essays
    • Funding and awards
    • FAQ's for new graduate students
    • Outstanding TA award
    • FAQ's for prospective graduate students
    • Important Dates
    • Orientation for new graduate students
  • Admissions
  • About Waterloo
  • Faculties & academics
  • Offices & services
  • Support Waterloo
  • COVID-19
Combinatorics and Optimization
  • Combinatorics and Optimization home
  • Our people
  • Research and awards
    • Research areas
    • Awards and achievements
    • Research Chairs
    • Centres and institutes
    • Journal of Combinatorial Theory, Series B
    • Technical reports
    • Faculty Lectures
    • Faculty book list
  • Career opportunities
  • News
  • Events
  • Contact us

Information for

  • Undergraduate students
  • Graduate students
  1. Combinatorics and Optimization
  2. Research and awards
  3. Technical reports

Technical reports - 2001

  • Elliptic Curves with Compact Parameters (PDF)

    CORR 2001-68

    Ezra Brown, Bruce T. Myers, and Jerome A. Solinas

  • Polynomial Functions on Finite Galois Rings (PDF)

    CORR 2001-67

    Zong-duo Dai, Guang Gong, and Ding-feng Ye

  • A Simple Iterative Method for Linear Programming (PDF)

    CORR 2001-66

    Maeria Gonzalez-Lima and Henry Wolkowicz

  • Note on Reduction Operation Modulo rn + arm + b (PDF)

    CORR 2001-65

    Huapeng Wu

  • A New Family of Gold-like Sequences (PDF)

    CORR 2001-64

    Khoongming Khoo, Guang Gong, and Douglas R. Stinson

  • Security Signature Schemes in a Multi-User Setting (PDF)

    CORR 2001-63

    Alfred Menezes and Nigel Smart

  • Optimized Baby Step-Giant Step Methods and Applications to Hyperelliptic Function Fields (PDF)

    CORR 2001-62

    Andreas Stein and Edlyn Teske

  • Efficient Modular Operation for A Class of Moduli (PDF)

    CORR 2001-61

    Huapeng Wu, M. Anwar Hasa, and Ian F. Blake

  • Slope packings and coverings, and generic algorithms for the discrete logarithm problem (PDF)

    CORR 2001-60

    M. Chateauneuf, A.C.H. Ling, and D.R. Stinson

  • Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree (PDF)

    CORR 2001-59

    Markus Maurer, Alfred Menezes, and Edlyn Teske

  • Hyper-Bent Functions (PDF)

    CORR 2001-58

    A.M. Youssef and G. Gong

  • Boolean Functions with Large Distance to all Bijective Monomials: N odd case (PDF)

    CORR 2001-57

    Amr Youssef and Guang Gong

  • Ideal Clutters (PDF)

    CORR 2001-56

    Gérard Cornuéjols and Bertrand Guenin

  • A Decoding Algorithm for General Linear Block Codes (PDF)

    CORR 2001-55

    Abdulrahman Kh. Al Jabri

  • A Parallel Algorithm for Extending Cryptographic Hash Functions (PDF)

    CORR 2001-54

    Palash Sarkar and Paul J. Schellenberg

  • The Matrix of Chromatic Joins and the Temperley-Lieb Algebra (PDF)

    CORR 2001-53

    S. Cautis and D.M. Jackson

  • Matching, Matroids, and Extensions (PDF)

    CORR 2001-52

    William H. Cunningham

  • An Algorithm for Portfolio Optimization with Transaction Costs (PDF)

    CORR 2001-51

    Michael J. Best and Jaroslava Hlouskova

  • A Small Subgroup Attack on a Key Agreement Protocol of Arazi (PDF)

    CORR 2001-50

    Dan Brown and Alfred Menezes

  • Simple Efficient Solutions for Semidefinite Programming (PDF)

    CORR 2001-49

    Henry Wolkowicz

  • Linear Recursive Sequences over Elliptic Curves (PDF)

    CORR 2001-48

    Guang Gong and Charles C.Y. Lam

  • Linking Classical and Quantum Key Agreement: Is There a Classical Analog to Bound Entanglement? (PDF)

    CORR 2001-47

    Nicolas Gisin, Renato Renner, and Stefan Wolf

  • Computing Shifts in 90/150 Cellular Automata Sequences (PDF)

    CORR 2001-46

    Palash Sarkar

  • A short proof of Seymour's characterization of the matroids with the Max-Flow Min-Cut property (PDF)

    CORR 2001-45

    Bertran Guenin

  • 3-connected planar spaces uniquely embed in the sphere (PDF)

    CORR 2001-44

    R. Bruce Richter and Carsten Thomassen

  • Construction of Symmetric Balanced Squares with Blocksize More than One (PDF)

    CORR 2001-43

    Palash Sarkar and Paul J. Schellenberg

  • Authentication of Quantum Messages (PDF)

    CORR 2001-42

    Claude Crépeau, Daniel Gottesman, Adam Smith, and Alain Tapp

  • Low-Weight Binary Representations for Pairs of Integers (PDF)

    CORR 2001-41

    Jerome A. Solinas

  • Low Cost Hardware Architecture for Secure Stream Cipher Cryptosystems (PDF)

    CORR 2001-40

    Palash Sarkar and Subhamoy Maitra

  • Geometry of Semidefinite Max-Cut Relaxations via Ranks (PDF)

    CORR 2001-39

    Miguel F. Anjos and Henry Wolkowicz

  • Packing Odd-Circuits in Eulerian Graphs (PDF)

    CORR 2001-38

    James F. Geelen and Bertrand Guenin

  • Tree-like properties of cycle factorizations (PDF)

    CORR 2001-37

    Ian Goulden and Alexander Yong

  • Some Consequences of the Linear Programming Bound for Designs (PDF)

    CORR 2001-36

    Ada Chan and Richard M. Wilson

  • The GH Public-key Cryptosystem (PDF)

    CORR 2001-35

    Guang Gong, Lein Harn, and Huapeng Wu

  • On the Linear Complexity of Generalised Legendre Sequences (PDF)

    CORR 2001-34

    Zongduo Dai, Junhui Yang, Guang Gong, and Ping Wang

  • Hyper-Cyclotomic Algebra (PDF)

    CORR 2001-33

    Solomon W. Golomb and Guang Gong

  • New nonbinary sequences with ideal two-level autocorrelation function (PDF)

    CORR 2001-32

    Tor Helleseth and Guang Gong

  • Solving Elliptic Curve Discrete Logarithm Problems Using Weil Descent (PDF)

    CORR 2001-31

    Michael Jacobson, Alfred Menezes, and Andreas Stein

  • A Note on Partial Vertex List Colouring (PDF)

    CORR 2001-30

    P.E. Haxell and Zsuzsanna Szaniszlo

  • Analysis of Rabin's Irreducibility Test for Polynomials Over Finite Fields (PDF)

    CORR 2001-29

    Daniel Panario, Boris Pittel, Bruce Richmond, and Alfredo Viola

  • Stirling Numbers for Complex Arguments: Asymptotics and Identities (PDF)

    CORR 2001-28

    Graemem Kemkes, Chiu Fan Lee, Donatella Merlini, and Bruce Richmond

  • Cross-Correlation Analysis of Cryptographically Useful Boolean Functions and S-boxes (PDF)

    CORR 2001-27

    Palash Sarkar and Subhamoy Maitra

  • Isomorphism Classes of Genus-2 Hyperelliptic Curves Over Finite Fields (PDF)

    CORR 2001-26

    L. Hernéndez Encinas, Alfred J. Menezes, and J. Muñoz Masqué

  • Fast Normal Basis Multiplication Using General Purpose Processors (PDF)

    CORR 2001-25

    Arash Reyhani-Masoleh and M.A. Hasan

  • The Largest non-integer Zero of Chromatic Polynomials of Graphs with Fixed Order (PDF)

    CORR 2001-24

    F.M. Dong

  • Matroid Generating Polynomials and the Half-Plane Property (PDF)

    CORR 2001-23

    Youngbin Choe

  • Approximating Subdifferentials by a Random Sampling of Gradients (PDF)

    CORR 2001-22

    James V. Burke, Adrian S. Lewis, and Michael L. Overton

  • Two Numerical Methods for Optimizing Matrix Stability (PDF)

    CORR 2001-21

    James V. Burke, Adrian S. Lewis, and Michael L. Overton

  • Active Sets, Nonsmoothness and Sensitivity (PDF)

    CORR 2001-20

    A.S. Lewis

  • Further Results on Mean Colour Numbers (PDF)

    CORR 2001-19

    F.M. Dong

  • Bounds for Mean Color Numbers of Graphs (PDF)

    CORR 2001-18

    F.M. Dong

  • A Tutorial on Linear and Differential Cryptanalysis (PDF)

    CORR 2001-17

    Howard M. Heys

  • Critical Configurations of the Dollar Game and Parking Functions (PDF)

    CORR 2001-16

    Jonathan Dumas

  • Some observations on the theory of cryptographic hash functions (PDF)

    CORR 2001-15

    D.R. Stinson

  • Cryptanalysis of the Sakazaki-Okamoto-Mambo ID-based Key Distribution System over Elliptic Curves (Extended abstract) (PDF)

    CORR 2001-14

    Minghua Qu, Doug Stinson, and Scott Vanstone

  • Provably Secure Distributed Schnorr Signatures and a $(t,n)$ Threshold Scheme for Implicit Certificates (PDF)

    CORR 2001-13

    D.R. Stinson and R. Strobl

  • Frameproof and IPP Codes (PDF)

    CORR 2001-12

    Palash Sarkar and Douglas R. Stinson

  • Efficient Implementation of "Large" Stream Cipher Systems (PDF)

    CORR 2001-11

    Palash Sarkar and Subhamoy Maitra

  • Cayley Maps (PDF)
    CORR 2001-10

    R. Bruce Richter, Jozef Sirán, Robert Jajcay, Thomas W. Tucker, and Mark E. Watkins

  • The Group Law on Elliptic curves on Hesse form (PDF)

    CORR 2001-09

    Hege R. Frium

  • Universal hash families and the leftover hash lemma, and applications to cryptography and computing (PDF)

    CORR 2001-08

    D.R. Stinson

  • Square-Root Algorithms for the Discrete Logarithm Problem (A Survey) (PDF)

    CORR 2001-07

    Edlyn Teske

  • Two Theorems on Euclidean Distance Matrices and Gale Transform (PDF)

    CORR 2001-06

    Abdo Y. Alfakih and Henry Wolkowicz

  • "All-One" Blocks in a Binary String (PDF)

    CORR 2001-05

    Rana Barua and Palash Sarkar

  • Quantum Networks for Concetnrating Entanglement (PDF)

    CORR 2001-04

    Phillip Kaye and Michele Mosca

  • Efficient computation of Multiplicative Inverses for Cryptogrpahic Applications (PDF)

    CORR 2001-03

    M.A. Hasan

  • Arrangements, Circular Arrangements and the Crossing Number of $C_7 x C_n$ (PDF)

    CORR 2001-02

    Jay Adamsson and R. Bruce Richter

  • Computing Discrete Logarithms with Parallelized Kangaroo Method (PDF)

    CORR 2001-01

    Edlyn Teske

  • Share via Facebook
  • Share via Twitter
  • Share via Google+
  • Share via LinkedIn
  • Share via Email
  • TOP
  • Share
Department of Combinatorics and Optimization

Contact Info

Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038

Visit Combinatorics & Optimization

Support Mathematics

Work for Mathematics

Provide website feedback

PDF files require Adobe Acrobat Reader.


 

University of Waterloo
University of Waterloo
43.471468
-80.544205
200 University Avenue West
Waterloo, ON, Canada  N2L 3G1
+1 519 888 4567
  • Contact Waterloo
  • Maps & Directions
  • WatSAFE
  • Accessibility
  • Privacy
  • Copyright
  • News
  • Careers
  • Feedback
@uwaterloo social directory

The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is co-ordinated within our Office of Indigenous Relations.

Log in