How Strong Are Your Passwords?

Fordham, David R.
May 2008
Strategic Finance;May2008, Vol. 89 Issue 11, p42
Academic Journal
The article examines computer user identification and passwords as vulnerabilities to identity theft when engaged in electronic commerce. There is an inherent tension between the need to keep passwords accessible and secure. Suggestions on how to create and remember "strong" passwords which have no relationship to the computer user's personal life are given.


Related Articles

  • PKI is key to secure e-commerce. Railsback, Kevin // InfoWorld;01/29/2001, Vol. 23 Issue 5, p64 

    Focuses on the benefit offered by public key infrastructure (PKI) and encryption in e-commerce. Significance of digital certificates; How companies benefit from the technologies.

  • Enhanced Secure Trusted AODV (ESTA) Protocol to Mitigate Blackhole Attack in Mobile Ad Hoc Networks. Singh, Dilraj; Singh, Amardeep // Future Internet;2015, Vol. 7 Issue 3, p342 

    The self-organizing nature of the Mobile Ad hoc Networks (MANETs) provide a communication channel anywhere, anytime without any pre-existing network infrastructure. However, it is exposed to various vulnerabilities that may be exploited by the malicious nodes. One such malicious behavior is...

  • Encryption software protects online transactions. Rabbapragada // Security: Solutions for Enterprise Security Leaders;Sep99, Vol. 36 Issue 9, p101 

    Discusses the use of security solutions to protect online transactions. Public key infrastructure; RSA Data Security Inc.'s development of the main security standard used by encryption software packages; Issuance of a certificate authority to verify digital certificates.

  • SSL breach is not fatal. Kerstetter, Jim // PC Week;07/06/98, Vol. 15 Issue 27, p35 

    Reports on a security breach discovered in Secure Sockets Layer (SSL), the encryption used in electronic commerce transactions. Daniel Bleichenbacher, the Bell Labs researcher who discovered the breach; Why the breach is not considered a major security problem; What a hacker would have to do to...

  • A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time. Paulus, Sachar; Takagi, Tsuyoshi // Journal of Cryptology;2000, Vol. 13 Issue 2, p263 

    We present a new cryptosystem based on ideal arithmetic in quadratic orders. The method of our trapdoor is different l_GCY_om the Diffie-Hellman key distribution scheme or the RSA cryptosystem. The plaintext m is encrypted by mp[supr], where p is a fixed element and r is a random integer, so our...

  • Cutting-Edge Security. Crowe, David // Wireless Review;01/01/2001, Vol. 18 Issue 1, p40 

    Provides information on public-key encryption and private-key encryption as security systems for use in wireless business. Advantages and disadvantages of public-key encryption and private-key encryption; Authenticity of wireless security.

  • Zheng and Seberry’s public key encryption scheme revisited. Baek, Joonsang; Zheng, Yuliang // International Journal of Information Security;2003, Vol. 2 Issue 1, p37 

    In this paper, we prove that a slightly modified version of Zheng and Seberry’s public key encryption scheme presented at Crypto ’92 is secure against adaptive chosen ciphertext attacks in the random oracle model, assuming the Gap Diffie–Hellman problem is intractable. A...

  • Is PKI finally securing its future? Braue, David // Australian Personal Computer;Jul2001, Vol. 22 Issue 7, p121 

    Focuses on the adoption of public key infrastructure (PKI) technology. Facilitation of encryption and decryption of information for the purpose of sending it securely across the Internet; Combination of the public key with a unique digital signature issued by a certification authority; Single...

  • A Public Key Cryptosystem based on IFP and DLP. Meshram, Chandrashekhar; Meshram, S. A. // International Journal of Advanced Research in Computer Science;Sep/Oct2011, Vol. 2 Issue 5, p616 

    Design the most existing cryptosystem incorporate just one cryptographic assumption, such as integer factorization problem or discrete logarithms. These assumptions appear secure today; but, it is possible that efficient algorithms will be developed in the future lo break one or more of these...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics