Sip

A.R.'s post had 1,219 words, 6,530 characters (without counting spaces), 7,751 characters (including spaces) for a total of 117 lines. I figured I will return the favor by posting some of the stuff I read today. Hope you find it just as useful Believe me, if I start posting the stuff I have to read everyday, Hyeforum's disk spaces will fill up faster than you can say "All Jews are Garbage". Actually, you may enjoy reading the stuff below. It probably has more useful content than most of what you have posted so far (with all due respect of course). By Chappell Brown EE Times April 9, 2002 (8:42 a.m. EST) BURLINGTON, Mass. — Armed with a simplified mathematical approach to public-key encryption, NTRU Cryptosystems Inc. here is introducing intellectual property that can add security to virtually any circuit. The most recent product based on the approach is a circuit block that can be added to small wireless products such as smart cards and point-of-sale ID tags. NTRU claims the approach is as secure as the popular RSA public-key encryption system but is computationally much simpler. "Public-key cryptography is necessary in systems of high scale or high security. Their primary advantage is that they allow for encryption keys to be widely distributed without fear of compromise," said Scott Crenshaw, chief executive officer of NTRU. "NTRU's core technology solves a fundamental problem for public-key cryptography." Until now, Crenshaw said, "public-key systems required very large numbers of gates — 50,000 gates, 100,000 gates — or in software, it required a Pentium-class machine. NTRU's system, on the other hand, fits into a very small number of gates and can run on a low-end microcontroller." Two approaches The company's product line, GenuID, is segmented into two areas: software running on low-end microcontrollers and a processor core that can be inserted into designs. "We run the software implementation faster than RSA can run on a Pentium," claimed Crenshaw, referring to the most popular form of public-key encryption, RSA (named for its inventors: Ron Rivest, Adi Shamir and Leonard Adleman). Tool kits both for implementing readers and for the back-end system are also available. RSA's contactless smart cards sell for $3 to $5, Crenshaw said, while GenuID chips sell for 50 cents to $1. "This is significant for manufacturers — it opens up new application areas that require security," he said. The different approach to encryption began with a group of math professors at Brown University. They realized that a more computationally efficient version would open a huge market for low-end security. Jeffrey Hoffstein, Joseph Silverman, Jill Pipher and Daniel Lieman — who co-founded NTRU — studied the conventional approach and realized that the basic strategy, based on integer arithmetic, took a toll computationally. While integer math is well-understood and relatively easy to implement in software, the underlying computer models are complex in terms of the conventional structure of digital CPUs. Modular math The RSA uses numbers with 1,024 bits. In contrast, the NTRU algorithm is based on byte boundaries that even an 8-bit microprocessor can handle. The algorithm is based on modular arithmetic, which operates on arrays of bytes. Public-key cryptography depends on an algorithm that is easy to run in one direction only. For example, multiplying two large prime numbers is easier computationally than finding the two prime factors of some number that has been generated in this way. Thus, if an encryption system is based on prime-number computational asymmetry, it will be tough for a code cracker to take a brute-force approach to deducing the original two numbers. Using known benchmarks for computer systems, a cryptologist simply needs to determine two prime numbers that are large enough to make the prime factoring algorithm impossible to execute in a reasonable amount of time. Other hard-to-solve mathematical problems have also been used to create computationally asymmetrical algorithms. With the NTRU approach, the basic computational context goes from integer arithmetic to polynomial algebra. Rather than encode information as digits representing numbers, NTRU uses sequences of integers that form the coefficients of a polynomial. That simplifies computation. "The NTRU system only uses adds and shifts, which are easier to perform than full integer arithmetic," Crenshaw said. The security algorithms are 2,000 times faster and 50 times smaller than other public-key methods, he said. The system can attach a secure digital "signature" to a document that can be verified as valid using only a public key. The private key is represented by two small polynomials, which generate a very large system of polynomials. The public key is derived from the two private-key polynomials using convolution and is able to generate the same set of polynomials as the two private-key polynomials. A digital message is then hashed and encoded as a pair of polynomials that are essentially random. A pair of polynomials in the set generated by the private keys is computed from the private key so that they are within a predetermined, close bound to the hashed message. One of the nearest-neighbor polynomials then becomes the digital signature. The original message is sent along with the signature, and the recipient, after using the same hashing algorithm, is able to verify that the resulting polynomial pair is within the predetermined distance from the polynomials representing the digital signature. No brute force The security of the system is ensured by the difficulty of finding close polynomials in a large collection of polynomials. Someone attempting to fake the digital signature might be able to find a pair of polynomials close enough to the hashed document to pass the verification step, but doing that by brute force becomes computationally impossible with only moderately long key sequences. In fact, the key sequences can be as short as 1,024 bits, conforming to the size of keys used by RSA encryption. The underlying polynomial operations are computationally very easy, however, which is what makes the method easy to implement in digital systems. The high speed and small computational requirements are ideal for radio-frequency applications that need some type of security. A current example is Mobile Corp.'s Speed Pass, which allows motorists to purchase gas simply by holding a small RF tag near an antenna on a gas pump. The system verifies the driver's ID and credits the purchase to the driver's account. In this case, the details of the purchase and the public key need not be secure, but a digital signature is required to verify that the purchase was made by the owner of the account. NTRU has received $38 million in financing from a variety of investors, including Texas Instruments Inc. and Sony Corp. [ April 10, 2002, 12:49 AM: Message edited by: Sip ]

