Which is better  and more Secure RSA or Elliptic Curve Cryptography?Please Justify your answers?
916413
as both are public key encryptions, both should be equally secure, but ecc is being adopted more often simply because it uses smaller key lengths viz a 163 bit ecc key would be equivalent to a 1024 bit rsa key. different algo\nlol
208677
PGP Universal Series 500 seems to be the answer to what you are looking for!  \n\n"PGP Universal Series 500 offers comprehensive, integrated enterprise security for all encryption applications covering all types of internal users, proprietary information, and external partners."\n\nhttp://www.pgp.com/products/universal/index.html\n(this link is for the system overview)\n\nhttp://www.pgp.com/images/wdefe_diagram.jpg\n(this link has a neat picture of the whole thing)\n\nHope this helps!
201194
Cryptainer LE have it all and is free\n\n http://www.cypherix.co.uk/cryptainerle/?adv=ec_es
20134
RSA Laboratories usually has good information,\n\nhttp://www.rsasecurity.com/rsalabs/node.asp?id=2247\n\nhttp://www.rsasecurity.com/rsalabs/node.asp?id=2254
651696
Timing attacks\nKocher described a new attack on RSA in 1995: if the attacker Eve knows Alice's hardware in sufficient detail and is able to measure the decryption times for several known ciphertexts, she can deduce the decryption key d quickly. This attack can also be applied against the RSA signature scheme. In 2003, Boneh and Brumley demonstrated a more practical attack capable of recovering RSA factorizations over a network connection (e.g., from a Secure Socket Layer (SSL)-enabled webserver). This attack takes advantage of information leaked by the Chinese remainder theorem optimization used by many RSA implementations.\n\nOne way to thwart these attacks is to ensure that the decryption operation takes a constant amount of time for every ciphertext. However, this approach can significantly reduce performance. Instead, most RSA implementations use an alternate technique known as cryptographic blinding. RSA blinding makes use of the multiplicative property of RSA. Instead of computing cd mod n, Alice first chooses a secret random value r and computes (rec)d mod n. The result of this computation is rm mod n and so the effect of r can be removed by multiplying by its inverse. A new value of r is chosen for each ciphertext. With blinding applied, the decryption time is no longer correlated to the value of the input ciphertext and so the timing attack fails.
174496
Cain and Abel is great when used for the right pourposes. . Ive been in the industry for a while and find its capabilities strong if you find one of your users stranded without their passowrd.\n\nAlso helpful when employees leave the company and decide to boycot your digital security protocols.
676773
Since your examples are of the form "x^y mod N",\nI would recommend that you look at the page:\n\nhttp://en.wikipedia.org/wiki/Exponentiation_by_squaring\n\nand, in particular, the section titled:\n\nFurther applications\n\nwhere it discusses the most efficient method for\n"fast computation of large exponents modulo a number".\nFor your examples, it isn't as critical, but if you're\nexploring cryptography, you'll end up having to\ndeal with much larger exponents.\n\nFor your specific examples, you could use a "bignum"\npackage and just brute-force compute 123^7 and take\nthe remainder after division by 187.
918182
Oh yes you can do it with a free program.  In fact, some of the best encryption programs are free because they use open source code and well accepted ciphers and Hashes.  Open source means that people who are really into this stuff have reviewd the code and any flaws that were found were fixed.  Commercial software does not get that kind of peer review.  Often they botch their implementation, but since there is little or no peer review, the flaws remain unknown, except to hackers.\n\nThe first answerer said GNU-PG, and that is a good one.  Another good one is TrueCrypt.\n\nTrueCrypt is a free, open source, file and disk encryption system that is very highly regarded.  It uses several well respected encryption ciphers like AES, Serpent, Twofish, Triple DES as well as several standard Hash algorithms.\n\nI played around with it for a while, but since I never keep sensitive data on my PC, I've never had a real occassion to use it for real.
715173
For encryption they use prime numbers.  I'd go backwards and find a way to play a prime number on a musical instrument.  If there's a rythm, it would be easy to crack the code.
543381
Yes. the RHS of the first is equivalent to xor(P,Q). This becomes an inclusive or when the or(Q,...) is added. Not(P) as suggested above doesn't give the correct result when Q and P both = true.
905780
It's not easy to say objectively which one is absolutely the best. Many approaches can be used. One of them is represented on this site:\n\nwww.keylogger.org\n\nKeyloggers can alsobe downloaded from there.
789429
Why do you need to implement it yourself? Why not use the Crypt::Rijndael_PP module from CPAN?\n\nIf anything, you could use the module as a working implementation to study ( or copy from ).\n\nEDIT: Changed module name.
698156
Try these sites buddy:\nwww.secureaction.com/encryption_free\nwww.reflex-magnetics.co.uk/products/datavault/page5\ngood luck!!!!
444737
SSL is the current standard for data encryption on the Internet.  Encryption will not solve the problem alone and good application design and business practices will help as well.\n\nIf you're just starting off I'd outsource the problem to a reputable contracting firm.
177017
The incredible growth of the Internet has excited businesses and consumers alike with its promise of changing the way we live and work. But a major concern has been just how secure the Internet is, especially when you're sending sensitive information through it. \nLet's face it, there's a whole lot of information that we don't want other people to see, such as: \n\nCredit-card information \nSocial Security numbers \nPrivate correspondence \nPersonal details \nSensitive company information \nBank-account information \n\nE-commerce relies on the ability to send information securely.\n \nInformation security is provided on computers and over the Internet by a variety of methods. A simple but straightforward security method is to only keep sensitive information on removable storage media like floppy disks. But the most popular forms of security all rely on encryption, the process of encoding information in such a way that only the person (or computer) with the key can decode it. \n\nIf you want to learn more about encryption, check out the rest of this article from the first site below:
260677
Paypal is safe, it uses the latest RSA encryption software. To include the paypal option on your website you should talk with them!
504870
They have the same range.  WPA and WEP are types of encryption and do not have a bearing on the actual output or transmission power associated with them.\n\nWPA is much more secure than WEP, just for your info.