Alerts This Week
Warning Icon 1 677
Alerts This Week
Warning Icon 1 677

Stay Ahead With Linux Security News

Filter Icon Refine news
X Clear Filters
X Clear Filters
View More

Get the latest News and Insights

Get the latest Linux and open source security news straight to your inbox.

Community Poll

What got you started with Linux?

No answer selected. Please try again.
Please select either existing option or enter your own, however not both.
Please select minimum {0} answer(s).
Please select maximum {0} answer(s).
/main-polls/150-what-got-you-started-with-linux?task=poll.vote&format=json
150
radio
0
[{"id":483,"title":"Self-taught through trial and error","votes":545,"type":"x","order":1,"pct":78.42,"resources":[]},{"id":484,"title":"Formal training or courses","votes":30,"type":"x","order":2,"pct":4.32,"resources":[]},{"id":485,"title":"A job that required it","votes":34,"type":"x","order":3,"pct":4.89,"resources":[]},{"id":486,"title":"Other","votes":86,"type":"x","order":4,"pct":12.37,"resources":[]}] ["#ff5b00","#4ac0f2","#b80028","#eef66c","#60bb22","#b96a9a","#62c2cc"] ["rgba(255,91,0,0.7)","rgba(74,192,242,0.7)","rgba(184,0,40,0.7)","rgba(238,246,108,0.7)","rgba(96,187,34,0.7)","rgba(185,106,154,0.7)","rgba(98,194,204,0.7)"] 350
bottom 200
Loading...

Explore Latest Linux Security news

We found 2 articles for you...
67

NIST Chooses Keccak As SHA-3 Successor After Competitive Evaluation

A US government agency has selected cryptographic hash function Keccak as the new official SHA-3 algorithm.. The National Institute of Standards and Technology's decision to pick the nippy system as the replacement for SHA-1 and SHA-2 marks the end of a six-year competitive process. Five algorithms were left in the running at the end, including crypto-guru Bruce Schneier's Skein. The link for this article located at The Register UK is no longer available. . The National Institute of Standards and Technology's decision to pick the nippy system as the replac. government, agency, selected, cryptographic, function, keccak, official, sha-3. . LinuxSecurity.com Team

Calendar 2 Oct 03, 2012 User Avatar LinuxSecurity.com Team Cryptography
67

NIST Announcement: SHA-3 Finalist Featuring Skein Candidate

NIST is about to announce the new hash algorithm that will become SHA-3. This is the result of a six-year competition, and my own Skein is one of the five remaining finalists (out of an initial 64).. It's probably too late for me to affect the final decision, but I am hoping for "no award." It's not that the new hash functions aren't any good, it's that we don't really need one. When we started this process back in 2006, it looked as if we would be needing a new hash function soon. The SHA family (which is really part of the MD4 and MD5 family), was under increasing pressure from new types of cryptanalysis. We didn't know how long the various SHA-2 variants would remain secure. But it's 2012, and SHA-512 is still looking good. The link for this article located at Schneier on Security is no longer available. . NIST readies to unveil SHA-3; Keccak selected as contender in an exhaustive contest. Implications of choices raise significant apprehension.. Hash Functions, SHA-3 Finalist, Cryptographic Algorithms, NIST Competition. . LinuxSecurity.com Team

Calendar 2 Sep 24, 2012 User Avatar LinuxSecurity.com Team Cryptography
67

Examining SHA-1 Cracking and Its Legal and Security Impact

SHA-1 is one of the most prevalent forms of a secure hash algorithm used in the legal and security industry. Now that Professor Xiaoyun Wang and her associates in Tsinghua University and Shandong University of Technology have officially cracked the SHA-1 hashing algorithm, the fallout will begin. This won't actually be due to security concerns for the most part, but the legal ramifications may be severe. . A digital hash is basically a fingerprint of a data file. The perfect hashing algorithm will always produce a unique-enough finger print for a particular data stream that it is practically impossible to find a different data stream matching that finger print. Professor Wang did just that and found a different data stream with an identical finger print that matches the SHA-1 hash of the original data stream. While hashes have been broken before, the SHA-1 hash was published by the NIST in the1995 and was believed to be solid for a long time to come. But professor Wang surprised the cryptographic community in early 2005 with the announcement that she and her team had figured out a way to speed up the cracking process by more than 11 orders of magnitude. The link for this article located at ZDNet Blogs is no longer available. . Exploring the consequences of SHA-1 vulnerabilities and their influence on cybersecurity measures and legal consequences.. SHA-1 Cracking, Security Practices, Legal Standards, Cryptographic Risks. . LinuxSecurity.com Team

Calendar 2 Jan 23, 2007 User Avatar LinuxSecurity.com Team Cryptography
67

Crypto 2006: New Attack Method Against SHA-1 Hash Algorithm