Happy b-day Harut ... better late than never, eh? Here's a present for you. It's one of my favorites Just brings a big smile to my face everytime I look at it. Just look at it carefully and you'll see what I mean. http://zr2.cs.ucla.edu/sm/zig_best.gif

Oh then it's probably not hacking. It's pretty tough to get through the router, norton, and XP! I am assuming it's like a Linksys or a D-link router? Anyway, what motherboard do you have? Is it a computer you setup yourself (hardware) or a namebrand thing? I am thinking maybe it's hard drive problems ... more specifically, disk controller driver problems (I am assuming IDE). Do you know if you are using UltraDMA 66 or 100? When you bootup, do you see a message like "Promise Technologies ... " (when you turn on, after video card bios, motherboard bios, and before windows starts)? If you don't have the right drivers, it could be corrupting files on your disk and that's why it fails.

It is very possible. I know there are tons of joksters out there trying to hack into my machines ALL THE TIME. Some of them are dumb as a bag of nails but there are few that are really good. They actually broke into my home firewall but fortunately, I don't have anything to important (or not backedup) there. What kind of internet connection do you have? If you have "always on" like cable or DSL, you have to be VERY careful. If you have simple modem, then you have nothing much to worry about. There are several software packages available now that can protect your computer. Norton is one of the best from what I hear. You should check them out (it is part of their System Works package but I think they also sell it separately)... of course this is assuming you have a windows based PC

Sometimes it is pretty amazing what you can find on Google! Also, www.deja.com is a very good source. Now it redirects to http://groups.google.com and it basically searches all newsgroup archives. Can you believe I am almost done with university and I have been to the Library about 3 times? And even then, each time I go there to copy things on the copy machine I feel so shameful

quote:Originally posted by Harut:

Ok I found out what it is. It is pretty interesting ... it does graphics using text as I was suspecting !!! I found the files you want and a sample program at some site. I compiled it with Visual C and everything works great. I put a zip file with the source and my compiled exe at CLICK HERE. I compiled using >cl circles.cpp msoftcon.cpp (circles is the program and msoftcon is the "library". Circles includes the msoftcon.h file so you need that too) In case you need more info or the Visual C project files, go to THIS SITE. Happy coding!!!

What do you mean by console graphics? I have never heard of such a thing. You mean graphics using "ASCII" art? C/C++ has no standard thing for graphics. You have to use special libraries (like OpenGL, etc) or do it in Windows. Either way, I could help I think so don't worry ... just give me some more details (what compiler are you using and what you have to do)

