sci.crypt
  Home FAQ Contact Sign in
sci.crypt only
 
Advanced search
December 2006
motuwethfrsasuw
    123 48
45678910 49
11121314151617 50
18192021222324 51
25262728293031 52
2006
 Jan   Feb   Mar   Apr 
 May   Jun   Jul   Aug 
 Sep   Oct   Nov   Dec 
2008 2007 2006  
total
sci.crypt Profile…
RELATED GROUPS

POPULAR GROUPS

 Up
  Re: Why the 3rd skyscraper came freefalling down on 9/11         


Author: Luc The Perverse
Date: Dec 24, 2006 23:09

gmail.com> wrote in message
news:1167021219.540772.95480@73g2000cwn.googlegroups.com...
> I am almost certain (without direct evidence) that _much_ more
> sophisticated but classified technologies exist. I would call these
> 'gravitoelectromagnetic' weapons using principles of physics not even
> remotely understood by mainstream physics establishment (who are too
> consumed with Einstein-worship to see the abundant empirical
> falsifications of mainstream gravitation theory).

Huh?

While I do not doubt that the government has classified technology - I think
you might be pushing it with weapons that are too complex to be understood
by physicists outside the "elite" circle.

I mean what are you trying to say? Because the government has billions of
dollars to waste that this makes its scientists impervious to self imposed
veils?
Show full article (1.60Kb)
no comments
  ADVERT: Secure comms         


Author: Robin Carey
Date: Dec 24, 2006 11:58

ADVERT: Caesarion v12-GAMMA free, open-source FreeBSD/Linux software;

http://www.caesarion.org.uk

Caesarion v12 is probably one of the most important pieces of
cryptography software
ever written, not only from a software excellence viewpoint, but also
from the algorithms
and techniques employed in the software.

The software provides secure (E-mail) communications facilities;
communications secrecy, user-authentication and data-integrity
verification.

C12-GAMMA provides some unique technological superiorities, including:

o The use of the L15 Stream Cipher which is a technological superiority
in itself.
o Innovative Cipher-Packet technique hides ciphertext in padding thus
preventing cryptanalysis.
o The software is supplied...
Show full article (1.51Kb)
1 Comment
  Re: Why the 3rd skyscraper came freefalling down on 9/11         


Author: T Wake
Date: Dec 24, 2006 08:21

gmail.com> wrote in message
news:1166976664.191186.191770@i12g2000cwa.googlegroups.com...
>
> OG wrote:
>>
>> You've not said say why a freefall pattern of collapse 'implies' directed
>> energy weapons.
>
> WTC 7 appears like a standard demolition.
>
> The towers on the other hand fall faster than freefall which, those who
> accept the empirical as the sole basis for physics, must be accounted
> for in some way. It appears that a directed energy weapon may have been
> used.
>

You are certifiable.
2 Comments
  Re: Poly1305 vs. UMAC vs. new MAC1071         


Author: Wei Dai
Date: Dec 23, 2006 19:06

"D. J. Bernstein" wrote in message
news:slrneorov5.qtk.dan@wessel.mat.dtu.dk...
> Why would you expect 2^127-1 to be faster than 2^107-1? Anyway, 2^107-1
> is faster than 2^127-1 on typical 32-bit CPUs.

Thanks for the explanation. I think with a 64-bit multiplier you can do a
multiply mod 2^127-1 just as fast as mod 2^107-1, but mod 2^127-1 allows you
to pack more message bytes into each polynomial coefficient.
no comments
  Re: Dividing 512 bit number by 128 bit number in C program         


Author: Le Chaud Lapin
Date: Dec 23, 2006 07:44

Le Chaud Lapin wrote:
> vaidehikedlaya@gmail.com wrote:
>> Thanks a lot this helps. Could you send me your C++ code. I would like
>> to look at it.
>
> I decided to post here for benefit of others who would make the same
> mistake I made.

I would like to make a retraction of the statement in the line above.

I realized last night just before going to bed that my algorithm is not
as useless as I thought. My gut feeling is that it can be made to run
much faster than it is in the implementation I gave.

Just how fast remains a matter of exploration. I will explore.

-Le Chaud Lapin-
no comments
  Re: crypto challenge         


Author: Amit
Date: Dec 23, 2006 06:47

further to comment:
> you'll find the order of the group after some time, depending on the
> size of \phi(n).
>
> If the order is known, you can calculate the inverse using the oracle.

it is known that knowledge of \phi(n) is equivalent to the knowledge of
the factors of n.
So your method is the naive method of breaking the system by factoring.
I am trying to see if there is a faster method.
no comments
  BBC links:Privacy Concerns over States/Corporations'Use of Personal Info         


Author: mashi3981
Date: Dec 23, 2006 00:15

Hello,
The BBC news articles below address privacy concerns
over states' and corporations' use of personal data.
I think you will find the links useful.

Thanks,
Mashi

The basic summary is the following:
1. States collect personal info by various methods
(eg:CCTV/closed-circuit TV in roadways).
Corporations collect personal info by various means
(eg:credit card transactions...
Show full article (2.67Kb)
no comments
  Dividing 512 bit number by 128 bit number in C program         


Author: vaidehikedlaya
Date: Dec 22, 2006 15:11

Hi all,
I have a huge problem finding " a mod m " using C program, when m is
128 bit number and a is 512 bit number. Can anybody suggest me a
solution.
Thanks, in advance.
5 Comments
  Re: RSA Performance         


Author: Le Chaud Lapin
Date: Dec 22, 2006 13:08

Carlos Moreno wrote:
> Le Chaud Lapin wrote:
>
>> So essentially the requirements are:
>>
>> 1. Alice signs every message. Bob verifies every signature of Alice.
>> 2. Message flow is strictly unidirectional, from Alice to Bob.
>> 3. Some messages may be lost in transit.
>> 4. Flow must be real-time (hence minimization of exponents on both
>> sides in RSA)
>
> Just a thought ... With so much *symmetry* requirements, how come
> you haven't considered *symmetric* encryption?
>
>
> If you use RSA only to arrange a shared secret between Alice and
> Bob (the shared secret would be nothing other than the encryption
> key to be used with the symmetric algorithm --- the so-called
> "session key"), then the authenticity of the rest of the packages
> is guaranteed by the fact that you can decrypt them and read ...
Show full article (1.21Kb)
no comments
  Re: RSA Performance         


Author: Le Chaud Lapin
Date: Dec 22, 2006 11:07

Mike Amling wrote:
> What patent dispute is that? The RSA patent expired years ago. DSA,
> to my knowledge, was never patented.
>> also need to learn more about DSA. I had read somewhere a while back
>> that signing and verification are asymmetric in performance. I need to
>> be able to induce symmetry to maximize throughput.
>
> How does symmetry affect throughput? If each signature is verified
> once, don't you want to minimize the sum of signature generation and
> verification?
Show full article (2.00Kb)
1 Comment
1 2 3 4 5 6 7