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 - 2002

  • "Cone-Free" Primal-Dual Path-Following and Potential Reduction Polynomial Time Interior-Point Methods (PDF)

    CORR 2002-32

    Arkadi Nemirovski and Levent Tunçel

  • Controlled Proxy-assisted Secure End-to-End Communication (PDF)

    CORR 2002-31

    Hung-Yu Lin

  • The Editing Generator and Its Cryptanalysis (PDF)

    CORR 2002-30

    Shaoquan Jiang and Guang Gong

  • Cryptanalysis of Stream Cipher - A Survey (PDF)

    CORR 2002-29

    Shaoquan Jiang and Guang Gong

  • On Edit Distance Attack to Alternating Step Generator (PDF)

    CORR 2002-28

    Shaoquan Jiang and Guang Gong

  • An Efficient Algorithm for Exponentiation in DH Key Exchange and DSA in Cubic Extension Fields (PDF)

    CORR 2002-27

    Guang Gong, Anwar Hasan, Huapeng Wu, and Amr Youssef

  • A Rotation Bijection for Lattice Paths above a Line of Integer Slope (PDF)

    CORR 2002-26

    I.P. Goulden and Luis G. Serrano

  • The rth Smallest Prime Factor and a Simple Primality Test (PDF)

    CORR 2002-25

    Daniel Panario, Bruce Richmond, and Martha Yip

  • Optimal 3-terminal cuts and linear programming (PDF)

    CORR 2002-24

    Kevin K.H. Cheung, William H. Cunningham, and Lawrence Tang

  • Trace Function Representation of Hall's Sextic Residue Sequences of Period $p \equiv 7 \pmod {8}^*$ (PDF)

    CORR 2002-23

    Jeong-Heon Kim, Guang Gong and Hong-Yeop Song

  • A Survey of the Trust Region Subproblem Within a Semidefinite Programming Framework (PDF)

    CORR 2002-22

    Henry Wolkowicz

  • TBA

    CORR 2002-21

    Henry Wolkowicz

  • Two-Tuple Balance of Non-Binary Sequences with Ideal Two-Level Autocorrelation (PDF)

    CORR 2002-20

    Guang Gong and Hong-Yeop Song

  • Message Authentication Codes with Error Correcting Capabilities (PDF)

    CORR 2002-19

    Charles C.Y. Lam, Guang Gong and Scott Vanstone

  • Randomness of Elliptic Curve Sequences (PDF)

    CORR 2002-18

    Charles C.Y. Lam and Guang Gong

  • Euclidean Distance and the Molecular Conformation Problem (PDF)

    CORR 2002-17

    Abdo Y. Alfakih and Henry Wolkowicz

  • A Simplified/Improved HKM Direction for Certain Classes of Semidefinite Programming (PDF)

    CORR 2002-16

    Henry Wolkowicz

  • Geometry of Homogeneous Convex Cones, Duality Mapping, and Optimal Self-Concordant Barriers (PDF)

    CORR 2002-15

    Van Anh Truong and Levent Tunçel

  • Determinants of Random Matrices and Jack Polynomials of Rectangular Shape (PDF)

    CORR 2002-14

    G.E. Andrews, I.P. Goulden, and D.M. Jackson

  • Stable Set Problem and the Lift-and-Project Ranks of Graphs

    CORR 2002-13

    Lászlö Liptak and Levent Tunçel

  • Efficient Multiplication Beyond Optimal Normal Bases (PDF)

    CORR 2002-12

    A. Reyhani-Masoleh and M.A. Hasan

  • On Some Attacks on Multi-Prime RSA (PDF)

    CORR 2002-11

    M. Jason Hinek, Mo King Low, and Edlyn Teske

  • Condition and Complexity Measures for Infeasibility Certificaters of Systems of Linear Inequalities and Their Sensitivity Analysis (PDF)

    CORR 2002-10

    Hugo J. Lara and Levent Tunçel

  • A Logical Characterisation of the Computational Complexity Class BPP (PDF)

    CORR 2002-09

    Phillip Kaye

  • Graphs with Independent Perfect Matchings (PDF)

    CORR 2002-08

    Marcelo H. de Carvalho, Cláudio L. Lucchesi, and U.S.R. Murty

  • Isomorphism Classes of Hyperelliptic Curves of Genus 2 in Characteristic 5 (PDF)

    CORR 2002-07

    L. Hernández Encinas and J. Muñoz Masqué

  • Generic Groups, Collision Resistance, and ECDSA (PDF)

    CORR 2002-06

    Daniel R.L. Brown

  • Obstacles to the Torsion-Subgroup Attack on the Decision Diffie-Hellman Problem (PDF)

    CORR 2002-05

    Neal Koblitz and Alfred J. Menezes

  • Semidefinite Programming (PDF)

    CORR 2002-04

    Henry Wolkowicz

  • A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks (PDF)

    CORR 2002-03

    Tetsuya Izu and Tsuyoshi Takagi

  • Factoring N = pq2 with the Elliptic Curve Method (PDF)

    CORR 2002-02

    Peter Ebinger and Edlyn Teske

  • Generating Large Instances of the Gong-Harn Cryptosystem (PDF)

    CORR 2002-01

    Kenneth J. Giuliani and Guang Gong

  • 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