Yah, hopefully they wont be Jew Cyborgs By the way, I had a coworker who's name was Ed Wong. His answering machine message said (in a thick accent): "You have reached the WONG number..." http://zr2.cs.ucla.edu/Sip/zr2/roflmao.gif

quote:Originally posted by highflyer:The blindness and ignorance of btoh Turkey and Isreal offend me! The problem is that I dont think it's either blindness or ignorance. It's all very carefully planned and "dirty" international politics. That is what trully disturbs me. I am sure they all know exactly what went on and what is going on. [ April 09, 2002, 08:15 PM: Message edited by: Sip ]

I pretty much forgot what the x-x thing was really about ... I think it was that polynomial thing right? x-x is usually 0 in my world. But I agreed with you about when things go to infinity and you have 0/0 or inf/inf or things like that. However, if I have: a=b a-b sometimes is not 0 in what I do!!! but a-a and b-b are almost always 0. But that's just an artifact of finite precision arithmatic of computers. Actually, I think that (x-x) can be used to prove Edita's 2+2=5 (at some point you divide both sides by x-x in the proof But I couldn't come up with anything cool. I have seen a bunch of 1=2 proofs on the web though. So you can use those proofs to show 4=5 (by induction). Here's what someone had posted on the web a while back which proves 1=2: code:ln 2 = 1 - 1/2 + 1/3 - 1/4 + 1/5 - 1/6 + 1/7 - 1/8 + 1/9 - 1/10 + 1/11 - 1/12 + ...-> 2ln 2 = 2 - 1 + 2/3 - 1/2 + 2/5 - 1/3 + 2/7 - 1/4 + 2/9 - 1/5 + 2/11 - 1/6 ... = 1 + 2/3 - 1/2 + 2/5 - 1/3 + 2/7 - 1/4 + 2/9 - 1/5 + 2/11 - 1/6 ... Now, collecting terms of equal denominator, we have: 2ln 2 = 1 - 1/2 + (2/3 - 1/3) - 1/4 + (2/5 - 1/5) - 1/6 + ... = 1 - 1/2 + 1/3 - 1/4 + 1/5 - 1/6 + ... = ln 2 Now, as ln 2 != 0, we can divide through by ln 2 to get: 2 = 1 I still don't know where that proof goes wrong! Anyone have any ideas?

Cool Harut jan ... if people are less than 130 years (not a bad assumption), then there must be at least 2 people with the same b-day. About the hair thing, I am going to say YES. In about 20 years, I will probably have the same amount of hair as Azat --->

OK here's one of my favorites ... I remember it from my undergrad discrete math class (that was one of the most fun math classes I have ever taken). Problem: There are 50,000 people in a small town. Can you find 2 people in that town that were born on the same day? Can you prove it?

quote:Originally posted by Edita:Hi:) 2+2=5, How it happens???????????? Ok I'll do the Engineering proof: 2.4 + 2.4 = 4.8 (2 significant digits) 2 + 2 = 5 (1 significant digit) Welcome to the world of digital computers!!!

Wow thanks!

quote:Originally posted by hagarag:... Perhaps second time around I will produce some Armenian-Chinese children similar to the richest man in Russia. Dude you gotta be kidding me! Armenian Chinese? Are you serious? Who is this richest guy in Russia?

quote:Originally posted by Harut:Sip jan, here comes one more. code:int i, n=20;for(i = 0 ; i <-n ; i --) printf("-"); i changed the " " (space) between "<" and "n" to "-". The third one was correct but this one I don't think will work When you start, i=0. 0<-20 is false so the loop will not execute. 2 down, 1 more to go

quote:Originally posted by Domino:armenians.com/forum is a forum and do you know what a forum is ? If you want to write something destinated only to me you can PM me, this is why PM's exist afterall..... But all the rest of us would miss all this "fun" http://zr2.cs.ucla.edu/Sip/zr2/barf.gif I am so glad Anoush (who unfortunately has the same nickname as my mom ) is so kind enough to expose this amazingly evil creature we call Domino. Domino, it's all your fault ... the genocide, the palestinians, the hunger in Africa, the Hollocust, the Hindenburg, the atomic bombs in hiroshima and Nakazaki, Chernobil, Global Warming, Mars Rover failure ... it's all because of you ...

