Try a search?
http://msdn.microsoft.com/library/de...urn_values.asp
(MSN search for
(0x80093104 OR 80093104)
)
Apparently the codes more commonly seen from this class are
0x8009310B and 0x80093102.
Note that when Lucy [MSFT] replied to a post involving 0x80093102
here last year that her guess was "it sounds like a certificate issue"
and she suggested that the poster try a newsgroup which specialized
in the OS involved.
http://groups-beta.google.com/group/...134cc9c4604040
(Google Groups search for
(0x80093100 OR 0x80093101 OR 0x80093102 OR 0x80093103 OR 0x80093104 OR 0x80093105 OR 0x80093106 OR 0x80093107 OR 0x80093108 OR
0x80093109 OR 0x8009310A OR 0x8009310B OR 0x8009310C OR 0x8009310D OR 0x8009310E OR 0x80093133 OR 0x80093134 OR 0x80093201 OR
0x80093202) (MSFT OR MVP)
)
BTW notice that Google Groups seems to have finally eliminated its 10 term
restriction but it still won't do closures. E.g. with Deja I would have done
all of the above much more simply (though perhaps not as accurately)
with 0x800931*. Also I didn't bother enlarging the scope of the search
to include non-prefixed codes because of the tediousness of constructing
the search expression but could also have done that on Deja with
(0x800931* | 800931*) Actually it would be trivial to do a second search
after taking my search expression, pasting it into a Notepad window, doing
a global replace (Ctrl-h) of 0x with nothing and then copying and pasting
the resulting expression into the Google Groups input box.
Ok. I just did that myself. Nothing new useful there.
HTH
Robert Aldwinckle
---
"@(none)" <""forest\"@(none)"> wrote in message
news:...
> Hello,
>
> I tried several times to install SP2 on a XP Pro SP1 computer. I tried
> to install it using windows update, or with the executable I downloaded
> from the windows website (WindowsXP-KB835935-SP2-FRA.exe).
> I always get the same error:
> - with the executable: "ASN1 valeur trop importante" (French) -> "ASN1
> value too large"
> - windows update: 0x80093104
>
> Has someone already encountered this error ? How to solve it ?
>
> Thanks,
>
> Forest