|
|
Up |
|
|
  |
Author: Nelson BNelson B
Date: Jan 27, 2008 20:45
Tim Tyler wrote, On 2008-01-26 13:50:
> The NSA goes domestic
At least they didn't go postal! :)
|
| |
|
| |
no comments
|
|
  |
Author: apollo66942apollo66942
Date: Jan 27, 2008 20:03
I'm still feeling light-headed about my dream last night. I cannot
believe it. After waiting for a peaceful sleep for the past couple of
weeks and actually enjoying it, I faced a very scary dilemma. I had a
dream, no, no, it's a nightmare. And I'm dreading to sleep later
because until now I don't have the answer to the terrifying question.
I was practically enjoying the calm feeling of my sleep when out
nowhere I was standing in the middle of a very very big arena. I was
distressed and confused by the sudden change of surroundings. I was
starting to be afraid when I heard a thundering sound coming from my
back. Ready to shout with all my might, I turned around and my jaw
dropped not because of my scream but because of an outmost amazement.
My king, the love of my life, was riding his horse,Brego, and stopped
infront of me. Oh, my Aragorn, I cannot believe it. I was about to
finally let a scream of delight pass through me when he grabbed my
hand and offered the most outrageuos proposal I've heard in my whole
life. He wanted me to be his queen. At long last, he said, Arwen was
out of his life and he came to me because I am the only one his heart
desires. Ohhh, what can I say? How can a lady like me answer an offer
like that?
|
| Show full article (2.22Kb) |
|
| |
no comments
|
|
  |
Author: AriAri
Date: Jan 27, 2008 19:55
On Sat, 26 Jan 2008 18:06:53 -0500, John E. Hadstate wrote:
>> The NSA goes domestic
>>
>> Bush Order Expands Network Monitoring
>>
>> Intelligence...
|
| Show full article (1.55Kb) |
|
1 Comment |
|
  |
Author: JSHJSH
Date: Jan 27, 2008 19:38
On Jan 26, 7:47 am, JSH gmail.com> wrote:
> The recent research I've discussed with much frequency recently can be
> further generalized, so that you can calculate factors modulo N, where
> N can be a prime number or a composite. I will make one variable
> change from previous expositions going from 'n' to 'm' since I'm now
> using capital 'N' instead of 'p':
>
> With z^2 = y^2 + mT, where T is the target composite to be factored, m
> is a non-zero integer of your choice, and N is a prime or composite of
> your choice, you may find the following to be true:
N has to be odd.
>
> z = (2a)^{-1}(1 + 2a^2)k mod N
That's why N has to be odd, but also note then that 'a' needs to be
coprime to N, so if you get an 'a' that is not, then it's not a useful
value.
|
| Show full article (1.50Kb) |
|
2 Comments |
|
  |
Author: imecs_2008imecs_2008
Date: Jan 27, 2008 10:32
CFP: The 2008 International Conference of Wireless Networks (ICWN
2008)
From: IAENG - International Association of Engineers
Draft Paper Submission Deadline: 6 March, 2008
Camera-Ready papers & Pre-registration Due: 31 March, 2008
ICWN 2008: 2-4 July, 2008, London, U.K.
http://www.iaeng.org/WCE2008/ICWN2008.html
The conference ICWN'08 is held under the World Congress on Engineering
2008. The WCE 2008 is organized by the International Association of
Engineers (IAENG), a non-profit international association for the
engineers and the computer scientists. Our congress committees have
been formed with over two hundred and eighty committee members who are
mainly research center heads, faculty deans, department heads,
professors, and research scientists from different universities like
Cambridge, MIT and Oxford etc.
The conference proceedings will be published by IAENG (ISBN:
978-988-98671-9-5) in hardcopy. The full-text congress proceeding will
be indexed in major database indexes so that it can be assessed
easily...
|
| Show full article (10.84Kb) |
|
no comments
|
|
  |
Author: tavarestavares
Date: Jan 27, 2008 08:00
-----------------------------------------------------------------------------------------------------------------------------------------
(Apologies for cross-posting)
Workshop "Medical Imaging Systems" within EUROSIS EUROMEDIA 2008
April 9-11, 2008, University of Porto, Porto, Portugal
http://www.eurosis.org/cms/index.php?q=node/461
We would appreciate if you could distribute this information by your
colleagues and co-workers.
-----------------------------------------------------------------------------------------------------------------------------------------
Dear Colleague,
In recent years, extensive research has been performed to develop more
and more efficient and powerful medical imaging systems. Such systems
are crucial for medical specialists, allowing a deeper analysis...
|
| Show full article (4.37Kb) |
|
no comments
|
|
  |
Author: Antony ClementsAntony Clements
Date: Jan 26, 2008 23:23
I have been doing some reading on using modulo arithmetic as opposed to
using the xor function, i know that the xor function is modulo 2 arithmetic,
the question is, would breaking the xor function down into N steps decrease
the memory footprint of an algorithm, if so the reduction in time should
vary depending on the size of input 1 and input 2 and how many of them there
are, as part of a stream cipher for example.
the further question arises of how to break it down into steps, i know how
to break down modulo exponentiation but not any of the other forms of modulo
arithmetic.
links to reference material or explenations would be most welcome.
|
| |
|
no comments
|
|
  |
Author: Peter PearsonPeter Pearson
Date: Jan 26, 2008 22:03
Would any German-speaking sci.crypt participant be so obliging
as to visit
http://wikileaks.org/wiki/Skype_and_the_Bavarian_trojan_in_the_middle
and describe the leaked memo? The phrase "trojan in the middle"
seems confused. I wouldn't expect Skype to be vulnerable
to a man-in-the-middle attack. Does this attack depend on
infecting the victim's computer with malware?
--
To email me, substitute nowhere->spamcop, invalid->net.
|
| |
|
11 Comments |
|
  |
Author: Mike FleagleMike Fleagle
Date: Jan 26, 2008 21:37
> The recent research I've discussed with much frequency recently can be
> further generalized, so that you can calculate factors modulo N, where
> N can be a prime number or a composite. I will make one variable
> change from previous expositions going from 'n' to 'm' since I'm now
> using capital 'N' instead of 'p':
>
> With z^2 = y^2 + mT, where T is the target composite to be factored, m
> is a non-zero integer of your choice, and N is a prime or composite of
> your choice, you may find the following to be true:
so we gotta picka "m",
picka "N",
and picka "y" or picka "z".
> z = (2a)^{-1}(1 + 2a^2)k mod N
Now we gotta picka "k"
and picka "a"
We are up to guessing 5, *FIVE* numbers, JSH
|
| Show full article (2.51Kb) |
|
6 Comments |
|
  |
|
|
  |
Author: Peter PearsonPeter Pearson
Date: Jan 26, 2008 21:33
On Sat, 26 Jan 2008 16:53:27 -0800 (PST), BobKellock wrote:
[snip]
> I don't imagine that the "encryption" algortihm is very
> complex because it'a not being used for security
> purposes. On the other hand it's not super simple as, for
> instance, swapping the position of two bytes in the source
> generates a vastly different result.
|
| Show full article (0.85Kb) |
|
1 Comment |
|
|
|
|
|
|