1989 Paris Open – Doubles

Paul Annacone and John Fitzgerald were the defending champions but they competed with different partners that year, Annacone with Christo van Rensburg and Fitzgerald with Anders Järryd.

Doubles
1989 Paris Open
1988 Champions Paul Annacone
John Fitzgerald
Champions John Fitzgerald
Anders Järryd
Runners-up Jakob Hlasek
Eric Winogradsky
Final score7–6, 6–4

Annacone and van Rensburg lost in the first round to Jakob Hlasek and Eric Winogradsky.

Fitzgerald and Järryd won in the final 7–6, 6–4 against Hlasek and Winogradsky.

Seeds

Champion seeds are indicated in bold text while text in italics indicates the round in which those seeds were eliminated.

  1. John Fitzgerald / Anders Järryd (Champions)
  2. Rick Leach / Jim Pugh (Quarterfinals)
  3. Paul Annacone / Christo van Rensburg (First Round)
  4. Ken Flach / Robert Seguso (First Round)

Draw

Key
First Round Quarterfinals Semifinals Final
1 J Fitzgerald
A Järryd 		6 6  
  P Korda
T Šmíd 		2 2   1 J Fitzgerald
A Järryd 		6 6 6
  J Courier
P Sampras 		3 6 1 WC G Forget
Y Noah 		7 3 2
WC G Forget
Y Noah 		6 1 6 1 J Fitzgerald
A Järryd 		6 6  
4 K Flach
R Seguso 		2 6     J McEnroe
M Woodforde 		3 2  
  J McEnroe
M Woodforde 		6 7     J McEnroe
M Woodforde 		7 3 7
  K Curren
D Pate 		2 4     S Davis
T Witsken 		6 6 6
  S Davis
T Witsken 		6 6   1 John Fitzgerald
Anders Järryd 		7 6  
  T Carbonell
E Sánchez 		4 6 6   Jakob Hlasek
Eric Winogradsky 		6 4  
  T Pawsat
L Warder 		6 3 2   T Carbonell
E Sánchez 		     
  J Hlasek
E Winogradsky 		7 7     J Hlasek
E Winogradsky 		w/o    
3 P Annacone
C van Rensburg 		6 5     J Hlasek
E Winogradsky 		6 6 6
  P Aldrich
D Visser 		7 6     P Aldrich
D Visser 		4 7 3
  B Becker
E Jelen 		6 4     P Aldrich
D Visser 		6 7  
  J Grabb
P McEnroe 		6 4 2 2 R Leach
J Pugh 		3 5  
2 R Leach
J Pugh 		4 6 6
gollark: <@!206233133228490752> Sorry to bother you, but keypairs generated by `ccecc.py` and the ECC library in use in potatOS appear to have different-length private and public keys, which is a problem.EDIT: okay, apparently it's because I've been accidentally using a *different* ECC thing from SMT or something, and it has these parameters instead:```---- Elliptic Curve Arithmetic---- About the Curve Itself-- Field Size: 192 bits-- Field Modulus (p): 65533 * 2^176 + 3-- Equation: x^2 + y^2 = 1 + 108 * x^2 * y^2-- Parameters: Edwards Curve with c = 1, and d = 108-- Curve Order (n): 4 * 1569203598118192102418711808268118358122924911136798015831-- Cofactor (h): 4-- Generator Order (q): 1569203598118192102418711808268118358122924911136798015831---- About the Curve's Security-- Current best attack security: 94.822 bits (Pollard's Rho)-- Rho Security: log2(0.884 * sqrt(q)) = 94.822-- Transfer Security? Yes: p ~= q; k > 20-- Field Discriminant Security? Yes: t = 67602300638727286331433024168; s = 2^2; |D| = 5134296629560551493299993292204775496868940529592107064435 > 2^100-- Rigidity? A little, the parameters are somewhat small.-- XZ/YZ Ladder Security? No: Single coordinate ladders are insecure, so they can't be used.-- Small Subgroup Security? Yes: Secret keys are calculated modulo 4q.-- Invalid Curve Security? Yes: Any point to be multiplied is checked beforehand.-- Invalid Curve Twist Security? No: The curve is not protected against single coordinate ladder attacks, so don't use them.-- Completeness? Yes: The curve is an Edwards Curve with non-square d and square a, so the curve is complete.-- Indistinguishability? No: The curve does not support indistinguishability maps.```so I might just have to ship *two* versions to keep compatibility with old signatures.
gollark: > 2. precompilation to lua bytecode and compressionThis was considered, but the furthest I went was having some programs compressed on disk.
gollark: > 1. multiple layers of sandboxing (a "system" layer that implements a few things, a "features" layer that implements most of potatOS's inter-sandboxing API and some features, a "process manager" layer which has inter-process separation and ways for processes to communicate, and a "BIOS" layer that implements features like PotatoBIOS)Seems impractical, although it probably *could* fix a lot of problems
gollark: There's a list.
gollark: Lots of them.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.