-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
"Lacroix, Robert" [EMAIL PROTECTED] writes:
# This algorithm efficiently solves problems of the form 2^x = aN + 1,
# using O(log N) storage and O(log N)(log N) time.
Sorry to be a wet blanket, but it should be "O(N) time". As a factoring
method,
Hi folks,
I found a vulnerability in the feature of virus scan for e-mail in
Virus Buster 2001 from Trend Micro Inc.
Virus Buster 2001 is a Japanese software package that has similar
functions of PC-cillin 2000 such as eMail Virus Scanning and Browser
Scanning.
The feature of virus scan for
Georgi Guninski security advisory #37,
2001
Windows client UDP exhaustion denial of
service
The
sample code also works on W2K Server and Adv. Server. Couldn't even resolve DNS
from local Domain Controller..
Kris KistlerSecurity AdministratorSt. Louis, MO
Hi Everybody.,
I just wanted to add a thing to the prime number which i found
independently and i do not know whether this has been achieved earlier or
not but i have a way of proving that every prime is of the form
(int)sq.root(1+24n)
of course excepting 2 and 3.This is a result derived from the
"Greg A. Woods" wrote:
At the same time I was testing NMAP against BIND-9.1.0 it seems I wacked
my snmpd too (that was with 'nmap -O -sT proven'). The last thing it
uttered was:
Feb 6 13:28:18 proven ucd-snmp[285]: [smux_accept] accepted fd 11 - errno 0
That's from NET-SNMP 4.1.2 built
Advisory: Infobot 0.44.5.3 and below vulnerability [Hack-X]
This version and versions from before were also released into the
FreeBSD ports tree.
Currently there is no patched version even though I emailed the author
over a month ago about this and emailed the development list over a
week, and
More repro reports. If no credit is given it is because the report was
emailed to me and not the list, and I don't want to get anybody in
trouble...
---
I have tried nmap -O -sT -p 53 against a few hosts under my thumbs:
the most hosts are Linux 2.2 but one FreeBSD
The posted BIND exploit was crippled and the author seemed a little unclear
on the necessary byte ordering.. Attached is a cleaned up version that should
make all the kiddies happy..
Jonathan and Ian (at 3:00am)
/*
* This exploit has been fixed and extensive explanation and clarification
*
CORE SDI
http://www.core-sdi.com
SSH protocol 1.5 session key recovery vulnerability
Date Published: 2001-02-07
Advisory ID: CORE-20010116
Bugtraq ID: 2344
CVE CAN: Not currently assigned.
Title: Session Key
In response to Taneli Huuskonen [mailto:[EMAIL PROTECTED]]
Sorry to inflict this crapto on you. I came up with the algorithm when I
read Ariel Waissbein's post.
Waissbein said...
check if a number of size 2^1024, e.g. 2^(2^1024), is
congruent to 1 modulo the public exponent n.
Le 2001-02-07, Padmapani S Ganti crivait :
I just wanted to add a thing to the prime number which i found
independently and i do not know whether this has been achieved earlier or
not but i have a way of proving that every prime is of the form
(int)sq.root(1+24n)
Not very interesting, since
-BEGIN PGP SIGNED MESSAGE-
=
FreeBSD-SA-01:21 Security Advisory
FreeBSD, Inc.
Topic: ja-elvis
-BEGIN PGP SIGNED MESSAGE-
=
FreeBSD-SA-01:08 Security Advisory
FreeBSD, Inc.
Topic: ipfw/ip6fw
-BEGIN PGP SIGNED MESSAGE-
=
FreeBSD-SA-01:20 Security Advisory
FreeBSD, Inc.
Topic: mars_nwe
-BEGIN PGP SIGNED MESSAGE-
=
FreeBSD-SA-01:19 Security Advisory
FreeBSD, Inc.
Topic: ja-xklock
On Tue, 6 Feb 2001, Padmapani S Ganti wrote:
I just wanted to add a thing to the prime number which i found
independently and i do not know whether this has been achieved earlier or
not but i have a way of proving that every prime is of the form
(int)sq.root(1+24n)
May I add, that every
-BEGIN PGP SIGNED MESSAGE-
=
FreeBSD-SA-01:11 Security Advisory
FreeBSD, Inc.
Topic: inetd ident
17 matches
Mail list logo