Happy Birthday

By the way, Harut I think you are probably ready for the following problem: C/C++ Programming Problem Please find three ways to change one character in the following code so that the resulting code will print 20 times - (minus sign)Remember : for each solution you can only change one character, and there are three different solutions (yes, space is one character too). code:int i, n=20;for(i = 0 ; i < n ; i --) printf("-"); Basically it says you can't add or delete anything. Just "change" one character (including blanks). The output should be "--------------------" (20 minus signs). It took me a while to figure it out so it is definitely not atrick question or a joke. It makes you "think" when you see that only changing one character can have such dramatic effects ! Now go and try to debug 1 million lines of code in a real program !!!

Once you get used to power of C/C++, everything else seems like a toy. In C, you have control over EVERYTHING. Read/Write anything you want from/to any part of the memory ... it also means you could really screw things up if you don't know what you are doing and if you are not carefull (well, these days, worst case your program will crash )

quote:Originally posted by MosJan:what can we use this C++ for ??? MOvses Almost every program you see running on your computer was written in C/C++. The windows/unix/linux operating systems are all written in C/C++. Even C/C++ compilers are written in C/C++!!!!!!!! (the compiler takes a C/C++ souce and makes the executable program that you can run). Harut jan, one down, 2 to go

When I was there at some restaurant, I don't know what I ordered but they brought me raw duck meat ... that was the most discusting thing I have ever eaten. The waitress couldn't understand anything I was saying so instead of making the situation worse (who knows what she would have brought me instead) I ate the frigging thing http://zr2.cs.ucla.edu/Sip/zr2/barf.gif ... Paris and San Fransisco ... both are on the end of my list of places I want to be

quote:Originally posted by Arpa:The majority of Americans may be watching their favorite soap opera, ... That was a very nice breakdown of how things are. I really enjoyed reading it!

quote:Originally posted by hasmiek:oh c'mon Sip; you seem to be an american citizen with a brainium. except when you start talking about carrots that is...but maybe that's a male thing... smilies/blush.gif I was hoping no one would see that carrot thing. But it was there ... everything was setup for the punchline ... I just couldn't resist smilies/blush.gif About American media ... although AR is right that it is owned and operatred by the Jews, I haven't noticed a distinct biased. As thoth stated, the media here is about money ... advertising dollars ... they want to have as many viewers as possible for as long as possible. For a nation where the "weather" channel is the most watched cable tv channel (yes, go figure) ... that would mean a lot of things ... such as giving an update and the all important weather every 2 minutes between the killings in Israel and the civil wars in Africa. smilies/lol.gif And this is of course talking about the more "serious" sources such as CNN and FOX News and this MSNBC. That's why I hate the news here... it is definitely biased towards the dramatic and the shocking! Example: "WOW LOOK ... Mister So and So said Death To America in his speach today. His country decided to hate us today! They want us dead. THIS IS A HUGE SHOCK TO ALL OF US IN THE NEWS ROOM..." It looks and sounds funny but that's how they report most things! Another example: About 2 hours after the second plane hit the world trade center, CNN, in their great wisdom, decided to show Palestinian looking people jumping up and down screaming in joy and shooting their guns ... I think I was the only one at the time to realize that the planes hit here at 9AM. They were showing the video at 12PM local time. The people jumping up and down were in broad daylight ... THERE IS NO WAY THAT VIDEO HAD ANYTHING TO DO WITH WHAT HAPPENED!!!(those parts of the world were still in darkness of night) ... Even if the video was true, it was in very poor taste to show people jumping off buildings and that video at the same time ... a really ugly moment in Journalizm I think (and sadly, this is only one example of countless many). Unfortunately, some naive and simple people, blinded by those images, shock, and confusion, went to streets looking for anyone that looked anything like those on TV and beat them to a bloody pulp (and killed in some cases) [ April 05, 2002, 11:48 PM: Message edited by: Sip ]