Cryptographic experts at the Crypto 2006 conference have demonstrated a modified method of attack against a reduced variant of the SHA-1 hash algorithm. The new method is an attack which, for the first time, allows at least a part of the message to be freely selected, for example as straight text. Previous approaches, for example the collision attack by Xiaoyun Wang and her team, which attracted considerable attention, were merely able to produce almost completely different hash twins of the same length, both consisting of meaningless gibberish. . The link for this article located at Heise-Security.co.uk is no longer available. . The link for this article located at Heise-Security.co.uk is no longer available.. cryptographic, experts, crypto, conference, demonstrated, modified, method, attack. . LinuxSecurity.com Team

Calendar 2 Aug 28, 2006 User Avatar LinuxSecurity.com Team Cryptography
67

Exploring Modern Security for Hash Algorithm Weaknesses

Hashing has long been used as a means to verify data elements. Parity bits were originally used to confirm that a data transmission was received correctly and helped to detect any single-bit errors. However, parity didn. In comes hashing as we know it today. The modern hashing algorithms are designed to help verify the integrity of a data element. Yet, as our needs to verify file contents and data transmissions evolve, we continually realize that better solutions and algorithms are needed. Better hashing algorithms are constantly in the works. However, as the past would indicate, cryptographers and hackers alike continue to find issues with each successive algorithm that is released. As one algorithm is broken, another is developed The link for this article located at Info Sec Writers is no longer available. . In comes hashing as we know it today. The modern hashing algorithms are designed to help verify the . hashing, means, verify, elements, parity, originally. . LinuxSecurity.com Team

Calendar 2 Aug 07, 2006 User Avatar LinuxSecurity.com Team Cryptography
67

Debate Over SHA-1 Integrity After Refined Attack Raises Alarms

Three Chinese researchers have further refined an attack on the encryption standard frequently used to digitally sign documents, making the attack 64 times faster and leaving cryptographers to debate whether the standard, known as the Secure Hash Algorithm, should be phased out more quickly than planned. . The attack, presented last week at the Crypto conference in Santa Barbara, Calif., would allow a forger to create two documents that return the same digital fingerprint, a short sequence of numbers that represent the contents of a much larger document. While experts debate whether the attack is practical, the trend seems to indicate that the Secure Hash Algorithm (SHA-1) is succumbing to less processor-intensive breaks, said William E. Burr, manager of the the Security Technology Group at the National Institute of Standards and Technology (NIST). "It is certainly somewhat alarming," Burr said. He likened the rapid advances in attacks on SHA-1 to a submarine under fire. "What we are figuring out right now is whether we have to do a crash dive drill-- where some people might not make it inside before we close the hatch, but at least we will save the ship." The link for this article located at SecurityFocus is no longer available. . The attack, presented last week at the Crypto conference in Santa Barbara, Calif., would allow a for. three, chinese, researchers, further, refined, attack, encryption, standard, frequently. . LinuxSecurity.com Team

Calendar 2 Aug 24, 2005 User Avatar LinuxSecurity.com Team Cryptography
67

MD5CRK Initiative: Addressing the Collision Problems in MD5 Hashing

The MD5CRK project seeks to prove empirally that MD5 is a hash algorithm that exhibits the not-so-cryptographically-sound property of collisions. This has already been proven theoretically, but nobody really paid attention, so this distributed computing project was created. . . . . The MD5CRK project seeks to prove empirally that MD5 is a hash algorithm that exhibits the not-so-cryptographically-sound property of collisions. This has already been proven theoretically, but nobody really paid attention, so this distributed computing project was created. While many people think hash algorithms are just used to create entries in /etc/shadow, MD5 is used in many applications of cryptography -- from SSL to IDS software to digital dignatures. This is despite published weaknesses and better (and freely available) drop-in replacements. . The MD5CRK project seeks to prove empirally that MD5 is a hash algorithm that exhibits the not-so-cr. md5crk, project, seeks, prove, empirally, algorithm, exhibits, not-so-cr. . LinuxSecurity.com Team

Calendar 2 Mar 05, 2004 User Avatar LinuxSecurity.com Team Cryptography
News Add Esm H340

Get the latest News and Insights

Get the latest Linux and open source security news straight to your inbox.

Community Poll

What got you started with Linux?

No answer selected. Please try again.
Please select either existing option or enter your own, however not both.
Please select minimum {0} answer(s).
Please select maximum {0} answer(s).
/main-polls/150-what-got-you-started-with-linux?task=poll.vote&format=json
150
radio
0
[{"id":483,"title":"Self-taught through trial and error","votes":545,"type":"x","order":1,"pct":78.42,"resources":[]},{"id":484,"title":"Formal training or courses","votes":30,"type":"x","order":2,"pct":4.32,"resources":[]},{"id":485,"title":"A job that required it","votes":34,"type":"x","order":3,"pct":4.89,"resources":[]},{"id":486,"title":"Other","votes":86,"type":"x","order":4,"pct":12.37,"resources":[]}] ["#ff5b00","#4ac0f2","#b80028","#eef66c","#60bb22","#b96a9a","#62c2cc"] ["rgba(255,91,0,0.7)","rgba(74,192,242,0.7)","rgba(184,0,40,0.7)","rgba(238,246,108,0.7)","rgba(96,187,34,0.7)","rgba(185,106,154,0.7)","rgba(98,194,204,0.7)"] 350
bottom 200
Your message here