text:
Uncle Ben
From Wikipedia, the free encyclopedia
Jump to: navigation, search
This article is about the Spider-Man comic book character. For the food brand, see Uncle Ben's.
Uncle Ben
Publication information
Publisher
Marvel Comics
First appearance
Amazing Fantasy #15 (August 1962)
Created by
Stan Lee (writer)
Steve Ditko (artist)
In-story information
Full name
Benjamin Parker
Supporting character of
Spider-Man
Benjamin "Ben" Parker, usually called Uncle Ben, is a fictional character appearing in American comic books published by Marvel Comics, commonly in association with the superhero Spider-Man. Uncle Ben first appeared in Amazing Fantasy #15 (August 1962) and was created by writer Stan Lee and artist Steve Ditko. Modeled after American founding father Benjamin Franklin, the character plays an influential role in the Spider-Man comic books.
Contents
[hide]
1 Publication history
1.1 Notability of death
2 Fictional character biography
3 Other versions
3.1 Trouble
3.2 Bullet Points
3.3 House of M
3.4 Marvel Noir
3.5 Spider-Verse
3.6 Ultimate Marvel
3.7 What If?
3.8 Derailed Alt-Ben Parker
4 "With great power comes great responsibility"
5 In other media
5.1 Television
5.2 Film
5.3 Video games
6 Franklin Richards' Uncle Ben
7 Son of Spider-Man
8 The Other Uncle Ben
9 References
10 External links
Publication history[edit]
Uncle Ben first appeared in Amazing Fantasy #15 (August 1962) and was killed in the very same issue. Although his history as a supporting character was very brief, Uncle Ben is an overshadowing figure in Spider-Man's life, often appearing in flashbacks.
Notability of death[edit]
The murder of Uncle Ben is notable as one of the few comic book deaths, that has never been reversed in terms of official continuity. He was a member of the "Big Three", referring also to Jason Todd (an associate of Batman) and Bucky (an associate of Captain America) whose notable deaths, along with Ben's, gave rise to the phrase: "No one in comics stays dead except for Bucky, Jason Todd, and Uncle Ben". Later, the revivals of both Bucky and Jason in 2005 led to the amendment, "No one in comics stays dead except Uncle Ben". The violent killing of Uncle Ben, done by a common street criminal, also shares multiple similarities to the death of Thomas and Martha Wayne, the parents of Batman, which sometimes is included in the saying.[1]
There have been examples of Uncle Ben remaining alive in alternative timelines, including stories featured in Marvel's What If (one of which he forces Peter to unmask in front of J. Jonah Jameson), and a storyline of the 1994 Spider-Man animated series featured a universe where Uncle Ben had never died, and Peter Parker became a successful industrialist, having never really bothered to use his powers responsibly as everything always seemed to work out for him. This fact is used to defeat the rampaging Spider-Carnage by exposing him to the one person he will trust and listen to: the Uncle Ben of that reality.[volume & issue needed]
A story-line in the official series Friendly Neighborhood Spider-Man seemingly suggested that Ben may be alive. This Ben, however, was actually from a parallel universe where Aunt May died in a random accident, leaving him to raise Peter. This alternate Ben came to the planet Earth of regular Marvel comics (the 616 reality) as part of an evil plan devised by the Hobgoblin of 2211 to defeat the Spider-Men of different eras.[volume & issue needed]
During the Clone Conspiracy storyline, when Peter's clone Ben Reilly who named himself after Uncle Ben and Aunt May, taking Ben's first name and May's last to differentiate himself from Peter used the Jackal's technology to revive various old enemies and allies of Peter Parker, he offered to bring Uncle Ben back to life while trying to win Peter to his point of view,[2] but although tempted at the offer, Peter concluded that the reason Ben had not brought 'their' uncle back on his own was that he knew that Uncle Ben would disapprove of his "nephew's actions", as Ben's plan would see everyone on Earth granted immortality while dependent on him to supply the medication needed to stabilize their cloned bodies.[3]
Fictional character biography[edit]
Ben Parker was born in Brooklyn, New York. He trained to be a military police officer,[4] and also spent time as a singer in a band. He had known his future wife, May Reilly since their high school days, but she in turn was naively interested in a boy who was involved in criminal activities. When he came to her one night and proposed to her on the spot, Ben was there to expose him as a murderer, and to comfort the heart-broken May when the boy was arrested. Their relationship evolved into love, and they enjoyed a happily married life. When Ben's younger brother Richard Parker and his wife Mary were killed in a plane crash, Ben and May took in their orphaned son Peter and raised him as their own.[5]
Ben was very protective of Peter, going as far as fighting some of the bullies that tormented young Parker. Peter became friends with Charlie Weiderman in high school, a teen even more unpopular than he was. However, Charlie often provoked the trouble with the other teens. One day, he was chased to the Parker home by a group of bullies led by Rich and Ben intervened. Ben told them that if they wanted Charlie, they would have to go through him. Rich tried to, but was surprised by Ben's army training. As soon as the bullies were gone, he told the boy that he was not welcome at the house or with Peter because of his provoking the bullies and not being able to tell the truth.[6]
In high school, a radioactive spider bite gave Peter superhuman powers. Creating the costumed identity of Spider-Man for himself, Peter sought first to exploit his newfound powers as a masked wrestler and then as a television star. Coming from a television appearance, Spider-Man saw a burglar[7] being chased by a security guard. The guard called for Spider-Man to stop the thief, but the nascent Spidey refused on the grounds that catching criminals was not his job. The robber got away.[8]
When Peter later returned home, he was informed by a police officer that his beloved Uncle Ben had been killed by a burglar. Outraged, he donned his Spider-Man costume and captured the man only to realize to his horror that it was the same burglar whom he could have effortlessly captured earlier at the studio. As a result, Peter considered himself morally responsible for Ben's death and resolved to fight crime as a superhero — realizing that with great power comes great responsibility — and vowing never to let another innocent person come to harm if he could help it.[8]
Ben Parker's death was truly avenged when the burglar returned for the money once more, threatening Aunt May. The burglar died from a heart attack upon beholding his old nemesis Spider-Man once again and learning that Spider-Man and Peter Parker were one and the same person.[9]
In Amazing Spider-Man Family #7, May relates to Peter her account of meeting Ben for the first time.
Ben briefly appeared in Amazing Spider-Man #500; after Spider-Man played a vital role in preventing the resurrection of Dormammu, an unidentified higher power provided Doctor Strange with a small box that he felt he had to give to Spider-Man as a reward for his role in events. When Peter opened the box on the roof of his apartment building, it contained a note saying "You have five minutes. Spend them as you will", followed by Ben appearing on the roof. It was revealed that this Ben - whether a ghost or Ben having been temporally relocated from the moment before his death - remembered being out for the walk that resulted in him getting shot but nothing afterwards, although he concluded that the events leading to him being on that roof were not important. In their talk Ben said that the only thing that would disappoint him about Peter is if Peter ever settled for less because he was afraid of reaching for more. This helps Peter to see that he had a good life for all its hardships, recognizing that he has always used what he has, and Ben assures Peter that he is proud of him before he vanishes.[10]
During the 2008–2009 "Dark Reign" storyline, Uncle Ben makes an appearance in the Underworld when Hercules attends the trial of Zeus, directing Amadeus Cho as he attempted to find his parents in the afterlife.[11] In the "Amazing Grace" storyline, Ben appears as an apparition to Spider-Man while battling a horde of demons and gargoyles, telling him that his death is not Peter's or anyone's fault. However, one enemy notices him and attacked only to disappear. This left Spider-Man puzzled if he was imagining Ben or he was really talking to his ghost.[12]
When Ben Reilly adopted the identity of the Jackal and set up an elaborate plan to use Warren's new cloning process to make the world immortal, he attempted to win Peter's allegiance by showing him Ben's coffin and offering to bring Ben back to life.[2] However, although tempted by the idea, Peter realized that Ben never intended to bring 'their' uncle back to life because he would have done it already, coldly informing his clone that Uncle Ben would tell him that he was wrong.[3] At the conclusion of the crisis, Peter takes a moment beside the coffin containing Ben's corpse, acknowledging that Reilly's actions were wrong but wishing that he was there regardless.[13]
Other versions[edit]
Trouble[edit]
A version of Ben appeared in the Mark Millar, Terry Dodson 2003 limited series, "Trouble", with his brother Richie, who were involved with teenagers, May and Mary.[volume & issue needed]
None of the characters' last names were revealed. The story did not become canon because of its negative reception.[volume & issue needed]
Bullet Points[edit]
In this alternate reality, a young Ben Parker is working as a military policeman. He is assigned to security for Doctor Erskine, a scientist for the Captain America program. An assassination attempt on Erskine succeeds, killing Ben in the process. Later on, May still attempts to raise Peter on her own, but without the influence of Ben, Peter grows up to be angry, cynical and mean-spirited, going on to become the Hulk of this reality when he sneaks onto the test site that Rick Jones sneaked onto in the original version of events.[14]
House of M[edit]
In the House of M reality, Ben Parker is alive and, like the rest of the world, is aware that Peter Parker is Spider-Man. After recovering Peter's journal, with entries detailing that the world is not how it should be, Ben discovers that he is killed shortly after Peter gains his powers. He later helps Peter fake his death, photographing Spider-Man apparently hanging himself.[15]
Marvel Noir[edit]
In the Marvel Noir reality, Ben Parker is a social activist who was murdered by Norman Osborne's enforcers. He had previously been a decorated pilot and veteran of World War I, but he did not take pride in his service, believing that no just cause was fought for. His nephew Peter dons his old aviator uniform and wields his service revolver during his activities as Spider-Man.[16]
Spider-Verse[edit]
A version of Peter Parker named Patton Parnell lives with his abusive Uncle Ted on an unknown Earth. After the bite of an irradiated spider mutates him into an arachnid monstrosity, Patton infects his Uncle Ted with his offspring while declaring he taught him that "With great power comes a great appetite".[17]
An alternate Uncle Ben from an unknown reality appears in a flashback along with the version's Aunt May. In this reality they are portrayed as scientists. They informed Peni Parker that she was the only person able to carry on the project (after her father, the original SP//dr, died in battle), and accepted the responsibly, allowing the radioactive spider that formed the other half of SP//dr's CPU to bite her.[18]
In an unknown reality, Uncle Ben and Aunt May are with their nephew Peter at the hospital after he suffers an allergic reaction to the radioactive spider bite, leaving him in a coma. Because of this, they are out of their house when is burgled by the thief that killed Ben in the main universe. Peter transforms into Man-Spider and attacks Uncle Ben and Aunt May, but is thwarted by Spider-Man Noir. Six-Armed Spider-Man creates a cure for Peter, allowing him to live a normal life with Ben and May.[19]
The Earth-3145 version of Ben Parker was isolated in Ezekiel's bunker after Earth is decimated by nuclear fallout. Ben is later found by Silk, Spider-Man and the other Spider-Men when arrive while fleeing from the Inheritors.[20] Ben received his powers when he accompanied Peter to the science demonstration and was bitten by the spider instead of his nephew. Ben retired out of grief after his foe the Emerald Elf discovered his identity and killed his May and Peter. After entering Ezekiel's bunker upon being told about the Inheritors, his Earth was decimated when a nuclear blackmail plot by Otto Octavius went wrong. Although he initially declines to join the other Spiders in their final attack on the Inheritors, Spider-Man and Superior Spider-Man convince him to do so by arguing that he has only failed if he gives up, Peter in particular affirming that the advice of his own Uncle Ben has saved his world and made a difference every day.[21] He subsequently works with Spider-Ham to rescue Benjy Parker - the baby brother of Spider-Girl - and take him to another dimension for safety.[22] When the crisis is concluded, Ben accompanies Spider-Girl back to her home dimension, and decides to remain so that he can be the great-uncle that no other Ben Parker has had the chance to become.[23]
Ultimate Marvel[edit]
Ben Parker in Ultimate Spider-Man differs slightly from the original Ben Parker. In the Ultimate Spider-Man comics, Ben Parker is younger than his original counterpart. He is also a former hippie who wears his hair in a ponytail and teaches Peter to be nonviolent. Ben also reminisces about the period he lived on a commune. After Peter Parker went out for a walk, he came home and learned from a police officer that Uncle Ben was murdered.[24] Uncle Ben is seen one last time meeting Peter in the afterlife after his death.
What If?[edit]
Uncle Ben was featured in various issues of What If.
In one reality where May was killed by the burglar instead of Ben, Peter immediately went after the burglar, but accidentally pushed him out of the window of a warehouse during the fight, resulting in Ben taking the blame for the crime to save his nephew. Lacking the moral influence of Ben or the need to stay secret for his aunt, Peter broke out of the orphanage he was sent to and began to defeat criminals for the reward money, matters coming to a head when he nearly killed the Green Goblin in a fight. Attempting to break Ben out of prison, Ben nevertheless convinced him that he had to accept responsibility for his actions, prompting Peter to return to school and form a relationship with Mary Jane after Anna Watson took him in, culminating in Ben helping Peter in his crime-fighting activities after he was released from prison.[volume & issue needed]
In the first "What If" story regarding Spider-Man (named "classic"), it was Aunt May who went downstairs after hearing a noise, not wanting to wake up Ben. The same storyline plays out, with the burglar shooting May and Spider-Man apprehending him in the warehouse. In this story, Ben finds out about Peter's activities as Spider-Man relatively soon, and talks to him about it. Peter explains to him when he donned the costume and why, even telling him about letting the would-be murderer go that very same night he robbed the wrestling register. Peter breaks down, saying how everything was his fault. Ben responds with anger at himself, being weak in not being able to protect "his May". After Peter tells him he did not know and could not have possibly done anything, Ben instantly calms down and tells Peter to follow his own advice. He further inspires Peter to keep being Spider-Man, not because of regret or penance, but to protect and help all those who are weak and in need of help. Ben and Peter form an even closer relationship with Ben offering his support in many of Spider-Man's future battles. Eventually Ben becomes outraged at Jameson's constant smearing of Spider-Man's name, considering it an insult to May's memory. He eventually lets Jameson in on Spider-Man's identity, forcing Jameson in a position he is uncomfortable in as a journalist. He cannot expose Spider-Man without endangering Ben Parker, yet he also does not wish to support vigilantism. Eventually, he finds a middle road and unofficially employs Spider-Man so he can gain inside scoops on crimes being solved in the city. The story eventually ends with Spider-Man saving Bennett Brant and Betty Brant from Doctor Octopus, as well as fighting a Green Goblin who kidnapped Jameson to find out Spider-Man's real identity (having correctly surmised there was a reason Jameson had those inside scoops). At the end of it all, Peter and Ben shake hands with Ben saying they will face all dangers and the future together.[25]
Derailed Alt-Ben Parker[edit]
In an alternate reality shown in Friendly Neighborhood Spider-Man, an alternate reality was witnessed where May died in a random accident, prompting Peter to go into show business with Ben as his agent to make money. Peter's focus on his career prompts him to eventually leave home, simply paying Ben a percentage out of respect for their old relationship rather than any actual concern. This Ben was eventually 'derailed' into the 616 reality by the Hobgoblin of 2211 as part of her plan against the Spider-Men of various eras, leaving him shocked when he witnessed his destroyed house and the still-living May Parker. Confronting her, he ended up in a fight with Jarvis, with whom she at the time has a relationship with, but wandered away in confusion. Lacking direction, Ben wandered into an alleyway where he encountered a shadowy figure who offered him a gun, telling Ben that any action he takes would simply create another universe where he took the opposite action, so he might as well do what felt good. After this Hobgoblin was erased from history by a Retcon Bomb of her own invention, the Spider-Man of 2211 met with what he presumed to be the same Ben Parker to take him back to his own timeline. In a surprise twist, deciding he rather wanted to "stick around for a while", this Ben Parker shoots this future Spider-Man. At the same time, another Ben Parker was shown dead in the alley, meaning one Ben Parker had killed the other and taken his place.[26]
It was revealed that the Ben Parker who had died in the alleyway was the Uncle Ben of the alternate reality, while the Ben Parker who killed Spider-Man 2211 was, in fact, the Chameleon of 2211; the Chameleon had attempted to convince Ben to resort to murder, but Spider-Man correctly guessed that there were no circumstances under which Ben would do such a thing.[volume & issue needed]
"With great power comes great responsibility"[edit]
The thematic and often-quoted (including by the Supreme Court of the United States[27]) Spider-Man phrase with great power comes great responsibility is widely attributed to Uncle Ben. However, in Amazing Fantasy #15, where it first appears, it is not spoken by any character. In fact, Ben has only two lines in the entire comic. The original version of the phrase appears in a narrative caption of the comic's last panel, rather than as spoken dialogue. It reads, "...with great power there must also come -- great responsibility!".[28]
However, later stories and flashbacks that took place when Ben was still alive retroactively made the phrase one of Ben's many homilies he would lecture Peter with. Latter-day reinterpretations of Spider-Man, such as the Spider-Man film and the Ultimate Spider-Man comic, depict Ben as saying this phrase to Peter while he is still alive, in their last conversation. Both the aforementioned adaptations also had Peter lash out at Ben just after he says it, and both also mention his father.
The origins of the phrase pre-date its use in Spider-Man. In 1817, member of British parliament William Lamb is recorded saying, "the possession of great power necessarily implies great responsibility."[29] In 1906, Under-Secretary of the Colonial Office Winston Churchill said, "Where there is great power there is great responsibility",[30] even indicating that it was already a cultural maxim invoked toward government at the time. The sentiment is also attributed to Jesus in the Gospel of Luke, "Everyone to whom much was given, of him much will be required."[Luke 12:48]
Outside of Spider-Man, Logan Paul used the phrase in an apology on his Twitter account after he uploaded a controversial video in Japan's Suicide Forest.[31] The phrase was also used in a transformation story on DeviantArt where a young boy named Dan turns into Palutena from the Kid Icarus video game series.[32]
In other media[edit]
Television[edit]
Uncle Ben appeared in the 1960s Spider-Man television series. He appeared in the episode "The Origin of Spider-Man".
Uncle Ben is mentioned in the 1980s Spider-Man television series. In the episode "Arsenic and Aunt May", the Chameleon (after meeting the relative of the Burglar) escapes from prison and poses as a medium while using technology to make Aunt May seemingly see Ben's ghost.
Uncle Ben appeared in Spider-Man and His Amazing Friends, voiced by Frank Welker. He appeared in the episode "Along Came Spidey".
Uncle Ben appeared in Spider-Man: The Animated Series, voiced by Brian Keith (in "The Menace of Mysterio", "The Mutant Agenda" and the "Spider Wars" series finale). He appeared in the series as a spirit or seen in flashbacks talking to Peter Parker whenever his nephew gets frustrated the tough choices as Spider-Man. In the series finale when Spider-Man had to stop Spider-Carnage from destroying all reality, Spider-Man managed to make contact with an alternate reality of his uncle in a world where Peter Parker was a successful industrialist; realizing that Peter's counterpart in this reality had never failed or had any difficulties in life due to his casual attitude towards the crisis as opposed to Spider-Man or the other counterparts, Peter realized that Ben was almost certainly still alive in this reality if he was alive in any alternate timeline. Thanks to Ben's influence, Spider-Carnage was convinced to stop trying to destroy reality. After Spider-Carnage instead used the reality bomb to create a portal and subsequently committed suicide by entering the portal to end the threat once and for all, Spider-Man and Ben hugged; although they lived in different realities, Ben was proud of his different reality nephew while Spider-Man assured Ben that he will always have him in his own heart.
In Spider-Man Unlimited, Uncle Ben is briefly mentioned in the pilot episode "Worlds Apart" [Part One]. He is also seen in the theme song which Uncle Ben was killed.
Uncle Ben appears in The Spectacular Spider-Man, voiced by Edward Asner. His character remains faithful to the comics. He is featured in Spider-Man's flashback in the episode "Intervention" revealed that Ben was killed while defending May Parker during a break-in at their house by a burglar that Peter Parker selfishly let go earlier that day. After Peter discovered that Ben was murdered by a burglar who broke into the Parker house and stole Ben's car, Peter furiously sought revenge, donning the Spider-Man costume and confronting the burglar in an old warehouse. Spider-Man unmasked his uncle's killer, realizing that it was the same burglar from earlier. After knocking the criminal out and lowered to policeman via web line, Peter vowed to use these spider powers for good and to never put himself before anyone else and to never to let another innocent person come to harm if anything could help it, and remembering his uncle's words: 'With great power there must also come great responsibility'.
Uncle Ben is featured in the Ultimate Spider-Man cartoon series, voiced by Greg Grunberg.[33] His character is loosely based on his Ultimate Counterpart as opposed to his previous versions. In the pilot episodes "Great Power" and "Great Responsibility", Peter Parker recalled that fateful night of his uncle's murder and Nick Fury uses Ben's memory to have Spider-Man join S.H.I.E.L.D. instead of being solo. A picture of Ben is also seen having fun with May Parker and their young nephew. Ben is personally featured in the episode "Strange Days". Nightmare tries to use Spider-Man's failure being unable to save his uncle's life, however, this does not work; Ben actually motivates Peter to defeat Nightmare (something neither Iron Fist nor Doctor Strange was able to do). In the episode "Ultimate Deadpool", Spider-Man remembers his uncle's memory when thinking about Deadpool's own demons. The character is occasionally referenced in Ultimate Spider-Man vs. The Sinister Six primarily as May's source of Ben Reilly's name. The episode "Return to the Spider-Verse" Pt. 2 features a Wild West reality version of Uncle Ben (voiced by Clancy Brown[34]) who is depicted as the "Phantom Rider" and Webslinger the Spider Cowboy's uncle. As Doc Ock Holliday's brainwashed Deputy, the Phantom Rider helped repelled Wolf Spider and later fought both Spider-Man and Kid Arachnid. Although unaffected by Kid Arachnid's venom blasts, Spider-Man and Webslinger eventually were able to defeat Doc Ock Holliday. Upon Doc Holliday's defeat, Ben was freed from the brainwashing and remanded Doc Ock Holliday to the hoosegow while reclaiming his Sheriff title. As Sheriff Ben and Webslinger are reunited, Spider-Man gets a final look at Sheriff Ben before departing to the next reality, quietly hopeful that one reality has Ben still alive.
Uncle Ben appears in Spider-Man, voiced by Patton Oswalt.[35]
Film[edit]
In the Spider-Man film series, Ben Parker is portrayed by Cliff Robertson and his character remains relatively faithful to the comics, including his being shot by a criminal Peter failed to stop (although in the comics he was shot trying to defend May during a break in at their house and in the film he was shot during a carjacking).
He appeared in the first film as a father figure for Peter. The amiable Ben is laid off from his job as a chief electrician after 35 years and worries about his nephew's strange behavior. His words of wisdom ('With great power comes great responsibility') eventually inspire Peter to become Spider-Man. Losing his temper during this speech, Peter tells him to stop acting like his father, hurting his feelings badly. Later that night, Ben is apparently shot dead by a thief, Dennis Carradine, whom Peter refused to stop when he was cheated out of his money. Peter and his aunt greatly mourn his death, particularly Peter, who is haunted by the fact that he could have stopped Carradine and saved his uncle. By the end of the film, Peter has accepted Ben as the father figure of his childhood.
The second film features a sequence where Peter contemplates giving up his Spider-Man identity to Ben who, in the flashback, is a physical representation of the entity and ideology of Spider-Man, encouraging Peter to continue on as a superhero. Also, Peter admits the truth surrounding Uncle Ben's death to Aunt May. She is shocked and upset at first, but later commends Peter for telling her the truth.
Robertson reprises his role in a flashback scene (as well as a dream sequence) in the third film. In the film, Captain George Stacy tells Peter and Aunt May of new evidence that suggests Carradine was only an accomplice of Flint Marko, who was Uncle Ben's real killer; Peter then imagines Marko throwing Ben out of the car and gunning him down in cold blood while Carradine desperately tries to stop Marko before driving off. Robertson appears again at the end of the film during a more accurate flashback, as Marko explains to Peter that he only wanted Ben's car, since Marko needed to steal money to help his critically ill daughter Penny. However, Carradine startled Marko and caused him to accidentally pull the trigger when Ben was trying to reason with him. This somewhat shocked Marko, as he feels extremely remorseful for killing Ben. Realizing how desperate Marko is to help his own daughter and understanding the importance of forgiveness over revenge, Spider-Man forgives Marko and allows him to go free.
Martin Sheen portrays Uncle Ben in the 2012 film The Amazing Spider-Man. Though his character still remains faithful to the comics, the manner of his murder is drastically different. Following an argument with Peter which results in Peter storming out, Ben leaves to find his nephew and encounters a thief who has just raided a grocery store where Peter was shopping but who Peter refused to stop when he did not provide enough money to pay for a drink. The thief trips over and drops his gun. Ben tries to get the gun first, but a struggle ensues and Ben is killed. Unlike the comics, Ben's killer remains at large.
The screenwriter for Spider-Man: Homecoming, John Francis Daley, confirms that Uncle Ben exists in the Marvel Cinematic Universe despite never being referenced directly in the film (though Peter does mention that Aunt May's been through a lot lately which was an intentional nod to the character). In an earlier draft of the film, May mentions that Peter's wardrobe for homecoming was Ben's clothing, but it was cut out because the screenwriters didn't want his death to be a throwaway line.[36]
Video games[edit]
Uncle Ben is mentioned in the first 3 missions, "Search for Justice," "Warehouse Hunt," and "Birth of a Hero" in the 2002 Spider-Man video game, as Peter Parker attempts to track down Ben's killer.
Uncle Ben is briefly mentioned at the end of Spider-Man 3.
Uncle Ben's Noir version is mentioned by Spider-Man Noir in Spider-Man: Shattered Dimensions when going after the Vulture (that universe's killer of Uncle Ben).
Uncle Ben makes an appearance in the prologue of The Amazing Spider-Man 2, voiced by Mark Bramhall. The tutorial starts off showing the event that lead to his death. After that, he is referenced throughout the game by Peter Parker, Aunt May, and Stan. Around the end of the game, Stan tells Peter that Ben would've wanted him to grow up to be the man that he wanted Peter to be.
Franklin Richards' Uncle Ben[edit]
Franklin Richards of the Fantastic Four often refers to Benjamin Grimm, the Thing, as "Uncle Ben" (Grimm is the best friend of Franklin's father Reed Richards). Franklin Richards and Peter Parker also have the same middle name, Benjamin, as the Thing and Ben Parker are their namesakes. Spider-Man is aware of this, and told Franklin, "Uncle Bens are always right."[37]
Son of Spider-Man[edit]
In The Amazing Spider-Man #498-500, Spider-Man falls through time, encountering all of his enemies from the past, and sees himself in the future. The future Peter Parker tells him that he should tell Mary Jane Watson and their son that he loves them every day. "Our son is called Ben", he says, "but it would pretty much have to be, wouldn't it?" However, because of the way time-travel in the Marvel universe works, it should be noted that this is only a potential future, not necessarily a definite one (This future being even more unlikely after the events of One More Day).
The Other Uncle Ben[edit]
Main article: Spider-Girl
Like her father, Spider-Girl also has an Uncle Ben. However, unlike her dad, May never knew her uncle: Ben Reilly, Spider-Man's clone. If Spider-Girl has any children in the future, they too would have an Uncle Ben - May's baby brother. Ironically in the aftermath of Spider-Verse, the Earth-3145's Ben Parker himself would stay on her world, and has a chance to be his grandfather, something that the other Ben Parkers were unable to achieve on account of their deaths.
References[edit]
Jump up ^ Philip Tallon (2012). Sanford, Jonathan J., ed. Spider-Man and Philosophy: The Web of Inquiry. John Wiley & Sons. p. 86.
^ Jump up to: a b The Clone Conspiracy #3
^ Jump up to: a b The Clone Conspiracy #4
Jump up ^ The Amazing Spider-Man #519. Marvel Comics.
Jump up ^ The Amazing Spider-Man #600 (2009). Marvel Comics.
Jump up ^ The Amazing Spider-Man #516. Marvel Comics.
Jump up ^ Official Handbook of the Marvel Universe: Spider-Man 2005 Marvel Comics.
^ Jump up to: a b Stan Lee (w), Steve Ditko (a). "Spider-Man!" The Amazing Spider-Man 15 (August 1962), Marvel Comics
Jump up ^ The Amazing Spider-Man #200 Marvel Comics.
Jump up ^ The Amazing Spider-Man #500 Marvel Comics.
Jump up ^ Incredible Hercules #130 Marvel Comics.
Jump up ^ The Amazing Spider-Man Vol. 4 1.6 Marvel Comics.
Jump up ^ The Clone Conspiracy: Omega
Jump up ^ Bullet Points #1 (2006) Marvel Comics.
Jump up ^ Spider-Man: House of M #5 Marvel Comics.
Jump up ^ Spider-Man Noir #2 Marvel Comics.
Jump up ^ Edge of Spider-Verse #4 (2014)
Jump up ^ Edge of Spider-Verse #5 (2014)
Jump up ^ Spider-Verse Team-Up #1 (2014)
Jump up ^ The Amazing Spider-Man vol. 3 #12 (2015)
Jump up ^ The Amazing Spider-Man vol. 3 #13 (2015)
Jump up ^ Amazing Spider-Man vol. 3 #14
Jump up ^ Amazing Spider-Man vol. 3 #15
Jump up ^ Brian Michael Bendis (w), Mark Bagley (a). Ultimate Spider-Man #1-3. Marvel Comics.
Jump up ^ What If? #46 (classic vol.7)
Jump up ^ Friendly Neighborhood Spider-Man #13
Jump up ^ Masnick, Mike. "Supreme Court Quotes Spiderman's 'Great Power, Great Responsibility' Line In Rejecting Royalties On Expired Patent". Techdirt. Retrieved 23 December 2017.
Jump up ^ The Evolution of the Pithy Proverb: “With great power comes great responsibility.” at Quote/Counterquote. Accessed April 11, 2013
Jump up ^ Parliamentary Debates, edited by Thomas C. Hansard
Jump up ^ South African native races. Mr. Winston Churchill, accessed July 31, 2015.
Jump up ^ https://twitter.com/loganpaul/status/948026294066864128
Jump up ^ https://tech54321.deviantart.com/art/A-Goddess-s-Heavenly-Ascension-Palutena-TG-TF-AP-603465543
Jump up ^ "Strange". Ultimate Spider-Man. Season 1. Episode 13. July 8, 2012. Disney XD.
Jump up ^ "Return to the Spider-Verse Pt. 2". Ultimate Spider-Man. Season 4. Episode 17. September 3, 2016. Disney XD.
Jump up ^ https://techiegamers.com/2387-2/
Jump up ^ Mueller, Matthew. "Uncle Ben Confirmed For The Marvel Cinematic Universe".
Jump up ^ The Amazing Spider-Man #660 Marvel Comics.
External links[edit]
Uncle Ben at Marvel.com
Uncle Ben's Profile at Spiderfan.org
[show]
v
t
e
Spider-Man characters
Spider-Man family
By secret identity
Spider-Man
Spider-Woman
Scarlet Spider
Steel Spider
Silk
By public identity
Peter Parker
Ben Reilly
Julia Carpenter
Kaine Parker
Mattie Franklin
Anya Corazon
Supporting characters
Main support
Liz Allan
Sally Avril
Betty Brant
Cloak and Dagger
Martha Connors
Billy Connors
Carlie Cooper
Jean DeWolff
Ezekiel
Vin Gonzales
Glory Grant
J. Jonah Jameson
John Jameson
Ashley Kafka
Ned Leeds
Madame Web
Anna Maria Marconi
Kenny McFarlane
Max Modell
Harry Osborn
Normie Osborn
Aunt May Parker
Richard and Mary Parker
Uncle Ben Parker
Randy Robertson
Robbie Robertson
Sophia "Chat" Sanduval
George Stacy
Gwen Stacy
Sarah Stacy
Flash Thompson
Ben Urich
Mary Jane Watson
Debra Whitman
Leo Zelinsky
Neutral characters
Anti-Venom
Black Cat
Cardiac
Prowler
Puma
Punisher
Rocket Racer
Silver Sable
Toxin
Antagonists
Central rogues
gallery
Carnage
Chameleon
Doctor Octopus
Electro
Green Goblin
Norman Osborn
Hammerhead
Hobgoblin
Roderick Kingsley
Hydro-Man
Jackal
Kingpin
Kraven the Hunter
Lizard
Mister Negative
Morbius, the Living Vampire
Mysterio
Rhino
Sandman
Scorpion
Shocker
Tombstone
Venom
Eddie Brock
Vulture
Group teams
Enforcers
Fancy Dan
Montana
Ox
Sinister Six
List of members
Spider-Slayer
List of Spider-Slayers
Sinister Syndicate
Recurring
antagonists
Beetle
Abner Jenkins
Leila Davis
Janice Lincoln
Big Man
Frederick Foswell
Big Wheel
Boomerang
Burglar
Calypso
Carrion
Clash
Crime Master
Cyclone
Demogoblin
Doppleganger
Richard Fisk
Foreigner
Gibbon
Gog
Grey Goblin
Grim Hunter
Grizzly
Human Fly
Hypno-Hustler
Jack O' Lantern
Jason Macendale
Jonas Harrow
Kangaroo
Living Brain
Looter
Man-Wolf
Kraven the Hunter (Ana Kravinoff)
Kraven the Hunter (Alyosha Kravinoff)
Lady Octopus
Man Mountain Marko
Menace
Mendel Stromm
Molten Man
Morlun
Moses Magnum
Overdrive
Ringer
Rose
Scarecrow
Scorcher
Scorpia
Shathra
Shriek
Silvermane
Sin Eater
Alistair Smythe
Speed Demon
Spencer Smythe
Spot
Stegron
Styx and Stone
Swarm
Tarantula
Tinkerer
Phil Urich
Vermin
Walrus
White Rabbit
Will o' the Wisp
Alternative versions
Spider-Man
Spider-Girl
Spider-UK
Spider-Ham
Spider-Man 2099
Spider-Man Noir
Spider-Man (Marvel Mangaverse)
Spider-Man (Pavitr Prabhakar)
Spider-Woman (Gwen Stacy)
Ultimate Marvel Spider-Man
Miles Morales
Alternative versions of Mary Jane Watson
Alternative versions of the Green Goblin
Alternative versions of Venom
In other media
Firestar
Gentleman
Spider-Man (1994 TV series) characters
The Spectacular Spider-Man characters
Other topics
Goblin
Symbiotes
Slingers
[show]
v
t
e
Spider-Man
Stan Lee
Steve Ditko
Characters
List of incarnations of Spider-Man
List of Spider-Man supporting characters
List of Spider-Man enemies
Alternative versions of Spider-Man
Locations
Midtown High School
Daily Bugle
Empire State University
Oscorp
Parker Industries
Alchemax
Comic books
The Amazing Spider-Man
issues
Storylines
In other media
In film
In television
In video games
In literature
novels
book series
Toys
Spider-Man (2010 toy line)
Spider-Man Classics
Spider-Man and Friends
Lego Spider-Man
Spider-Man (pinball)
The Amazing Spider-Man (pinball)
Related topics
Powers and equipment
Category
[show]
v
t
e
Ultimate Spider-Man
Series
Ultimate Spider-Man
Ultimate Comics: Spider-Man
Creators
Brian Michael Bendis (writer)
Mark Bagley (artist)
Original characters
Kenny McFarlane
Miles Morales as Spider-Man
Story arcs and crossovers
Original Series Story Arcs
Second Series Story Arcs
"Ultimate Clone Saga"
Ultimate Marvel Team-Up
Ultimate Six
Ultimate Power
Ultimatum
Ultimate Comics: Doomsday
Ultimate Comics: Fallout
Spider-Men
Other media
Video game
Spider-Man: Shattered Dimensions
TV series
episodes
"For Your Eye Only"
Spider-Man Lives: A Miles Morales Story
[show]
v
t
e
The Spectacular Spider-Man
Episodes
"Survival of the Fittest"
"Interactions"
"Natural Selection"
"Market Forces"
"Competition"
"The Invisible Hand"
"Catalysts"
"Reaction"
"The Uncertainty Principle"
Related
Characters
Category
Retrieved from "https://en.wikipedia.org/w/index.php?title=Uncle_Ben&oldid=825275192"
Categories:
Comics characters introduced in 1962
Fictional characters from New York City
Spider-Man characters
Superhero film characters
Characters created by Stan Lee
Characters created by Steve Ditko
Hidden categories:
Comics infobox image less caption
Character pop
Converting comics character infoboxes
Comics articles needing issue citations
Articles with unsourced statements from July 2012
Articles with unsourced statements from January 2013
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Article
Talk
Variants
Views
Read
Edit
View history
More
Search
Navigation
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Create a book
Download as PDF
Printable version
Languages
Български
Français
Հայերեն
Italiano
मराठी
Nederlands
Português
Русский
Simple English
Suomi
Svenska
Edit links
This page was last edited on 12 February 2018, at 13:36.
Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Developers
Cookie statement
Mobile view
Enable previews

values: mw-page-base noprint

values: mw-head-base noprint

values: firstHeading firstHeading en

values: siteSub noprint

values: jump-to-nav mw-jump

attrs: role class

values:
note
hatnote navigation-not-searchable

attrs: alt src width height data-file-width data-file-height

attrs: scope style

values:
row
width: 40%;

values: width:22em;width: 24em; background: #f2f9ff;

values:
/wiki/Flashback_(literary_technique)
mw-redirect
Flashback (literary technique)

values: This citation requires a reference to the specific volume in which the source appears. (July 2012)

values:
/wiki/Parallel_universe_(fiction)
mw-redirect
Parallel universe (fiction)

values:
/wiki/Clone_Conspiracy
mw-redirect
Clone Conspiracy

values: Edit section: Fictional character biography

values:
/wiki/Brooklyn,_New_York
mw-redirect
Brooklyn, New York

values: This citation requires a reference to the specific volume in which the source appears. (January 2013)

values:
/wiki/Superior_Spider-Man
mw-redirect
Superior Spider-Man

values:
/wiki/Death_of_Spider-Man
mw-redirect
Death of Spider-Man

values:
/wiki/Spider-Man_2211
mw-redirect
Spider-Man 2211

values: Edit section: "With great power comes great responsibility"

values:
/wiki/Member_of_British_parliament
mw-redirect
Member of British parliament

values:
/wiki/Edward_Asner
mw-redirect
Edward Asner

values:
/wiki/Ultimate_Nick_Fury
mw-redirect
Ultimate Nick Fury

values: The Amazing Spider-Man 2 (2014 video game)

values: Edit section: Franklin Richards' Uncle Ben

values:
nofollow
https://techiegamers.com/2387-2/
external free

values: -moz-column-width: 20em; -webkit-column-width: 20em; column-width: 20em; list-style-type: decimal;

values: List of Spider-Man (1994 TV series) characters

values: List of The Spectacular Spider-Man characters

values: nowraplinks hlist collapsible autocollapse navbox-inner

values: navigation navbox Spider-Man padding:3px

values: List of Ultimate Comics: Spider-Man story arcs

values:
/wiki/Ultimatum_(Ultimate_Marvel)
mw-redirect
Ultimatum (Ultimate Marvel)

values: nowraplinks collapsible autocollapse navbox-inner

values: Template:Spectacular Spider-Man (TV series)

values: Template talk:Spectacular Spider-Man (TV series)

values: List of The Spectacular Spider-Man episodes

values: Survival of the Fittest (The Spectacular Spider-Man)

values: Interactions (The Spectacular Spider-Man)

values: Natural Selection (The Spectacular Spider-Man)

values: Market Forces (The Spectacular Spider-Man)

values: Competition (The Spectacular Spider-Man)

values: The Invisible Hand (The Spectacular Spider-Man)

values: The Uncertainty Principle (The Spectacular Spider-Man)

values: Category:The Spectacular Spider-Man (TV series)

values: Category:Comics characters introduced in 1962

values: Category:Fictional characters from New York City

values: Category:Characters created by Steve Ditko

values: Category:Comics infobox image less caption

values: Category:Converting comics character infoboxes

values: Category:Comics articles needing issue citations

values: Category:Articles with unsourced statements from July 2012

values: Category:Articles with unsourced statements from January 2013

values: Discussion about edits from this IP address [ctrl-alt-n]

values:
/wiki/Uncle_Ben
View the content page [ctrl-alt-c]
c

values: Featured content – the best of Wikipedia

values: Find background information on current events

values:
/wiki/Special:Random
Load a random article [ctrl-alt-x]
x

values: portal navigation p-navigation p-navigation-label

values: Guidance on how to use and edit Wikipedia

values: About the project, what you can do, where to find things

values: A list of recent changes in the wiki [ctrl-alt-r]

values: portal navigation p-interaction p-interaction-label

values: List of all English Wikipedia pages containing links to this page [ctrl-alt-j]

values: Recent changes in pages linked from this page [ctrl-alt-k]

values:
/wiki/Wikipedia:File_Upload_Wizard
Upload files [ctrl-alt-u]
u

values: A list of all special pages [ctrl-alt-q]

values:
uls-settings-trigger
Language settings
0
button
true

values: Հորեղբայր Բեն – Armenian

values: बेन पार्कर – Marathi

values: Дядя Бен – Russian

values: /static/images/wikimedia-button-1.5x.png 1.5x, /static/images/wikimedia-button-2x.png 2x

values: /static/images/poweredby_mediawiki_132x47.png 1.5x, /static/images/poweredby_mediawiki_176x62.png 2x

values: mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-Uncle_Ben rootpage-Uncle_Ben skin-vector action-view


text:
SHA-1
From Wikipedia, the free encyclopedia
Jump to: navigation, search
Secure Hash Algorithm
Concepts
hash functions · SHA · DSA
Main standards
SHA-0 · SHA-1 · SHA-2 · SHA-3
v
t
e
SHA-1
General
Designers
National Security Agency
First published
1993 (SHA-0),
1995 (SHA-1)
Series
(SHA-0), SHA-1, SHA-2, SHA-3
Certification
FIPS PUB 180-4, CRYPTREC (Monitored)
Cipher detail
Digest sizes
160 bits
Block sizes
512 bits
Structure
Merkle–Damgård construction
Rounds
80
Best public cryptanalysis
A 2011 attack by Marc Stevens can produce hash collisions with a complexity between 260.3 and 265.3 operations.[1] The first public collision was published on 23 February 2017.[2]
SHA-1 is prone to length extension attacks.
In cryptography, SHA-1 (Secure Hash Algorithm 1) is a cryptographic hash function designed by the United States National Security Agency and is a U.S. Federal Information Processing Standard published by the United States NIST.[3] SHA-1 produces a 160-bit (20-byte) hash value known as a message digest. A SHA-1 hash value is typically rendered as a hexadecimal number, 40 digits long.
SHA-1 is no longer considered secure against well-funded opponents. In 2005, cryptanalysts found attacks on SHA-1 suggesting that the algorithm might not be secure enough for ongoing use,[4] and since 2010 many organizations have recommended its replacement by SHA-2 or SHA-3.[5][6][7] Microsoft,[8] Google,[9] Apple[10] and Mozilla[11][12][13] have all announced that their respective browsers will stop accepting SHA-1 SSL certificates by 2017.
On February 23, 2017 CWI Amsterdam and Google announced they had performed a collision attack against SHA-1,[14][15] publishing two dissimilar PDF files which produce the same SHA-1 hash as proof of concept.[16]
Contents
[hide]
1 Development
2 Applications
2.1 Cryptography
2.2 Data integrity
3 Cryptanalysis and validation
3.1 Attacks
3.1.1 The SHAppening
3.1.2 SHAttered – first public collision
3.2 SHA-0
3.3 Official validation
4 Examples and pseudocode
4.1 Example hashes
4.2 SHA-1 pseudocode
5 Comparison of SHA functions
6 See also
7 Notes
8 References
9 External links
Development[edit]
One iteration within the SHA-1 compression function:
A, B, C, D and E are 32-bit words of the state;
F is a nonlinear function that varies;
n denotes a left bit rotation by n places;
n varies for each operation;
Wt is the expanded message word of round t;
Kt is the round constant of round t;
denotes addition modulo 232.
SHA-1 produces a message digest based on principles similar to those used by Ronald L. Rivest of MIT in the design of the MD4 and MD5 message digest algorithms, but has a more conservative design.
SHA-1 was developed as part of the U.S. Government's Capstone project.[17] The original specification of the algorithm was published in 1993 under the title Secure Hash Standard, FIPS PUB 180, by U.S. government standards agency NIST (National Institute of Standards and Technology).[18][19] This version is now often named SHA-0. It was withdrawn by the NSA shortly after publication and was superseded by the revised version, published in 1995 in FIPS PUB 180-1 and commonly designated SHA-1. SHA-1 differs from SHA-0 only by a single bitwise rotation in the message schedule of its compression function. According to the NSA, this was done to correct a flaw in the original algorithm which reduced its cryptographic security, but they did not provide any further explanation.[citation needed] Publicly available techniques did indeed compromise SHA-0 before SHA-1.[citation needed]
Applications[edit]
Cryptography[edit]
For more details on this topic, see Cryptographic hash function § Applications.
SHA-1 forms part of several widely used security applications and protocols, including TLS and SSL, PGP, SSH, S/MIME, and IPsec. Those applications can also use MD5; both MD5 and SHA-1 are descended from MD4. SHA-1 hashing is also used in distributed revision control systems like Git, Mercurial, and Monotone to identify revisions, and to detect data corruption or tampering. The algorithm has also been used on Nintendo's Wii gaming console for signature verification when booting, but a significant flaw in the first implementations of the firmware allowed for an attacker to bypass the system's security scheme.[20]
SHA-1 and SHA-2 are the hash algorithms required by law for use in certain U.S. government applications, including use within other cryptographic algorithms and protocols, for the protection of sensitive unclassified information. FIPS PUB 180-1 also encouraged adoption and use of SHA-1 by private and commercial organizations. SHA-1 is being retired from most government uses; the U.S. National Institute of Standards and Technology said, "Federal agencies should stop using SHA-1 for...applications that require collision resistance as soon as practical, and must use the SHA-2 family of hash functions for these applications after 2010" (emphasis in original),[21] though that was later relaxed.[22]
A prime motivation for the publication of the Secure Hash Algorithm was the Digital Signature Standard, in which it is incorporated.
The SHA hash functions have been used for the basis of the SHACAL block ciphers.
Data integrity[edit]
Revision control systems such as Git and Mercurial use SHA-1 not for security but for ensuring that the data has not changed due to accidental corruption. Linus Torvalds said about Git:
If you have disk corruption, if you have DRAM corruption, if you have any kind of problems at all, Git will notice them. It's not a question of if, it's a guarantee. You can have people who try to be malicious. They won't succeed. [...] Nobody has been able to break SHA-1, but the point is the SHA-1, as far as Git is concerned, isn't even a security feature. It's purely a consistency check. The security parts are elsewhere, so a lot of people assume that since Git uses SHA-1 and SHA-1 is used for cryptographically secure stuff, they think that, Okay, it's a huge security feature. It has nothing at all to do with security, it's just the best hash you can get. [...]
I guarantee you, if you put your data in Git, you can trust the fact that five years later, after it was converted from your hard disk to DVD to whatever new technology and you copied it along, five years later you can verify that the data you get back out is the exact same data you put in. [...]
One of the reasons I care is for the kernel, we had a break in on one of the BitKeeper sites where people tried to corrupt the kernel source code repositories.[23] However Git does not require the second preimage resistance of SHA-1 as a security feature, since it will always prefer to keep the earliest version of an object in case of collision, preventing an attacker from surreptitiously overwriting files.[24]
Cryptanalysis and validation[edit]
For a hash function for which L is the number of bits in the message digest, finding a message that corresponds to a given message digest can always be done using a brute force search in approximately 2L evaluations. This is called a preimage attack and may or may not be practical depending on L and the particular computing environment. However, a collision, consisting of finding two different messages that produce the same message digest, requires on average only about 1.2 × 2L/2 evaluations using a birthday attack. Thus the strength of a hash function is usually compared to a symmetric cipher of half the message digest length. SHA-1, which has a 160-bit message digest, was originally thought to have 80-bit strength.
In 2005, cryptographers Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu produced collision pairs for SHA-0 and have found algorithms that should produce SHA-1 collisions in far fewer than the originally expected 280 evaluations.[25]
In terms of practical security, a major concern about these new attacks is that they might pave the way to more efficient ones. Whether this is the case is yet to be seen, but a migration to stronger hashes is believed[by whom?] to be prudent. Some of the applications that use cryptographic hashes, like password storage, are only minimally affected by a collision attack. Constructing a password that works for a given account requires a preimage attack, as well as access to the hash of the original password, which may or may not be trivial. Reversing password encryption (e.g. to obtain a password to try against a user's account elsewhere) is not made possible by the attacks. (However, even a secure password hash can't prevent brute-force attacks on weak passwords.)
In the case of document signing, an attacker could not simply fake a signature from an existing document: The attacker would have to produce a pair of documents, one innocuous and one damaging, and get the private key holder to sign the innocuous document. There are practical circumstances in which this is possible; until the end of 2008, it was possible to create forged SSL certificates using an MD5 collision.[26]
Due to the block and iterative structure of the algorithms and the absence of additional final steps, all SHA functions (except SHA-3[27]) are vulnerable to length-extension and partial-message collision attacks.[28] These attacks allow an attacker to forge a message signed only by a keyed hash — SHA(message || key) or SHA(key || message) — by extending the message and recalculating the hash without knowing the key. A simple improvement to prevent these attacks is to hash twice: SHAd(message) = SHA(SHA(0b || message)) (the length of 0b, zero block, is equal to the block size of the hash function).
Attacks[edit]
In early 2005, Rijmen and Oswald published an attack on a reduced version of SHA-1 — 53 out of 80 rounds — which finds collisions with a computational effort of fewer than 280 operations.[29]
In February 2005, an attack by Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu was announced.[30] The attacks can find collisions in the full version of SHA-1, requiring fewer than 269 operations. (A brute-force search would require 280 operations.)
The authors write: "In particular, our analysis is built upon the original differential attack on SHA-0, the near collision attack on SHA-0, the multiblock collision techniques, as well as the message modification techniques used in the collision search attack on MD5. Breaking SHA-1 would not be possible without these powerful analytical techniques."[31] The authors have presented a collision for 58-round SHA-1, found with 233 hash operations. The paper with the full attack description was published in August 2005 at the CRYPTO conference.
In an interview, Yin states that, "Roughly, we exploit the following two weaknesses: One is that the file preprocessing step is not complicated enough; another is that certain math operations in the first 20 rounds have unexpected security problems."[32]
On 17 August 2005, an improvement on the SHA-1 attack was announced on behalf of Xiaoyun Wang, Andrew Yao and Frances Yao at the CRYPTO 2005 Rump Session, lowering the complexity required for finding a collision in SHA-1 to 263.[33] On 18 December 2007 the details of this result were explained and verified by Martin Cochran.[34]
Christophe De Cannière and Christian Rechberger further improved the attack on SHA-1 in "Finding SHA-1 Characteristics: General Results and Applications,"[35] receiving the Best Paper Award at ASIACRYPT 2006. A two-block collision for 64-round SHA-1 was presented, found using unoptimized methods with 235 compression function evaluations. Since this attack requires the equivalent of about 235 evaluations, it is considered to be a significant theoretical break.[36] Their attack was extended further to 73 rounds (of 80) in 2010 by Grechnikov.[37] In order to find an actual collision in the full 80 rounds of the hash function, however, tremendous amounts of computer time are required. To that end, a collision search for SHA-1 using the distributed computing platform BOINC began August 8, 2007, organized by the Graz University of Technology. The effort was abandoned May 12, 2009 due to lack of progress.[38]
At the Rump Session of CRYPTO 2006, Christian Rechberger and Christophe De Cannière claimed to have discovered a collision attack on SHA-1 that would allow an attacker to select at least parts of the message.[39][40]
In 2008, an attack methodology by Stéphane Manuel reported hash collisions with an estimated theoretical complexity of 251 to 257 operations.[41] However he later retracted that claim after finding that local collision paths were not actually independent, and finally quoting for the most efficient a collision vector that was already known before this work.[42]
Cameron McDonald, Philip Hawkes and Josef Pieprzyk presented a hash collision attack with claimed complexity 252 at the Rump Session of Eurocrypt 2009.[43] However, the accompanying paper, "Differential Path for SHA-1 with complexity O(252)" has been withdrawn due to the authors' discovery that their estimate was incorrect.[44]
One attack against SHA-1 was Marc Stevens[45] with an estimated cost of $2.77M to break a single hash value by renting CPU power from cloud servers.[46] Stevens developed this attack in a project called HashClash,[47] implementing a differential path attack. On 8 November 2010, he claimed he had a fully working near-collision attack against full SHA-1 working with an estimated complexity equivalent to 257.5 SHA-1 compressions. He estimated this attack could be extended to a full collision with a complexity around 261.
The SHAppening[edit]
On 8 October 2015, Marc Stevens, Pierre Karpman, and Thomas Peyrin published a freestart collision attack on SHA-1's compression function that requires only 257 SHA-1 evaluations. This does not directly translate into a collision on the full SHA-1 hash function (where an attacker is not able to freely choose the initial internal state), but undermines the security claims for SHA-1. In particular, it was the first time that an attack on full SHA-1 had been demonstrated; all earlier attacks were too expensive for their authors to carry them out. The authors named this significant breakthrough in the cryptanalysis of SHA-1 The SHAppening.[6]
The method was based on their earlier work, as well as the auxiliary paths (or boomerangs) speed-up technique from Joux and Peyrin, and using high performance/cost efficient GPU cards from NVIDIA. The collision was found on a 16-node cluster with a total of 64 graphics cards. The authors estimated that a similar collision could be found by buying US$2,000 of GPU time on EC2.[6]
The authors estimated that the cost of renting enough of EC2 CPU/GPU time to generate a full collision for SHA-1 at the time of publication was between US$75K–120K, and noted that was well within the budget of criminal organizations, not to mention national intelligence agencies. As such, the authors recommended that SHA-1 be deprecated as quickly as possible.[6]
SHAttered – first public collision[edit]
On 23 February 2017, Google announced the SHAttered attack, in which they generated two different PDF files with the same SHA-1 hash in roughly 263.1 SHA-1 evaluations. This attack is about 100,000 times faster than brute forcing a SHA-1 collision with a birthday attack, which was estimated to take 280 SHA-1 evaluations. The attack required "the equivalent processing power as 6,500 years of single-CPU computations and 110 years of single-GPU computations".[2][16]
SHA-0[edit]
At CRYPTO 98, two French researchers, Florent Chabaud and Antoine Joux, presented an attack on SHA-0: collisions can be found with complexity 261, fewer than the 280 for an ideal hash function of the same size.[48]
In 2004, Biham and Chen found near-collisions for SHA-0 — two messages that hash to nearly the same value; in this case, 142 out of the 160 bits are equal. They also found full collisions of SHA-0 reduced to 62 out of its 80 rounds.[citation needed]
Subsequently, on 12 August 2004, a collision for the full SHA-0 algorithm was announced by Joux, Carribault, Lemuet, and Jalby. This was done by using a generalization of the Chabaud and Joux attack. Finding the collision had complexity 251 and took about 80,000 processor-hours on a supercomputer with 256 Itanium 2 processors (equivalent to 13 days of full-time use of the computer).
On 17 August 2004, at the Rump Session of CRYPTO 2004, preliminary results were announced by Wang, Feng, Lai, and Yu, about an attack on MD5, SHA-0 and other hash functions. The complexity of their attack on SHA-0 is 240, significantly better than the attack by Joux et al.[49][50]
In February 2005, an attack by Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu was announced which could find collisions in SHA-0 in 239 operations.[30][51]
Another attack in 2008 applying the boomerang attack brought the complexity of finding collisions down to 233.6, which is estimated to take 1 hour on an average PC.[52]
In light of the results for SHA-0, some experts[who?] suggested that plans for the use of SHA-1 in new cryptosystems should be reconsidered. After the CRYPTO 2004 results were published, NIST announced that they planned to phase out the use of SHA-1 by 2010 in favor of the SHA-2 variants.[53]
Official validation[edit]
Main article: Cryptographic Module Validation Program
Implementations of all FIPS-approved security functions can be officially validated through the CMVP program, jointly run by the National Institute of Standards and Technology (NIST) and the Communications Security Establishment (CSE). For informal verification, a package to generate a high number of test vectors is made available for download on the NIST site; the resulting verification, however, does not replace the formal CMVP validation, which is required by law for certain applications.
As of December 2013[update], there are over 2000 validated implementations of SHA-1, with 14 of them capable of handling messages with a length in bits not a multiple of eight (see SHS Validation List).
Examples and pseudocode[edit]
Example hashes[edit]
These are examples of SHA-1 message digests in hexadecimal and in Base64 binary to ASCII text encoding.
SHA1("The quick brown fox jumps over the lazy dog") gives hexadecimal: 2fd4e1c67a2d28fced849ee1bb76e7391b93eb12 gives Base64 binary to ASCII text encoding: L9ThxnotKPzthJ7hu3bnORuT6xI=

Even a small change in the message will, with overwhelming probability, result in many bits changing due to the avalanche effect. For example, changing dog to cog produces a hash with different values for 81 of the 160 bits:
SHA1("The quick brown fox jumps over the lazy cog") gives hexadecimal: de9f2c7fd25e1b3afad3e85a0bd17d9b100db4b3 gives Base64 binary to ASCII text encoding: 3p8sf9JeGzr60+haC9F9mxANtLM=

The hash of the zero-length string is:
SHA1("")
gives hexadecimal: da39a3ee5e6b4b0d3255bfef95601890afd80709
gives Base64 binary to ASCII text encoding: 2jmj7l5rSw0yVb/vlWAYkK/YBwk=

SHA-1 pseudocode[edit]
Pseudocode for the SHA-1 algorithm follows:
Note 1: All variables are unsigned 32-bit quantities and wrap modulo 232 when calculating, except for ml, the message length, which is a 64-bit quantity, and hh, the message digest, which is a 160-bit quantity. Note 2: All constants in this pseudo code are in big endian. Within each word, the most significant byte is stored in the leftmost byte position Initialize variables: h0 = 0x67452301 h1 = 0xEFCDAB89 h2 = 0x98BADCFE h3 = 0x10325476 h4 = 0xC3D2E1F0 ml = message length in bits (always a multiple of the number of bits in a character). Pre-processing: append the bit '1' to the message e.g. by adding 0x80 if message length is a multiple of 8 bits. append 0 ≤ k < 512 bits '0', such that the resulting message length in bits is congruent to −64 ≡ 448 (mod 512) append ml, the original message length, as a 64-bit big-endian integer. Thus, the total length is a multiple of 512 bits. Process the message in successive 512-bit chunks: break message into 512-bit chunks for each chunk break chunk into sixteen 32-bit big-endian words w[i], 0 ≤ i ≤ 15 Extend the sixteen 32-bit words into eighty 32-bit words: for i from 16 to 79 w[i] = (w[i-3] xor w[i-8] xor w[i-14] xor w[i-16]) leftrotate 1 Initialize hash value for this chunk: a = h0 b = h1 c = h2 d = h3 e = h4 Main loop:[3][54] for i from 0 to 79 if 0 ≤ i ≤ 19 then f = (b and c) or ((not b) and d) k = 0x5A827999 else if 20 ≤ i ≤ 39 f = b xor c xor d k = 0x6ED9EBA1 else if 40 ≤ i ≤ 59 f = (b and c) or (b and d) or (c and d) k = 0x8F1BBCDC else if 60 ≤ i ≤ 79 f = b xor c xor d k = 0xCA62C1D6 temp = (a leftrotate 5) + f + e + k + w[i] e = d d = c c = b leftrotate 30 b = a a = temp Add this chunk's hash to result so far: h0 = h0 + a h1 = h1 + b h2 = h2 + c h3 = h3 + d h4 = h4 + e Produce the final hash value (big-endian) as a 160-bit number: hh = (h0 leftshift 128) or (h1 leftshift 96) or (h2 leftshift 64) or (h3 leftshift 32) or h4

The number hh is the message digest, which can be written in hexadecimal (base 16), but is often written using Base64 binary to ASCII text encoding.
The constant values used are chosen to be nothing up my sleeve numbers: The four round constants k are 230 times the square roots of 2, 3, 5 and 10. The first four starting values for h0 through h3 are the same with the MD5 algorithm, and the fifth (for h4) is similar.
Instead of the formulation from the original FIPS PUB 180-1 shown, the following equivalent expressions may be used to compute f in the main loop above:
Bitwise choice between c and d, controlled by b. (0 ≤ i ≤ 19): f = d xor (b and (c xor d)) (alternative 1) (0 ≤ i ≤ 19): f = (b and c) xor ((not b) and d) (alternative 2) (0 ≤ i ≤ 19): f = (b and c) + ((not b) and d) (alternative 3) (0 ≤ i ≤ 19): f = vec_sel(d, c, b) (alternative 4) Bitwise majority function. (40 ≤ i ≤ 59): f = (b and c) or (d and (b or c)) (alternative 1) (40 ≤ i ≤ 59): f = (b and c) or (d and (b xor c)) (alternative 2) (40 ≤ i ≤ 59): f = (b and c) + (d and (b xor c)) (alternative 3) (40 ≤ i ≤ 59): f = (b and c) xor (b and d) xor (c and d) (alternative 4) (40 ≤ i ≤ 59): f = vec_sel(c, b, c xor d) (alternative 5)

It was also shown[55] that for the rounds 32–79 the computation of:
w[i] = (w[i-3] xor w[i-8] xor w[i-14] xor w[i-16]) leftrotate 1

can be replaced with:
w[i] = (w[i-6] xor w[i-16] xor w[i-28] xor w[i-32]) leftrotate 2

This transformation keeps all operands 64-bit aligned and, by removing the dependency of w[i] on w[i-3], allows efficient SIMD implementation with a vector length of 4 like x86 SSE instructions.
Comparison of SHA functions[edit]
In the table below, internal state means the "internal hash sum" after each compression of a data block.
Further information: Merkle–Damgård construction
Note that performance will vary not only between algorithms, but also with the specific implementation and hardware used. The OpenSSL tool has a built-in "speed" command that benchmarks the various algorithms on the user's system.
view
talk
edit
Comparison of SHA functions
Algorithm and variant
Output size
(bits)
Internal state size
(bits)
Block size
(bits)
Max message size
(bits)
Rounds
Operations
Security bits
(Info)
Capacity
against length extension attacks
Performance on Skylake (median cpb)[56]
First Published
long messages
8 bytes
MD5 (as reference) 128 128
(4 × 32) 512 Unlimited[57] 64 And, Xor, Rot, Add (mod 232), Or <64
(collisions found) 0 4.99 55.00 1992
SHA-0 160 160
(5 × 32) 512 264 − 1 80 And, Xor, Rot, Add (mod 232), Or <34
(collisions found) 0 ≈ SHA-1 ≈ SHA-1 1993
SHA-1 <63
(collisions found[58]) 3.47 52.00 1995
SHA-2 SHA-224
SHA-256 224
256 256
(8 × 32) 512 264 − 1 64 And, Xor, Rot, Add (mod 232), Or, Shr 112
128 32
0 7.62
7.63 84.50
85.25 2004
2001
SHA-384
SHA-512 384
512 512
(8 × 64) 1024 2128 − 1 80 And, Xor, Rot, Add (mod 264), Or, Shr 192
256 128 (≤ 384)
0 5.12
5.06 135.75
135.50
SHA-512/224
SHA-512/256 224
256 112
128 288
256 ≈ SHA-384 ≈ SHA-384
SHA-3 SHA3-224
SHA3-256
SHA3-384
SHA3-512 224
256
384
512 1600
(5 × 5 × 64) 1152
1088
832
576 Unlimited[59] 24[60] And, Xor, Rot, Not 112
128
192
256 448
512
768
1024 8.12
8.59
11.06
15.88 154.25
155.50
164.00
164.00 2015
SHAKE128
SHAKE256 d (arbitrary)
d (arbitrary) 1344
1088 min(d/2, 128)
min(d/2, 256) 256
512 7.08
8.59 155.25
155.50
See also[edit]
Collision (computer science)
Comparison of cryptographic hash functions
cryptlib
Crypto++
Hash function security summary
Hashcash
International Association for Cryptologic Research
Libgcrypt
mbed TLS
md5deep
OpenSSL
RIPEMD
Secure Hash Standard
sha1sum
Tiger (cryptography)
Trusted timestamping
Whirlpool (cryptography)
Notes[edit]
Jump up ^ Stevens, Marc (19 June 2012). "Attacks on Hash Functions and Applications" (PDF). PhD thesis.
^ Jump up to: a b Stevens, Marc; Bursztein, Elie; Karpman, Pierre; Albertini, Ange; Markov, Yarik. "The first collision for full SHA-1" (PDF). Shattered IO. Retrieved 23 February 2017.
^ Jump up to: a b http://csrc.nist.gov/publications/fips/fips180-4/fips-180-4.pdf
Jump up ^ Schneier, Bruce (February 18, 2005). "Schneier on Security: Cryptanalysis of SHA-1".
Jump up ^ "NIST.gov – Computer Security Division – Computer Security Resource Center".
^ Jump up to: a b c d Stevens1, Marc; Karpman, Pierre; Peyrin, Thomas. "The SHAppening: freestart collisions for SHA-1". Retrieved 2015-10-09.
Jump up ^ Schneier, Bruce (8 October 2015). "SHA-1 Freestart Collision". Schneier on Security.
Jump up ^ "Windows Enforcement of Authenticode Code Signing and Timestamping". Microsoft. 2015-09-24. Retrieved 2016-08-07.
Jump up ^ "Intent to Deprecate: SHA-1 certificates". Google. 2014-09-03. Retrieved 2014-09-04.
Jump up ^ "Safari and WebKit ending support for SHA-1 certificates – Apple Support". Apple Inc. 2017-01-24. Retrieved 2017-02-04.
Jump up ^ "Bug 942515 – stop accepting SHA-1-based SSL certificates with notBefore >= 2014-03-01 and notAfter >= 2017-01-01, or any SHA-1-based SSL certificates after 2017-01-01". Mozilla. Retrieved 2014-09-04.
Jump up ^ "CA:Problematic Practices – MozillaWiki". Mozilla. Retrieved 2014-09-09.
Jump up ^ "Phasing Out Certificates with SHA-1 based Signature Algorithms | Mozilla Security Blog". Mozilla. 2014-09-23. Retrieved 2014-09-24.
Jump up ^ "CWI, Google announce first collision for Industry Security Standard SHA-1". Retrieved 2017-02-23.
Jump up ^ "Announcing the first SHA1 collision". Google Online Security Blog. 2017-02-23.
^ Jump up to: a b "SHAttered". Retrieved 2017-02-23.
Jump up ^ RSA FAQ on Capstone
Jump up ^ Selvarani, R.; Aswatha, Kumar; T V Suresh, Kumar. Proceedings of International Conference on Advances in Computing. p. 551.
Jump up ^ Secure Hash Standard, Federal Information Processing Standards Publication FIPS PUB 180, National Institute of Standards and Technology, 11 May 1993
Jump up ^ Domke, Felix aka "tmbinc" (2008-04-24). "Thank you, Datel". Retrieved 2014-10-05. For verifying the hash (which is the only thing they verify in the signature), they have chosen to use a function (strncmp) which stops on the first nullbyte – with a positive result. Out of the 160 bits of the SHA1-hash, up to 152 bits are thrown away.
Jump up ^ National Institute on Standards and Technology Computer Security Resource Center, NIST's March 2006 Policy on Hash Functions, accessed September 28, 2012.
Jump up ^ National Institute on Standards and Technology Computer Security Resource Center, NIST's Policy on Hash Functions, accessed September 28, 2012.
Jump up ^ "Tech Talk: Linus Torvalds on git". Retrieved November 13, 2013.
Jump up ^ Torvalds, Linus. "Re: Starting to think about sha-256?". marc.info. Retrieved 30 May 2016.
Jump up ^ Wang, Xiaoyun; Yin, Yiqun Lisa; Yu, Hongbo (2005-08-14). "Finding Collisions in the Full SHA-1". Advances in Cryptology – CRYPTO 2005. Springer, Berlin, Heidelberg: 17–36. doi:10.1007/11535218_2.
Jump up ^ Sotirov, Alexander; Stevens, Marc; Appelbaum, Jacob; Lenstra, Arjen; Molnar, David; Osvik, Dag Arne; de Weger, Benne (December 30, 2008). "MD5 considered harmful today: Creating a rogue CA certificate". Retrieved March 29, 2009.
Jump up ^ "Strengths of Keccak – Design and security". The Keccak sponge function family. Keccak team. Retrieved 20 September 2015. Unlike SHA-1 and SHA-2, Keccak does not have the length-extension weakness, hence does not need the HMAC nested construction. Instead, MAC computation can be performed by simply prepending the message with the key.
Jump up ^ Niels Ferguson, Bruce Schneier, and Tadayoshi Kohno, Cryptography Engineering, John Wiley & Sons, 2010. ISBN 978-0-470-47424-2
Jump up ^ "Cryptology ePrint Archive: Report 2005/010".
^ Jump up to: a b "SHA-1 Broken – Schneier on Security".
Jump up ^ MIT.edu, Massachusetts Institute of Technology
Jump up ^ Lemos, Robert. "Fixing a hole in security". ZDNet.
Jump up ^ "New Cryptanalytic Results Against SHA-1 – Schneier on Security".
Jump up ^ Notes on the Wang et al. 263 SHA-1 Differential Path
Jump up ^ De Cannière, Christophe; Rechberger, Christian (2006-11-15). "Finding SHA-1 Characteristics: General Results and Applications".
Jump up ^ "IAIK Krypto Group — Description of SHA-1 Collision Search Project". Retrieved 2009-06-30.
Jump up ^ "Collisions for 72-step and 73-step SHA-1: Improvements in the Method of Characteristics". Retrieved 2010-07-24.
Jump up ^ "SHA-1 Collision Search Graz". Retrieved 2009-06-30.
Jump up ^ "heise online – IT-News, Nachrichten und Hintergründe". heise online.
Jump up ^ "Crypto 2006 Rump Schedule".
Jump up ^ Manuel, Stéphane. "Classification and Generation of Disturbance Vectors for Collision Attacks against SHA-1" (PDF). Retrieved 2011-05-19.
Jump up ^ Manuel, Stéphane. "Classification and Generation of Disturbance Vectors for Collision Attacks against SHA-1". Retrieved 2012-10-04. the most efficient disturbance vector is Codeword2 first reported by Jutla and Patthak
Jump up ^ SHA-1 collisions now 2^52
Jump up ^ "Cryptology ePrint Archive: Report 2009/259".
Jump up ^ Cryptanalysis of MD5 & SHA-1
Jump up ^ "When Will We See Collisions for SHA-1? – Schneier on Security".
Jump up ^ "Google Project Hosting".
Jump up ^ Chabaud, Florent; Joux, Antoine (1998). Differential Collisions in SHA-0 (PDF). CRYPTO '98.
Jump up ^ "Report from Crypto 2004".
Jump up ^ Grieu, Francois (18 August 2004). "Re: Any advance news from the crypto rump session?". Newsgroup: sci.crypt. Event occurs at 05:06:02 +0200. Usenet: fgrieu-05A994.05060218082004@individual.net.
Jump up ^ (in Chinese) Sdu.edu.cn, Shandong University
Jump up ^ Manuel, Stéphane; Peyrin, Thomas (2008-02-11). "Collisions on SHA-0 in One Hour".
Jump up ^ National Institute of Standards and Technology
Jump up ^ "RFC 3174 – US Secure Hash Algorithm 1 (SHA1)".
Jump up ^ Locktyukhin, Max; Farrel, Kathy (2010-03-31), "Improving the Performance of the Secure Hash Algorithm (SHA-1)", Intel Software Knowledge Base, Intel, retrieved 2010-04-02
Jump up ^ http://bench.cr.yp.to/results-hash.html#amd64-skylake
Jump up ^ "The MD5 Message-Digest Algorithm". Retrieved 2016-04-18. In the unlikely event that b is greater than 2^64, then only the low-order 64 bits of b are used.
Jump up ^ "Announcing the first SHA1 collision". Retrieved 2017-02-23.
Jump up ^ "The Sponge Functions Corner". Retrieved 2016-01-27.
Jump up ^ "The Keccak sponge function family". Retrieved 2016-01-27.
References[edit]
Florent Chabaud, Antoine Joux: Differential Collisions in SHA-0. CRYPTO 1998. pp56–71
Eli Biham, Rafi Chen, Near-Collisions of SHA-0, Cryptology ePrint Archive, Report 2004/146, 2004 (appeared on CRYPTO 2004), IACR.org
Xiaoyun Wang, Hongbo Yu and Yiqun Lisa Yin, Efficient Collision Search Attacks on SHA-0, CRYPTO 2005, CMU.edu
Xiaoyun Wang, Yiqun Lisa Yin and Hongbo Yu, Finding Collisions in the Full SHA-1, Crypto 2005 MIT.edu
Henri Gilbert, Helena Handschuh: Security Analysis of SHA-256 and Sisters. Selected Areas in Cryptography 2003: pp175–193
unixwiz.net
"Proposed Revision of Federal Information Processing Standard (FIPS) 180, Secure Hash Standard". Federal Register. 59 (131): 35317–35318. 1994-07-11. Retrieved 2007-04-26.
A. Cilardo, L. Esposito, A. Veniero, A. Mazzeo, V. Beltran, E. Ayugadé, A CellBE-based HPC application for the analysis of vulnerabilities in cryptographic hash functions, High Performance Computing and Communication international conference, August 2010
External links[edit]
CSRC Cryptographic Toolkit – Official NIST site for the Secure Hash Standard
FIPS 180-4: Secure Hash Standard (SHS)
RFC 3174 (with sample C implementation)
Interview with Yiqun Lisa Yin concerning the attack on SHA-1
Explanation of the successful attacks on SHA-1 (3 pages, 2006)
Cryptography Research – Hash Collision Q&A
Hash Project Web Site: software- and hardware-based cryptanalysis of SHA-1
SHA-1 at DMOZ
Lecture on SHA-1 on YouTube by Christof Paar
v
t
e
Cryptographic hash functions & message authentication codes
List
Comparison
Known attacks
Common functions
MD5
SHA-1
SHA-2
SHA-3
BLAKE2
SHA-3 finalists
BLAKE
Grøstl
JH
Skein
Keccak (winner)
Other functions
CubeHash
ECOH
FSB
GOST
HAS-160
HAVAL
Kupyna
LM hash
MD2
MD4
MD6
MDC-2
N-Hash
RIPEMD
RadioGatún
SWIFFT
Snefru
Streebog
Tiger
VSH
Whirlpool
Key derivation functions
bcrypt
crypt
PBKDF2
scrypt
Argon2
MAC functions
DAA
CBC-MAC
HMAC
OMAC/CMAC
PMAC
VMAC
UMAC
Poly1305
SipHash
Authenticated
encryption modes
CCM
CWC
EAX
GCM
IAPM
OCB
Attacks
Collision attack
Preimage attack
Birthday attack
Brute-force attack
Rainbow table
Side-channel attack
Length extension attack
Design
Avalanche effect
Hash collision
Merkle–Damgård construction
Sponge function
HAIFA construction
Unique Block Iteration
Standardization
CRYPTREC
NESSIE
NIST hash function competition
Utilization
Hash-based cryptography
Key stretching
Merkle tree
Message authentication
Proof of work
Salt
[show]
v
t
e
Cryptography
History of cryptography
Cryptanalysis
Outline of cryptography
Symmetric-key algorithm
Block cipher
Stream cipher
Public-key cryptography
Cryptographic hash function
Message authentication code
Random numbers
Steganography
Category
Portal
WikiProject
Retrieved from "https://en.wikipedia.org/w/index.php?title=SHA-1&oldid=806558262"
Categories:
Cryptographic hash functions
Broken hash functions
Checksum algorithms
National Security Agency cryptography
Hidden categories:
Articles with Chinese-language external links
All articles with unsourced statements
Articles with unsourced statements from March 2016
Articles with unsourced statements from April 2017
Articles with specifically marked weasel-worded phrases from March 2017
Articles with unsourced statements from October 2016
All articles with specifically marked weasel-worded phrases
Articles with specifically marked weasel-worded phrases from September 2015
Articles containing potentially dated statements from 2013
All articles containing potentially dated statements
Articles with DMOZ links
Articles with example pseudocode
Pages using RFC magic links
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Article
Talk
Variants
Views
Read
Edit
View history
More
Search
Navigation
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Create a book
Download as PDF
Printable version
Languages
Български
Deutsch
Español
فارسی
Français
Hrvatski
Latviešu
日本語
Polski
Português
Русский
Srpskohrvatski / српскохрватски
Svenska
Türkçe
Українська
中文
Edit links
This page was last edited on 22 October 2017, at 20:20.
Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Developers
Cookie statement
Mobile view
Enable previews

key: html

type: local

value: div

attrs: id class

values: mw-page-base noprint

values: mw-head-base noprint

value: a

attrs: id class lang

values: firstHeading firstHeading en

values: siteSub noprint

values: jump-to-nav mw-jump

attrs: href class title

values:
/wiki/Secure_Hash_Algorithm
mw-redirect
Secure Hash Algorithm

value: th

attrs: colspan style

values: text-align:center;font-size:125%;font-weight:bold;padding-bottom:0.3em; background:transparent; line-height:1.1em; font-size:125%; font-weight:bold;

value: tr

value: img

attrs: alt src width height srcset data-file-width data-file-height

attrs: href class

value: td

attrs: href title

value: b

values: text-align:center;line-height: 1.25em; text-align: left

values: National Institute of Standards and Technology

values:
/wiki/Message_digest
mw-redirect
Message digest

values:
/wiki/SSL_certificate
mw-redirect
SSL certificate

values:
/wiki/CWI_Amsterdam
mw-redirect
CWI Amsterdam

attrs: alt src width height class srcset data-file-width data-file-height

values:
/wiki/Word_(data_type)
mw-redirect
Word (data type)

values: This claim needs references to reliable sources. (March 2016)

values:
noprint Inline-Template Template-Fact
white-space:nowrap;

values: This claim needs references to reliable sources. (April 2017)

values:
/wiki/Secure_Sockets_Layer
mw-redirect
Secure Sockets Layer

values:
/wiki/Distributed_revision_control
mw-redirect
Distributed revision control

values:
/wiki/Git_(software)
mw-redirect
Git (software)

values:
/wiki/Mercurial_(software)
mw-redirect
Mercurial (software)

values:
/wiki/U.S._government
mw-redirect
U.S. government

values:
/wiki/Revision_control
mw-redirect
Revision control

values:
/wiki/Second_preimage_resistance
mw-redirect
Second preimage resistance

values: Edit section: Cryptanalysis and validation

values:
/wiki/Xiaoyun_Wang
mw-redirect
Xiaoyun Wang

values: The material near this tag may use weasel words or too-vague attribution. (March 2017)

values: Wikipedia:Manual of Style/Words to watch

values: Edit section: SHAttered – first public collision

values:
/wiki/CRYPTO_(conference)
mw-redirect
CRYPTO (conference)

values:
/wiki/Hash_collision
mw-redirect
Hash collision

values: This claim needs references to reliable sources. (October 2016)

values: The material near this tag possibly uses too-vague attribution or weasel words. (September 2015)

values:
plainlinks noprint asof-tag update
display:none;

values: Edit section: Comparison of SHA functions

values: Template talk:Comparison of SHA functions

values: background: #faa; color: black; vertical-align: middle; text-align: center;

values: background: #bfd; color: black; vertical-align: middle; text-align: center;

values: Comparison of cryptographic hash functions

values: International Association for Cryptologic Research

values:
nofollow
external text
https://support.apple.com/HT207459

values:
nofollow
https://shattered.io/
external text

values:
nofollow
external text
http://x5.net/faqs/crypto/q150.html

values:
nofollow
external text
//doi.org/10.1007%2F11535218_2

values:
nofollow
http://keccak.noekeon.org/
external text

values:
nofollow
external text
http://www.schneier.com/book-ce.html

values:
nofollow
external text
http://eprint.iacr.org/2005/010

values:
nofollow
external text
http://eprint.iacr.org/2007/474

values:
nofollow
external text
http://eprint.iacr.org/2010/413

values:
nofollow
external text
http://eprint.iacr.org/2008/469.pdf

values:
nofollow
external text
http://eprint.iacr.org/2009/259

values:
nofollow
https://code.google.com/p/hashclash/
external text

values:
nofollow
external text
http://www.faqs.org/rfcs/rfc3174.html

values:
nofollow
external text
http://tools.ietf.org/html/rfc1321

values:
nofollow
http://sponge.noekeon.org/
external text

values: -moz-column-width: 30em; -webkit-column-width: 30em; column-width: 30em; list-style-type: decimal;

values:
nofollow
http://eprint.iacr.org/2004/146/
external text

values:
external mw-magiclink-rfc
nofollow
//tools.ietf.org/html/rfc3174

values:
nofollow
external text
http://www.hashproject.eu

values: Unique Block Iteration (page does not exist)

values: Cryptographically secure pseudorandom number generator

attrs: alt src title width height srcset data-file-width data-file-height

values: nowraplinks collapsible collapsed navbox-subgroup

values: Category:National Security Agency cryptography

values: Category:Articles with Chinese-language external links

values: Category:All articles with unsourced statements

values: Category:Articles with unsourced statements from March 2016

values: Category:Articles with unsourced statements from April 2017

values: Category:Articles with specifically marked weasel-worded phrases from March 2017

values: Category:Articles with unsourced statements from October 2016

values: Category:All articles with specifically marked weasel-worded phrases

values: Category:Articles with specifically marked weasel-worded phrases from September 2015

values: Category:Articles containing potentially dated statements from 2013

values: Category:All articles containing potentially dated statements

values: Category:Articles with example pseudocode

values: Discussion about edits from this IP address [ctrl-alt-n]

values: A list of edits made from this IP address [ctrl-alt-y]

values: You are encouraged to create an account and log in; however, it is not mandatory

values: You're encouraged to log in; however, it's not mandatory. [ctrl-alt-o]

values:
/wiki/SHA-1
View the content page [ctrl-alt-c]
c

values: Discussion about the content page [ctrl-alt-t]

values: p-namespaces navigation vectorTabs p-namespaces-label

values:
p-variants
navigation
vectorMenu emptyPortlet
p-variants-label

values:
/w/index.php?title=SHA-1&action=edit
Edit this page [ctrl-alt-e]
e

values: Past revisions of this page [ctrl-alt-h]

values: p-views navigation vectorTabs p-views-label

values:
p-cactions
navigation
vectorMenu emptyPortlet
p-cactions-label

values:
mw-wiki-logo
/wiki/Main_Page
Visit the main page

values:
/wiki/Main_Page
Visit the main page [ctrl-alt-z]
z

values: Permanent link to this revision of the page

values: Link to connected data repository item [ctrl-alt-g]

values: Printable version of this page [ctrl-alt-p]

values:
https://bg.wikipedia.org/wiki/SHA-1
SHA-1 – Bulgarian
bg
bg
interlanguage-link-target

values:
https://de.wikipedia.org/wiki/SHA-1
SHA-1 – German
de
de
interlanguage-link-target

values: اس‌اچ‌ای-۱ – Persian

values:
https://fr.wikipedia.org/wiki/SHA-1
SHA-1 – French
fr
fr
interlanguage-link-target

values:
https://hr.wikipedia.org/wiki/SHA-1
SHA-1 – Croatian
hr
hr
interlanguage-link-target

values:
https://ja.wikipedia.org/wiki/SHA-1
SHA-1 – Japanese
ja
ja
interlanguage-link-target

values:
https://pl.wikipedia.org/wiki/SHA-1
SHA-1 – Polish
pl
pl
interlanguage-link-target

values:
https://pt.wikipedia.org/wiki/SHA-1
SHA-1 – Portuguese
pt
pt
interlanguage-link-target

values:
https://ru.wikipedia.org/wiki/SHA-1
SHA-1 – Russian
ru
ru
interlanguage-link-target

values:
https://sh.wikipedia.org/wiki/SHA-1
SHA-1 – Serbo-Croatian
sh
sh
interlanguage-link-target

values:
https://sv.wikipedia.org/wiki/SHA-1
SHA-1 – Swedish
sv
sv
interlanguage-link-target

values:
https://tr.wikipedia.org/wiki/SHA-1
SHA-1 – Turkish
tr
tr
interlanguage-link-target

values:
https://uk.wikipedia.org/wiki/SHA-1
SHA-1 – Ukrainian
uk
uk
interlanguage-link-target

values:
https://zh.wikipedia.org/wiki/SHA-1
SHA-1 – Chinese
zh
zh
interlanguage-link-target

values:
suggestions
display: none; font-size: 13px;

values: mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject page-SHA-1 rootpage-SHA-1 vector-experimental-print-styles vector-nav-directionality skin-vector action-view