text:
User talk:Emersonbiggins

Hi! welcome to Wikipedia!

Hope you enjoy contributing to Wikipedia. Be bold in editing pages. Here are some links that you might find useful:

 * Try the Tutorial. If you have less time, try How to edit a page.
 * To sign your posts (for eg. on talk pages) use 	 ~  (four tildes). This will insert your name and timestamp. To insert just your name, type (3 tildes).
 * You can experiment in the Sandbox.
 * For help, see Where to ask a question.
 * Some other pages that will help you know more about Wikipedia: Manual of Style and Five pillars, Neutral point of view, Civility, What Wikipedia is not
 * You can contribute in many ways: write a great article, fight vandalism, upload pictures, perform maintainance tasks, contribute to existing projects...

I hope you stick around and keep contributing to Wikipedia. Drop us a note at New user log.

-- utcursch | talk

Image:Faux chateau.jpg
Thank you for uploading Image:Faux chateau.jpg. Its copyright status is unclear, so it may have to be deleted. Please leave a note on the image page about the source of the image. Thank you. --Kevin McManus 22:36, Jun 17, 2005 (UTC)

title: User talk:Emersonbiggins


text:
Gretchen Bleiler

Gretchen Elisabeth Bleiler (born April 10, 1981) is an American former professional halfpipe snowboarder. She won a silver medal at the 2006 Olympics.

Career
Born in Toledo, Ohio, Bleiler aspired to compete in the Winter X Games from a very young age, and found her passion in snowboarding at age 11 (1992). She has been riding ever since and became professional in 1996. Among her accomplishments, she jump-started the invert revolution for female riders as the first to land a Crippler 540 in competition, and won more halfpipe competitions in 2003, 2005 and 2006 than any other female snowboarder. In the pre-Olympic season she won four of the five US Olympic halfpipe qualifiers and is also a four-time X Games gold medalist, most recently winning the superpipe at Winter X Games XIV.

In 2003, she was a U.S. snowboard Grand Prix champion, a U.S. Open of snowboarding champion, and a Triple Crown of Snowboarding champion.

She posed for the February 2004 issue of FHM, along with fellow snowboarder Tara Dakides and sportscaster Jamie Little.

Bleiler, who missed qualifying for the 2002 Winter Olympics due to a tiebreaker, won a silver medal in the women's halfpipe at the 2006 Winter Olympics in Turin, Italy.

Starting in 2007, Bleiler expanded her career into snowboard and outerwear design, through Oakley and K2 Snowboarding, designing her own signature outerwear line for Oakley, and participating in the K2 Alliance, which develops and tests women's products, as well as working on the graphics for several K2 Boards. In 2008, she helped to create a new all-female invitational superpipe competition at Snowmass called the Snow Angels Invitational.

While competing in the Vancouver 2010 Winter Olympics, many considered Bleiler a gold medal favorite. However, she fell on both of her final runs, and took 11th place.

During the summer, Gretchen Bleiler coaches and mentors youth at High Cascade Snowboard Camp. In 2008, 2010, and 2014 she was awarded a Signature Session at High Cascade.

Bleiler announced her retirement in January 2014 after being injured in a 2012 training accident and failing to make the 2014 Winter Olympics team. She is currently pursuing speaking, writing, teaching, activism and being an entrepreneur; she is an owner of ALEX Bottle (which stands for "Always Live EXtraordinarily") with her husband Chris.

Career highlights

 * 2010 X Games Superpipe Gold Medalist
 * 2008 Winter Dew Tour Superpipe Champion (Breckenridge, Co)
 * 2008 X Games Halfpipe Gold Medalist
 * 2006 FIS World Cup 1st Place, Saas Fe, Switzerland
 * 2006 Olympic silver medalist
 * 2006 Overall Grand Prix Champion; won four of the five Grand Prix events determining Olympic team
 * 2005 X Games and Gravity Games Gold Medalist
 * 2005 US Open Halfpipe Champion
 * FIS World Cup 1st Place, Bardonecchia, Italy
 * Eight straight wins in 2003
 * 2003 X Games Halfpipe Gold Medalist
 * 2003 US Open Champion
 * Won 2003 Overall Grand Prix Title
 * One of only four females invited to coveted 2003 Arctic Challenge
 * 2002 and 2003 Vans Triple Crown Overall Title Winner
 * Won 2003 World SuperPipe Championships

Awards

 * Voted 2006 Female Snowboarder of the Year at FUEL TV's inaugural Action Sports Awards
 * Nominated for 2006 ESPY Award
 * Won 2004 Colorado Female Athlete of the Year Award
 * Earned Transworld Snowboarding's Reader's Choice Award in 2004
 * Nominated for 2004 Laureus "Female Action Sports Athlete" Award
 * Named Snowboarder and Transworld Snowboarding 2003 "Female Rider of the Year"
 * Nominated for 2009 Teen Choice Awards "Other Action Sports Athlete – Female"

Personal life
Bleiler enjoys surfing, mountain biking, interior design and fashion. She is also active in several environmental organizations, including the Aspen Snomass Save Snow campaign, and stopglobalwarming.org.

She lives in Aspen, Colorado and is married to Chris Hotell.

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: Gretchen Bleiler


text:
Wikipedia:Articles for deletion/Chocolate stars

Chocolate stars
This is a specific way of packaging a mix of shrooms and mescaline, apparently. I can't find any evidence on google that it's widely used, or even used at all. Could it be... drugcruft? heh. sorry. Cdc 07:29, 16 Dec 2004 (UTC)
 * Does not seem to be a notable concoction. Delete. Does this mean I can't post my recipe for DMT and acid soup? (Just kidding folks) [[User:Livajo|Ливай | ☺]] 07:52, 16 Dec 2004 (UTC)
 * Delete --Gene s 09:11, 16 Dec 2004 (UTC)
 * Delete. You will get some google results for Chocolate stars, but star here refers to shape, not a new recipe. If we keep this article, we might have new ones like Chocolate squares, Chocolate triangles... utcursch 10:00, Dec 16, 2004 (UTC)
 * Delete. Seems to be a popular generic shape for molding chocolate, nothing notable about the idea that someone mixes candy with drugs. iMeowbot 10:01, 16 Dec 2004 (UTC)
 * Delete, not notable Wyss 10:49, 16 Dec 2004 (UTC)
 * Delte. Neologism, dicdef, not notable. P Ingerson 13:23, 16 Dec 2004 (UTC)
 * Delete --fvw *  19:54, 2004 Dec 16 (UTC)


text:
Wellington, Washington

Wellington (later known as Tye) was a small unincorporated railroad community in the northwest United States, on the Great Northern Railway in northeastern King County, Washington.

Founded in 1893, it was located in the Cascade Range at the west portal of the original Cascade Tunnel under Stevens Pass. It was the site of the 1910 Wellington avalanche, the worst in U.S. history, in which 96 people died.

1910 avalanche
The Wellington avalanche was the deadliest avalanche in the history of the United States, marked by the total death count of 96.

For nine days at the end of February 1910, the Wellington area experienced a severe blizzard. Up to a foot (30 cm) of snow fell every hour, and, on the worst day, 11 ft of snow fell. Two trains, a passenger train and a mail train, both bound from Spokane to Seattle, were trapped in the depot. Snow plows were present at Wellington and others were sent to help, but they could not penetrate the snow accumulations and repeated avalanches along the stretch of tracks between Scenic and Leavenworth.

Late on February 28, the snow stopped and was replaced by rain and a warm wind. Just after 1 a.m. on March 1, as a result of a lightning strike, a slab of snow broke loose from the side of Windy Mountain during a thunderstorm. A ten-foot high mass of snow, half a mile long and a quarter of a mile wide, fell toward the town. A forest fire had recently ravaged the slopes above the town, leaving very little to impede the avalanche.

The avalanche missed the Bailets Hotel (which also housed the town's general store and post office), but hit the railroad depot. Most of the passengers and crew were asleep aboard their trains. The impact threw the trains 150 ft downhill and into the Tye River valley. Ninety-six people were killed, including 35 passengers, 58 Great Northern employees on the trains, and three railroad employees in the depot. Twenty-three people survived; they were pulled from the wreckage by railroad employees who immediately rushed from the hotel and other buildings where they had been staying. However, the work was then abandoned because of the adverse weather conditions, and it was not until 21 weeks later (late July) that the last of the bodies were retrieved.

This was not the only avalanche in the region that winter. Three days later, 63 railroad workers were killed in the Rogers Pass avalanche nearby in British Columbia.

Aftermath
Wellington was quietly renamed "Tye" during October because of the unpleasant associations of the old name. In the same month, the Great Northern Railway began construction of concrete snow sheds to shelter the nearby tracks. The depot was closed when the second Cascade Tunnel was completed in 1929; the town was then abandoned and it eventually burned.

Considered a ghost town, the old track and snow sheds remain and have been preserved as part of the Iron Goat Trail, which is accessible from U.S. Highway 2 near Stevens Pass or near Scenic, east of Everett.

title: Wellington, Washington


text:
Brande Roderick

Brande Nicole Roderick (born June 13, 1974) is an American model and actress known for her appearances in Baywatch and Playboy. In April 2000, she was selected as Playmate of the Month and then became the Playmate of the Year in 2001.

Career
In 2000, Roderick starred as Leigh Dyer in Baywatch. In April 2000, she appeared in Playboy magazine as Playmate of the Month. In 2001, Roderick became the Playmate of the Year. In 2003, she starred in the Bollywood movie Out of Control, as the American wife of an Indian man (played by Riteish Deshmukh) who, on a visit to India, gets pressured by his family into marrying an Indian girl.

Other recent film credits include Starsky & Hutch, Snoop Dogg's Hood of Horror, Club Wild Side 2 and The Nanny Diaries. In addition, she has guest-starred in Joey, The Parkers, Just Shoot Me!, Fear Factor and Beverly Hills, 90210.

Appearances
Roderick is a "Girl of RPS" for the USA Rock Paper Scissors League. In 2006, Roderick was one of six celebrity contestants on the CBS summer series, Gameshow Marathon. She was the runner-up to Kathy Najimy. In 2009, she appeared in the second season of Celebrity Apprentice. Throughout the season, each celebrity raised money for a charity of his or her choice; Roderick selected the California Police Youth Charities. On the second to last episode of Celebrity Apprentice 2, she was eliminated along with fellow contestant Jesse James from the final four.

In April 2009, Roderick served as host of the Playboy Shootout reality competition on Playboy TV.

In February 2012, Roderick hosted the Aces & Angels Super Bowl XLVI Party in Indianapolis, Indiana alongside Leeann Tweeden and Elaine Alden. In 2013 she returned in Celebrity Apprentice 6 All-Star, with Claudia Jordan and Dennis Rodman of season 2.

Ventures
As of 2008, Roderick had a networking company named Financially Hung. She described the company as being "like MySpace for adults."

She also has a business partnership with Adam Levine of Maroon 5 in the Italian designer shoe label Pantofola d'Oro.

Personal life
Roderick was born in Novato, California, and attended Santa Rosa Junior College. She dated the late Playboy founder Hugh Hefner from 2000 to 2001 and was also romantically linked to former NFL player Cade McNown. In August 2006, she became engaged to Glenn Cadrez, a former NFL player who played 11 seasons for the Denver Broncos, the New York Jets and the Kansas City Chiefs. They married in June 2007 and have two sons. They divorced in 2017.

title: Brande Roderick


text:
Grey College, Bloemfontein

Grey College (Afrikaans: Grey Kollege) is a semi-private English & Afrikaans medium school for boys situated in the suburb of Universitas in Bloemfontein in the Free State province of South Africa, it is one of the 23 Milner Schools. The sister school is Eunice High School (Bloemfontein).

Grey College was ranked 1st among high schools in Africa by Africa Almanac in 2003 and 2013, based upon quality of education, student engagement, strength and activities of alumni, school profile, internet and news visibility.

History
The school was officially opened on 13 October 1855 and the first headmaster was the Reverend Andrew Murray. Believed by scholars and alumni to be the third-oldest school in South Africa, there are in fact several other schools that were established at earlier dates as far back as 1738. With formal education being established later in the northern regions of the country, it is the oldest school north of the Orange River.

During his presidential inauguration speech in 1896, while addressing learners from Grey College, Marthinus Theunis Steyn mentioned that he envisioned a university for Bloemfontein where youth from all over the country could come and study. He supported the idea that Grey College should provide higher education to the people of the Orange Free State. As a result, the University of the Free State essentially came into existence in 1904 when a tertiary portion of Grey College was allocated for such purpose.

Grey College today
The school grounds consist of a number of historic buildings, of which five are Free State provincial heritage sites: the Main building and Hamilton Hall, the Andrew Murray House, the Brill House and the Tuck shop.

The school offers a number of scholarships such as the Badawi Legacy scholarship given in partnership with Montpellier Rugby Club to promote rugby, education and French culture. Old Greys donate funds to the Jock Meiring Trust and Bram Fisher Trust, funds used for the administration of school grounds and granting of scholarships.

Grey College is known nationally as being particularly strong at the sport of rugby, the "secret" handshake, and old boys speaking passionately about their school.

Notable alumni

 * Laurens van der Post Sir Laurens van der Post was political adviser to British heads of government, close friend of King Charles III, godfather of Prince William, educator, journalist, humanitarian, philosopher, explorer and conservationist.
 * Ernst Oswald Johannes Westphal, linguist and scholar, of the School of Oriental and African Studies and the University of Cape Town.
 * Jopie Fourie, military scout & dispatch rider
 * Etienne Leroux, Afrikaans author and a key member of the South African Sestigers literary movement.
 * Charl du Plessis, pianist.
 * Denis Earp, chief of the South African Air Force
 * Bram Fischer, anti-apartheid activist and advocate for Nelson Mandela in the Rivonia Trial
 * Steve Hofmeyr, singer, songwriter, actor, political activist
 * Deneys Reitz, Boer soldier, South African soldier in the First World War, and politician.
 * Martinus Theunis Steyn, president of the Orange Free State
 * Pieter Uys, Vodacom CEO
 * Pierre van Ryneveld, founding commander of the South African Air Force

Athletes

 * Ryk Neethling, Olympic gold medalist swimmer
 * Pierre-Gerard Geldenhuys, South African Men's Field & Indoor Hockey
 * L.J. van Zyl, athlete, Commonwealth Games champion in the 400m Hurdles
 * Wayde van Niekerk, Olympic Gold Medalist 400m Athlete & World record holder 400m track
 * Richardt Strauss, Ireland international rugby player

 * South Africa national cricket team players
 * Kepler Wessels
 * Victor Mpitsang
 * Nicky Boje
 * Hansie Cronjé (his ashes are kept at the school)
 * Ryan McLaren
 * Boeta Dippenaar

 * Springbok rugby players
 * CJ van der Linde
 * Flip van der Merwe
 * Francois Venter
 * Popeye Strydom
 * Deon Stegmann
 * François Steyn
 * Johan Goosen
 * Coenie Oosthuizen
 * Ruan Pienaar (also played for Ulster)
 * Pieter Muller
 * Ruben Kruger (Rugby World Cup 1995 winning team)
 * Ollie le Roux
 * Tiaan Liebenberg
 * Louis Babrow
 * Heinrich Brüssow
 * Naka Drotské (Rugby World Cup 1995 winning team)
 * Bismarck du Plessis (Rugby World Cup 2007 winning team)
 * Jannie du Plessis (Rugby World Cup 2007 winning team)
 * Morne du Plessis (member of the International Rugby Hall of Fame)
 * Wian du Preez
 * Charl Marais
 * Johan Styger
 * Heinrich Füls
 * Werner Swanepoel
 * Helgard Muller
 * Adriaan Strauss
 * Andries Truscott
 * Cobus Reinach
 * Jaco Reinach

 * Bafana Bafana football players
 * Tshegofatso Mabasa(Orlando Pirates Player)

title: Grey College, Bloemfontein


text:
Talk:Polyalphabetic cipher

Here vs Alberti cipher disk
The method of using Alberti's disk described here is much less secure than the one described at the page for the disk.

Here vs Substitution cipher
This is a little odd. The summary form of this article in Substitution cipher is actually somewhat larger and has more factual content than this article! - Ta bu shi da yu 07:35, 16 Dec 2004 (UTC)
 * Yes, I agree that it's a little strange; see Talk:Substitution cipher. — Matt Crypto 07:49, 16 Dec 2004 (UTC)

Ralph Morelli's Page
Just a note from a Wikipedian curious about cryptography. I googled to find Morelli's page About the Alberti cipher and think it might make a useful source. It includes howto information. At present I'm simply trying to solve a clue given in the Starfest 2005 House of Vampyr Treasure Hunt. <>< tbc 16:22, 1 May 2005 (UTC)

title: Talk:Polyalphabetic cipher


text:
Daniel Greaves (musician)

Daniel Greaves (born 1 December 1970) is a Canadian rock vocalist and songwriter. He is known as the founder and lead singer of the band The Watchmen, and for his a capella singing.

The Watchmen
In 1988, Greaves became the lead singer of The Watchmen, which he co-formed with Joey Serlin, Sammy Kohn and Pete Loewen. The Watchmen were a successful alternative rock band most active in the 1990s. Greaves also played keyboards and harmonica in the band. Between 1992 and 2001, they released six records internationally, toured extensively and built a substantial fan base in Canada and Australia. Each of their album releases achieved either gold or platinum status in Canada.

In 2003, the band members decided to separate and explore different opportunities individually, but still continue to perform with each other from time to time. Since the 2003 split, Greaves has worked with former Watchmen bandmate Ken Tizzard in the duo Audio Playground High + Wide. Tizzard and Greaves performed in a series of live visual music presentations at venues such as Ted's Wrecking Yard and the Berkley Church. The Watchmen reunited several years after their split, and they continue to play regular concerts across Canada.

Doctor
After leaving The Watchmen, Greaves founded the band Doctor with bassist Rob Higgins, a former member of Change of Heart.

The duo was joined in studio by guitarist Jamie Edwards and drummer Dan Cornelius to record the band's debut album, High Is As High Gets, which was licensed on SUMO Music and released in 2004. The four musicians also began touring following the album's release, with Carmen Lamont occasionally filling in for Edwards on guitar. Doctor broke up in 2005.

Serlin Greaves
Joey Serlin and Daniel Greaves of The Watchmen are set to release their debut album, Sad Songs For Sale, on May 28.

Film and TV
In between performing and recording with his bands, Greaves worked on a number of film and television projects. He was the music supervisor, composer, and audio mixer for the 2000 film, Kanadiana (featured in the Montreal World Film Festival), the 2002 feature film, The Risen (starring Alberta Watson and Eugene Lipinski), Trevor Cunningham's 2003 feature film The Pedestrian, and director Brett Blackwell's 2010 film, Happiness is Hate Therapy, which originally aired on Bravo!.

Later, The Watchmen tracks, The South and Sleep, were included on the soundtrack of the 2010 TIFF selected film The Whistleblower.

Greaves provided original music for MTV's 2002 Everybody’s Doing It. His music can also be heard on regularly on CSI (CTV), Divine Design with Candice Olson (HGTV), and Take it Outside (HGTV).

Other work and appearances
In 2005, Greaves contributed vocals to the track "This Longing" on the Neverending White Lights debut CD Act 1: Goodbye Friends of the Heavenly Bodies. In 2006, he contributed to Winnipeg producer Darcy Ataman's new tune "A Song for Africa" which was a benefit project to raise funds for African AIDS relief. In 2006, he composed the soundtrack to a new drinking and driving commercial commissioned by Saskatchewan Government Insurance (SGI).

Greaves has also been heard on the CBC Music radio network, as a fill-in host and as the current Saturday host of Weekend Mornings.

Personal life
Greaves rarely spoke about his racial identity during the height of the Watchmen's career; however, in 2020, amid the global reckoning around racism that followed the murder of George Floyd, he wrote a first-person essay for CBC Radio reflecting on how his upbringing as the son of a Black Canadian father and a Jewish mother had shaped him.

Greaves is a partner in Toronto's Lakeview Restaurant with Fadi Hakim. In late 2010 the restaurant company opened a coffee shop called The Abbott in Toronto's Parkdale. He and his wife Lisa also own The Motel Bar in Parkdale.

His brother, David Greaves, who has dual Canadian-Israeli citizenship, is a member of the Israeli Bobsled Team.

The Watchmen Discography

 * 1992 – McLaren Furnace Room
 * 1994 – In the Trees
 * 1996 – Brand New Day
 * 1998 – Silent Radar, Live Radar
 * 2001 – Slomotion (double CD)
 * 2004 - Last Road Trip Download Series

Doctor Discography
Track listing: • # "What Makes You Think He's Lucky" (3:07)
 * 2004 - High Is As High Gets

• # "Get Your Own War" (3:29)

• # "Balancing" (3:23)

• # "Sweet U" (4:50)

• # "What Of It" (3:18)

• # "Weight" (2:57)

• # "It Don't Mean A Thing" (3:39)

• # "High Is As High Gets" (4:25)

• # "You're Not Giving At All And I'm Not Getting Past It" (4:37)

• # "Living The Dream" (3:58)

• # "You Saved Me" (3:16)

• # "Me And Nick Drake" (4:10)

Serlin Greaves Discography

 * 2021 – Sad Songs For Sale

Filmography

 * 2000 - Kanadiana
 * 2002 - The Risen
 * 2002 - Everybody’s Doing It (TV)
 * 2003 - The Pedestrian.
 * 2010 - Happiness is Hate Therapy

title: Daniel Greaves (musician)


text:
Joey Serlin

Joey Serlin (born 1970) is a Canadian rock guitarist and songwriter.

He was a member of The Watchmen, a Canadian alternative rock band active in the 1990s. Following that band's breakup, he worked with Canadian Idol winners Ryan Malcolm and Kalan Porter, and formed the band Redline with Watchmen touring drummer Ryan Ahoff and Headstones bassist Tim White, although that band broke up in 2005. He has scored both short and feature films, as well as composing music for major video games.

Serlin is partner, composer and director for Vapor music, an award-winning audio house with offices in Toronto, Vancouver, Chicago, and San Francisco. While at Vapor, Serlin has composed music for international commercials for brands such as Budweiser, Coke, Nintendo, GM, Nissan and Chrysler.

The Watchmen reunited in September 2009 for select shows and are working on new material.

title: Joey Serlin


text:
Orna Lin

Orna Lin (ארנה לין) (born 1956) is the owner of a private law firm, Orna Lin & Co. and a leading labor lawyer in Israel.

Biography
Orna Lin is the daughter of former Israeli Knesset member Amnon Lin and granddaughter of Haifa's first Jewish mayor, Abba Hushi. She is a graduate of the Hebrew University of Jerusalem.

Legal career
Lin has been a member of the Israeli Bar since 1981. She was a partner at M. Seligman & Co., one of the largest law firms in Israel. In 1999-2003, she headed the Tel Aviv Bar Association, the first woman to serve in this position.

She is chairperson of the Israel Bar Association Council, also the first woman to hold this post. She lectures in labor law at Tel Aviv University.

Personal life
She lives in Tel Aviv and together, she and her partner Rivka Neumann

title: Orna Lin


text:
Little hermit

The little hermit (Phaethornis longuemareus) is a hummingbird that is a resident breeder in north-eastern Venezuela, northern Guyana, Suriname, French Guiana and Trinidad. This lowland species occurs in various semi-open wooded habitats, e.g. mangrove, secondary forest, plantations and scrub. In Trinidad it also occurs in rainforest. It is fairly common in most of its range, and therefore listed as Least Concern by BirdLife International.

Previously, several other small hermits were considered subspecies of this species. This includes the stripe-throated hermit (P. striigularis) of Central America and north-western South America, the minute hermit (P. idaliae) of south-eastern Brazil, the Tapajós hermit (P. aethopyga) of south-eastern Amazonia, and the black-throated hermit (P. atrimentalis) of western Amazonia. As presently defined, the little hermit is monotypic.

It is among the smallest hummingbirds and birds overall with a total length of ca. 9 cm. (3½ in) and a weight of 2½-3½ g. (0,08-0,12 oz). It is olive-green above with orange-ochraceous uppertail coverts and underparts (the belly often is greyer). As most other hermits, it has a long decurved bill, elongated central rectrices with whitish tips and a blackish mask bordered by a whitish-buff malar and supercilium. The upper mandible is black, the lower is yellow with a black tip. The male has a slightly darker throat than the female.

The males form communal leks where they sing and flash their tails to attract the females. The song varies over its range, but typically is high, squeaky, complex and repeated again and again.

The little hermit lays two eggs in a conical nest suspended under a large leaf. Incubation and fledging period not reported, but probably as relatives where incubations is 14–16 days, and fledging another 20–23 days.

The food of this species is nectar, taken from a wide variety of flowers (e.g. Heliconia), and some small insects and spiders. It feeds mainly by trap-lining.

title: Little hermit


text:
Condition

Condition or conditions may refer to:

In philosophy and logic

 * Material conditional, a logical connective used to form "if...then..." statements
 * Necessary and sufficient condition, a statement which is true if and only if another given statement is true

In computer science

 * Exception handling, a generalization of exceptions in exception handling
 * Condition (SQL), a filtering mechanism in relational database queries
 * Condition variable, a synchronization primitive in concurrent programming

In medicine

 * Medical condition, as a synonym for disease
 * Medical state or condition, a patient's clinical status in a hospital

In numerical analysis

 * Condition number, a measure of a matrix in digital computation

In arts and entertainment

 * Condition (film), a 2011 film
 * Conditions (album), 2009 debut album by Australian rock band The Temper Trap
 * Conditions (magazine), an annual lesbian feminist literary magazine
 * Conditions (band), an American rock band
 * Just Dropped In (To See What Condition My Condition Was In), a song written by Mickey Newbury and first released in 1967
 * Status effect, a temporary condition of a character in computer gaming

Other uses

 * Conditions (Russia), part of the constitution of Russia, signed by Anna of Russia in 1730
 * In contract law, part of covenants, conditions and restrictions
 * Living condition
 * State of being

title: Condition


text:
Talk:Linear cryptanalysis

Comment from page
Well, in fact everybody knows (and Matsui himslef acknowledges ti in his paper) that LC was first invented by Hneri Gilbert and his student: see Anne Tardy-Corfdir, Henri Gilbert: A Known Plaintext Attack of FEAL-4 and FEAL-6, In Crypto'91, LNCS 576, Springer, pp. 172-181, 1992. —The preceding unsigned comment was added by 82.241.89.189 (talk • contribs).
 * Hmm. Linear cryptanalysis seems to be widely attributed to Matsui. For example, Alex Biryukov, in his entry on "Linear Cryptanalysis" for the Encyclopedia of Cryptography and Data Security, asserted that the technique was introduced by Matsui in 1993. — Matt Crypto 18:44, 9 December 2005 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on Linear cryptanalysis. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20070926205624/http://homes.esat.kuleuven.be/~abiryuko/Cryptan/matsui_des.PDF to http://homes.esat.kuleuven.be/~abiryuko/Cryptan/matsui_des.PDF
 * Added archive https://web.archive.org/web/20130928011123/http://nsfsecurity.pr.erau.edu/crypto/lincrypt.html to http://nsfsecurity.pr.erau.edu/crypto/lincrypt.html

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 10:03, 16 May 2017 (UTC)

title: Talk:Linear cryptanalysis


text:
Talk:Classical cipher

Comments for Kim
WOW! Kim, you added a LOT of information to this page! Great work :) I really like how you structured the page with subheadings. I think it was a great idea to incorporate the diagrams in order to successfully explain the Vigenere square, etc. The one thing I did notice is just a small spelling error in your bottom section. The sentence reads: "It uses an asymmetric cipher, where the key for encoding the message in different than the key needed to decode the message" I'm guessing you meant 'is' different, not 'in'. But other than that, I think you did a fantastic job!!!

Mazzy29 (talk) 00:17, 24 April 2009 (UTC)

Wow again! You did a great job making this article as thorough as possible. This page has most likely left the realm of stub-hood... In fact, a suggestion might be to reduce the material on this page, since there are already whole articles on the transposition and substitution ciphers. If you want, I guess you could add a bit on how else ciphers have evolved from "classical times", other than public key cryptography?

Fforeffort (talk) 04:33, 27 April 2009 (UTC)

Discussion of modern cryptography
I'm removing the following paragraph because it makes little sense.
 * Since the use of classical ciphers, enciphering and encoding have come a long way. One innovative new method of enciphering is public key cryptography, which does not require an exchange of the key used to encode the message. It uses an asymmetric cipher, where the key for encoding the message is different than the key needed to decode the message. An example of this is RSA, which uses an algorithm to calculate the key.
 * Since the use of classical ciphers, enciphering and encoding have come a long way. One innovative new method of enciphering is public key cryptography, which does not require an exchange of the key used to encode the message. It uses an asymmetric cipher, where the key for encoding the message is different than the key needed to decode the message. An example of this is RSA, which uses an algorithm to calculate the key.

 * Symmetric ciphers are still in use today; they just involve different methods than in the past. One example is the block cipher, which involves bits (binary digits) and a mathematical formula to encode the text. Encryption today has become more complicated and mathematical, which, as a result, makes messages harder to decipher. Now, instead of being done by hand, most ciphers are computerized. This makes them more efficient and easier to create, but harder to crack. Ciphers have come far since Caeser shifts and Vigenère squares. As times evolve, so do ciphers.

First, an article about classical ciphers is not the place to discuss public key cryptography. Furthermore, the text is not precise. E.g., RSA still needs a key exchange it just this key exchange does no longer have to be secret. The claim that RSA uses an algorithm doesn't say much. Every cipher uses some algorithm. Equally empty are the claims modern symmetric ciphers are different than classical ciphers or that block ciphers use bits. Just because ciphers are complicated and mathematical does not imply that the are necessarily hard to decipher. 85.3.246.238 (talk) 22:31, 27 May 2009 (UTC)

Napoleon's ciphers
The sentence "Many classical ciphers were used by well-respected people, such as Julius Caesar and Napoleon, who created their own ciphers" raises more questions than it answers.

Which ciphers did Caesar create? (Would this article be improved by an explicit link to the Caesar cipher article?)

Which ciphers did Napoleon create? (Is this perhaps an allusion to the "Army of Portugal Code" and the "Great Paris Code" (based on the "Great Cipher"), both mentioned in our George Scovell article? My understanding is that Napoleon may have promoted both ciphers, in the same way that Lord Playfair promoted the Playfair cipher, but it seems unlikely to me that Napoleon created either cipher).

--DavidCary (talk) 16:25, 12 March 2015 (UTC)

New Classical Cipher
Hi,

There is a newly discovered classical cipher that you may be interested in. Please see the following link.

http://ctext.org/discuss.pl?if=en&thread=2610624

W. K. Choy (talk) 16:39, 30 September 2016 (UTC)

The classical cipher that I referred to earlier is encrypted in the Shuowen Jiezi, a Chinese etymological dictionary that was compiled c.100AD. Therefore, the encrypted ciphertext message is 1,900 years old.

This is the very tip of the iceberg. There is an amazing cipher language that western scholars are not aware of. This cipher language is classical Chinese. The sinologists David Moser said, "Here's a secret that sinologists won't tell you: A passage in classical Chinese can be understood only if you already know what the passage says in the first place." (David Moser, 'Why Chinese Is So Damn Hard', http://pinyin.info/readings/texts/moser.html )  David Moser is saying that sinologists do not understand classical Chinese!

Everyone who understands modern (vernacular) Chinese, including sinologists and over 1 billion Chinese people, is taught to read the externalised value of a Chinese character. But a Chinese character is a compound of multiple logographs, each of which means something. When all these logographs are read, you will arrive at the plaintext contained within a Chinese character. The problem is that these sub-component logographs are either not read, not read properly, or cannot be read because one or more sub-comonent logographs have been encrypted.

An entire cipher language exists. Mind boggling but true. This cipher language awaits the attention of cryptologists or cryptographers.

Please feel free to contact me for further details.

W. K. Choy (talk) 06:55, 3 October 2016 (UTC)

title: Talk:Classical cipher


text:
Talk:HMAC

timing attacks ?!
"At least theoretically a timing attack could be performed to find out a HMAC digit by digit.[9]" There are no such things as timing attacks on HMAC by itself: it might leak the key size but nothing more if the underlying hash function is not vulnerable to timing attacks. The reference probably refers to a timing attack made on the memcmp used to compare the stored mac with the evaluated mac. That would allow the attacker to forge a valid, stored, HMAC digit by digit. See http://beta.ivc.no/wiki/index.php/Xbox_360_Timing_Attack — Preceding unsigned comment added by 93.50.106.102 (talk) 23:00, 17 July 2012 (UTC)

 * what is the correct key 120.28.219.213 (talk) 15:19, 12 June 2023 (UTC)

I have removed mention of the timing attack. as it was unsourced with respected to HMACs. If someone can find a good source for it then it can be put back in 103.38.149.55 (talk) 09:58, 3 April 2017 (UTC)

 * i agree with the removal, but for a different reason: it is about "short circuit" comparison, which does not belong to this topic, because it is a more general concept. Krisztián Pintér (talk) 11:55, 3 April 2017 (UTC)

added example usage for non-mathletes.
I added some text for readers that just want to know how to implement an HMAC without necessarilly understanding the math behind it. I plan to add some example C or python code that displays how a message would be verified.
 * I don't think we'd gain anything from programming language code, to be honest. There isn't a great deal of maths to understand for HMAC. It's just a short sequence of concatenations, XORs and hash function calls, and is readily comprehensible from the definition given in the article. I think it would be redundant to write it again out in C or Python. Compare, say, SHA-1 or MD5, which are complex algorithms which benefit from a pseudo-code treatment. — Matt Crypto 09:31, 5 November 2005 (UTC)
 * Just passing by: the python example really ain't that easy to read, nor is it close to the pseudo-code sample: it uses a smart hack with translation tables to avoid XOR operations, which are quite expensive in Python. --Mistouille (talk) 08:49, 22 July 2013 (UTC)

Blocksize on pseudo code
blockSize: Integer  the block size of the underlying hash function (e.g. 32 bytes for SHA-256)

On SHA-256, the output size is 32 bytes, however the input block size is 64 bytes. In this example, using SHA-256, shouldn't block size be set to 64 instead ? — Preceding unsigned comment added by 164.40.221.237 (talk) 13:39, 12 November 2017 (UTC)

Bug in pseudo code??
Existing Pseudo code

if (length(key) > blocksize) then key = hash(key) // keys longer than blocksize are shortened else if (length(key) < blocksize) then key = key ∥ zeroes(blocksize - length(key)) // keys shorter than blocksize are zero-padded end if

At the end of this if statement key is hashed first branch is taken and not hashed otherwise. Looking at algorithm I suggest the following:

if (length(key) > blocksize) then key = left(key,blocksize) // keys longer than blocksize are shortened else if (length(key) < blocksize) then key = key ∥ zeroes(blocksize - length(key)) // keys shorter than blocksize are zero-padded end if

Tony Wallace (tony@tony.gen.nz) —Preceding unsigned comment added by 131.203.134.23 (talk) 22:36, 19 April 2010 (UTC)

 * Your suggestion is irrelevant. What matters is the standard that defines HMAC. This standard was accurately described before you changed it. Hence, I'm reverting your proposal. 83.78.173.160 (talk) 23:51, 20 April 2010 (UTC)

Advantages over a pure hash
Can someone please explain why using HMAC(hashfunc, k, v) is better than using doing hashfunc(k||v)? It seems like this is a key question. (If you do answer this, I'd appreciate it if you leave a note on my talk page.) AaronSw 15:32, 13 April 2006 (UTC)

 * Read the references in the article. Knowing F(k||v) means you can compute F(k||v||u||...) trivially.  Nesting prevents this  (page 16, at the bottom).  mdf 13:44, 16 May 2006 (UTC)

 * Except that all hash algorithms used with HMAC in practice already defeat this attack by including the original message length in the hashing process (ie. you can't construct H(k||v||u) from H(k||v); you must already know k and v). Was this added just to support theoretical hash functions that don't have this property? The other question that arises is: why are the two keys (k1, k2) derived by XORing the key k with those magic numbers (0x36 and 0x5c)? Are the two keys required to be different (why?) and is there a motivation for using XOR (other than that it's fast) or would some random operation like k1 = k, k2 = (k + 1) mod 2^|k| work just as well?  If you feel qualified to answer these questions, please add them to the article (instead of only replying here). Thanks in advance! 130.89.167.52 21:17, 16 February 2007 (UTC)

 * AIUI, because the message length and padding are known to the attacker, you can "back up" those hash functions to the previous (before finalize) state in order to do the concatenation attack. 121a0012 21:43, 27 February 2007 (UTC)

 * The length being included doesn't help, because an attacker can include the length code in the extension data (u = original_length_code || new_data), which limits the choices for the extension data somewhat, but not enough to make attacks impractical at all. 2001:470:D08D:0:0:0:0:1 (talk) 20:23, 6 July 2013 (UTC)

Typical usage?!
A pizza restaurant that suffers from attackers that place bogus orders is a typical usage of HMAC? Why won't anyone mention SMTP for God's sake? — 212.76.37.162 11:57, 18 March 2006 (UTC)

Right...I'm sure this would be a great business model, for the 0.01% of customers who could be bothered to do such nonsense - as opposed to just calling. — 24.8.120.181 18:41, 21 May 2006 (UTC)

Maybe the example was not explained properly. If you translate it to a normal use case scenario, the customer would be forced to provide a password along with the order on pizza company's webpage, and a applet on the browser would computer the hmac based on the password as the key, before passing it to the server.

Padding
In the described pseudocode implementation of a HMAC, the padding of the key, if it is shorter than the blocksize of the message input of the specific hashfunction, is missing! How do you want to operate a XOR function if you don't have the same amount of bits on each sides? --> If key's size is less than 512 bit long(after ipad) the fingerprint / hash of the key couldn't be the the initial key for the hashfunction (each 512 bit blocksize) of the message appended to the key!

 * The pseudocode is fine. It alters ipad and opad, which have been set up to have the right length, by XORing the bytes of the key into the beginning of ipad and opad, leaving the final bytes (if any) unchanged at their original values. Remember that XORing with zero doesn't do a thing. Hanche (talk) 08:22, 2 January 2009 (UTC)

 * This is the problem with pseudocode... it's fine or not fine depending on how your pseudo xor is defined. If it's defined as padding the short operand with zeros to the length of the long one, then you get a valid HMAC. If it's defined as truncating the long operand to the length of the short one, you get something else. These are 2 reasonable interpretations; there may be more. (In fact, I think "xor on different length strings throws an exception" would be reasonable too.) The pseudocode and the Definition section both require the reader will guess the correct interpretation. 67.162.91.170 (talk) 19:11, 11 February 2017 (UTC)

 * the pseudocode never xors different length data. the only case it could happen if the hash produced more bits than the blocksize. but using such a hash would not make much sense, considering that it is there to shorten the long key. if either the original or the hashed key is shorter than the blocksize, 0's are appended. Krisztián Pintér (talk) 19:22, 11 February 2017 (UTC)

Block Size
The pseudocode could use some help as to the clarity of L from RFC2104, being the output length of the Hash function used. While the code is written correctly it does kind of gloss over the fact that if length(key) > blocksize happens, length(key) < block size can and will also happen after key = hash(key) when using MD5; because B=64 and L=16.199.34.4.20 (talk) 00:46, 2 June 2016 (UTC)
 * it is in the definition of K' in the previous section. i don't think there should be more explanation in the pseudocode section. explanations belong to the definition section. Krisztián Pintér (talk) 08:07, 2 June 2016 (UTC)

 * I was also confused by the definition of K'. But I could not think of a succinct enough way to state the definition. Cowlicks (talk) 21:34, 9 December 2016 (UTC)

Illustration
The illustration is really bad, I think. Utterly confusing. First, it appears to show HMAC(k,m) to be the two inputs rather than the output. Second, it shows the hash function h with two inputs and two outputs, with one of the two outputs feeding back into one of the inputs. You have to read the text to realize that the vertical direction is one application of h and the horizontal direction another. The two applications of h should have been drawn as separate boxes for clarity. Hanche (talk) 08:28, 2 January 2009 (UTC)

Security Section
This section is very poorly written. No mention of an NMAC is given. This seems to be a summary of one paper on the security analysis of HMACs, this requires cleanup.--Chrismiceli (talk) 06:37, 20 July 2009 (UTC)

I have taken the liberty of performing the cleanup myself. Please comment if desired. --Chrismiceli (talk) 05:02, 21 July 2009 (UTC)

There is the problem? If the hash is secure, it is impossible to find too different arguments with the same hash. That means, it is impossible to find to different messages or keys with the same HMAC. If the hash ist a one way function the HMAC is a one way function of message and key. It means HMAC is secure, if the hash is secure. --95.222.228.77 (talk) 21:37, 28 July 2010 (UTC)
 * No. The requirements for a secure hash function and a secure HMAC are different. A secure hash function must be collision resistant. For the HMAC to be secure it is according to the paper by Bellare sufficient if the underlying hash function is a "privacy preserving pseudorandom function". As far as I know neither security requirement implies the other one. In particular, Bellare's paper points out that collision resistant is not a necessary requirement for a secure HMAC and he does not use collision resistance in his security reductions. It is also not a problem if two HMACs ever are the same. Otherwise it would not be possible to truncate HMACs. 85.1.138.140 (talk) 07:27, 29 July 2010 (UTC)

 * If the hash function is collision resistent, the securty is free of doubt. It should be possible to truncate the HMAC to 128 bits or 16 bytes, since it is only required, that for given key and message no second key or message can be found with the same HMAC. Even if the key is known, a second message never can be found by brute force testing a large number of messages with a 128 bit HMAC. --95.222.228.77 (talk) 18:08, 30 July 2010 (UTC)

 * No. This is wrong. The security requirement is that an attacker can neither find the key nor find the correct HMAC for a new message. This requirement does not follow from collision resistance. Because MACs are an important application of hash functions, the SHA-3 submission are also examined for their resistance against so called "key recovery attacks" besides resistance against collision attacks. 83.78.82.132 (talk) 19:34, 30 July 2010 (UTC)
 * In principle you are right, the hash function should not only be collision resistent, but also one way, meaning that there is no way to find the key from the HMAC (besides brute force). In practise collision resistent hash functions are allways believed to be one way. If it is impossible to find the key from the whole HMAC and message that is certainly true, if the HMAC is truncated. If the hash is not collision resistent it might be possible to calculate the HMAC for some special messages. That is probably not possible if the HMAC is truncated. —Preceding unsigned comment added by 95.222.228.77 (talk) 10:38, 2 August 2010 (UTC)
 * I'm sorry, but most of that is wrong.
 * $$h$$ collision resistant and one-way $$\nRightarrow$$ HMAC instantiated with $$h$$ is a secure MAC: Assume $$h':\{0,1\}^*\rightarrow\{0,1\}^n$$ is a random oracle. Let $$h:\{0,1\}^{\geq n}\rightarrow\{0,1\}^{2n}, h(m)=h(m_{1}\cdot m_{2})=m_{1}\cdot h'(m_{2})\ $$  where   $$m=\ m_{1}\cdot m_{2}\ $$ and $$\ |m_{1}|=n$$ i.e. $$m$$ is split into the first block and the rest of the input. The first two blocks are copied to the output in clear, the rest is hashed securely. $$h$$ is certainly collision resistant, but HMAC instantiated with $$h$$ outputs the key in the clear. Also note that $$h$$ is one way for inputs $$m$$ with $$|m|\geq 2n$$. Oh and you can also truncate the HMAC and it will still be insecure.
 * $$h$$ not collision resistant $$\nRightarrow$$ HMAC instantiated with $$h$$ is is insecure: For example MD5 is still acceptable for use with HMAC. As a more formal counterexample consider $$h\left(m\right)=h\left(m_{1}\cdot m_{2}\right)=\begin{cases}

0^{n} & \; m_{1}=0^{\frac{n}{2}}\\ h'\left(m\right) & \;\text{otherwise} \end{cases}$$
 * The property you really need is pseudo randomness of $$h$$, i.e. you cannot distinguish the output of $$r: m\mapsto h(k||m) $$ from a completely random function without the key $$k$$. --Eta Aquariids (talk) 06:19, 9 August 2012 (UTC)

One possiblity would be to choose randomly 80 of the 160 bits from SHA-1 HMAC. I guess this is very secure. --95.222.228.77 (talk) 10:48, 2 August 2010 (UTC)
 * MACs have to be deterministic to be of any use. Choosing the bits at random kind of defeats it's purpose. Also, as SHA1 tries to be a pseudorandom function itself, any 80 bits are as good as any other, as long as there is no serious attack on SHA1 found. --Eta Aquariids (talk) 11:42, 8 August 2012 (UTC)

Problems displaying Unicode characters
Let me show you what your italicized unicode characters look like on my computer:

In Firefox

In IE

--66.168.1.178 (talk) 18:56, 2 December 2009 (UTC)

 * What this person is complaining about appears to be the characters ∥ (U+2225 PARALLEL TO) and ⊕ (U+2295 CIRCLED PLUS) used in the article (though not in italics). They show up fine in firefox, but become boxes in IE. (Oddly, in the fonts his and my firefox are using, U+2225 shows up as two slanted parallel lines, hence the “italics” misunderstanding, I think. In the Unicode code charts, the lines are vertical.) Maybe one should use standard mathematical formating instead? (I lightly edited the anonymous user's entry, improving the headline for clarity.) Hanche (talk) 00:06, 3 December 2009 (UTC)

order of XOR in pseudo code
The definition and the pseudo code don't use the same order in the XOR operation.

In the definition: HMAC(K,m) = H((K ⊕ opad) ∥ H((K ⊕ ipad) ∥ m))

In the pseudo code: o_key_pad = [0x5c * blocksize] ⊕ key i_key_pad = [0x36 * blocksize] ⊕ key

My guess is that the latter is wrong and should be instead: o_key_pad = key ⊕ [0x5c * blocksize] i_key_pad = key ⊕ [0x36 * blocksize]

 * The order is irrelevant since XOR is commutative. But possibly, it might be worth changing the order for notational concistency. Hanche (talk) 19:37, 30 September 2010 (UTC)

Copy
The Intro seems entirely copied from this source: http://everything.explained.at/HMAC/ — Preceding unsigned comment added by 118.208.214.179 (talk) 21:51, 6 November 2011 (UTC)
 * Nope, 'everything explained' looks like a wikipedia clone to me. 81.62.78.223 (talk) 08:20, 7 November 2011 (UTC)

Can any one provide full Psuedocode for HMAC? 119.154.6.10 (talk) 12:45, 25 April 2012 (UTC)

I've just removed a comment by 192.153.142.154 from the bottom of the intro section that read: [Great introduction of HMAC, largely plagiarized from "CCNA Security," Cisco Press (Michael Watkins & Kevin Wallace, 2008) pages 470-471]. I haven't got a copy of that book, but if the comment's right the intro needs to be changed to avoid copyright infringement. If it qualifies under fair use, the book needs to be in the references. Wocky (talk) 10:22, 16 May 2015 (UTC)

Image
The file associated with the article (File:Shahmac.jpg) uses "N byte" where it should use "N bits". JPGoldberg (talk) 15:06, 8 June 2012 (UTC)

ipad and opad not important?
In the article, it says "The values of ipad and opad are not critical to the security of the algorithm". Is it safe to leave them out entirely? What is the significance of ensuring the inner and outer keys have few bits in common? Fresheneesz (talk) 18:38, 8 August 2012 (UTC)

The underlying idea of the HMAC security reduction requires the use of two different inner and outer keys. This is replaced with $$k\oplus OPAD$$ and $$k\oplus IPAD$$ with the argument that the first iteration of $$h$$ ($$h$$ is assumed to hash the data iteratively in a Merkle–Damgård construction) will act as a pseudo random function and generate two - for practical purposes independent - keys. This works as long as the two inputs to the first iteration of the hash function are different and that will be the case as long as IPAD and OPAD differ in at least one bit. Thus, although it is probably still secure to leave them out entirely, it is a bad idea as you have no formal argument why it is still secure. --Eta Aquariids (talk) 06:40, 9 August 2012 (UTC)

"Hashed" redirect
Are there any objections to the creation of a redirect from Hashed message authentication code to this article? I believe it is a "sufficiently confusable" title since, for example, RFC 4635 expands the abbreviation that way. SoledadKabocha (talk) 00:50, 26 September 2012 (UTC)

Replace Image
Someone registered may replace the image by this reworked png-version done by me. http://www.imgbox.de/users/public/images/ZIehXcr0yA.png — Preceding unsigned comment added by 193.175.119.11 (talk) 10:59, 11 January 2013 (UTC)

External links modified
Hello fellow Wikipedians,

I have just added archive links to 2 one external links on Hash-based message authentication code. Please take a moment to review my edit. If necessary, add after the link to keep me from modifying it. Alternatively, you can add to keep me off the page altogether. I made the following changes:
 * Added archive https://web.archive.org/20100604234324/http://citeseerx.ist.psu.edu:80/viewdoc/summary?doi=10.1.1.34.3855 to http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.3855
 * Added archive https://web.archive.org/20090223134840/http://citeseerx.ist.psu.edu:80/viewdoc/summary?doi=10.1.1.42.8908 to http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.8908

When you have finished reviewing my changes, please set the checked parameter below to true to let others know.

Cheers. —cyberbot II  Talk to my owner :Online 00:30, 16 October 2015 (UTC)

Pseudo code does not match functionality of definition
In the definition section, the following three elements are concatenated: K' ⊕ opad H( K' ⊕ ipad ) message

However in the pseudocode the following two elements are concatenated: K' ⊕ opad H( K' ⊕ ipad, message )

Is the problem in the Documentation or in the Pseudocode?

Dotancohen (talk) 16:26, 5 November 2016 (UTC)

 * i think you lost track of parens. the definition is not what you describe here, and is identical to the pseudocode.Krisztián Pintér (talk) 23:52, 5 November 2016 (UTC)

Please add check algorithm for clients receiving the message and HMAC
I understand that clients will have the public key associated to the private key used for signing prior to receiving the message and HMAC. The validation must then check that the HMAC match some sort of operation using the message and the public key as input. What's the exact algorithm? — Preceding unsigned comment added by 13.94.145.70 (talk) 08:31, 17 August 2017 (UTC)

 * don't confuse hash based signatures with hash based MACs. this is not a public key algorithm, there is no public key here. the private key is shared by the two parties. Krisztián Pintér (talk) 09:25, 17 August 2017 (UTC)

Sha-1 is mentioned a lot, is it safe?
I'm no security expert, but I remember the shappening and was under the impression that sha-1 is no longer strong enough for Internet encryption. If this is the case, shouldn't this article use ex. sha-256 in its examples and references? — Preceding unsigned comment added by Finnjohnsen (talk • contribs) 09:24, 15 February 2018 (UTC)

Kitar aplicasion
Kitar la aplicasion 2806:103E:23:5AC0:E027:CF36:D618:4286 (talk) 06:45, 29 January 2023 (UTC)

 * @ 177.239.39.199 (talk) 08:07, 26 April 2023 (UTC)

Possible Typo
Possible typo in the section that says "For example, SHA-256 operates on 512-bit blocks. The size of the output of HMAC is the same as that of the underlying hash function (e.g., 256 and 512 bits in the case of SHA-256 and SHA3-512, respectively), although it can be truncated if desired." I think SHA-256 operates on 256-bit blocks, not 512, as the paragraph itself later implies. Metacosm (talk) 10:41, 21 March 2023 (UTC)

 * No, 512 bits is the correct block size for SHA-256. Yawkat (talk) 19:35, 28 March 2023 (UTC)

Quantum computing risks
A discussion as to the safety of HMAC encrypted data relative to future quantum computer attacks is needed.

 * HMAC security reduces to the security of the underlying hash function. If that hash function is vulnerable to quantum computer attacks, HMAC may be too. However most hash functions used in practice (such as the SHA family) are not particularly vulnerable. Yawkat (talk) 11:13, 7 September 2023 (UTC)

 * Thanks. Countercheck (talk) 18:49, 5 December 2023 (UTC)
 * Hlow 143.44.164.13 (talk) 00:17, 17 December 2023 (UTC)

title: Talk:HMAC


text:
Talk:RC5

Time to crack 72-bit key
"At the current rate, it will take approximately 120 years to test every possible remaining key, and thus guarantee completion of the project.[4]"

I checked their home page and it says "This also means that we'll hit 100% in 87,428 days at yesterday's rate." As 87,424 days = 240years I think the Wikipedia article is wrong. It should take approximately 120 years before the cipher is broken (because you will statistically only have to test 50% of the keys) or 240 years to check test every possible remaining key, right? /Inuit77

http://stats.distributed.net/projects.php?project_id=8 — Preceding unsigned comment added by Inuit77 (talk • contribs) 13:59, 30 January 2014 (UTC)

I changed it. It's correct already in https://en.wikipedia.org/wiki/Password_strength Bit strength threshold /Inuit77 — Preceding unsigned comment added by Inuit77 (talk • contribs) 15:02, 30 January 2014 (UTC)

 * Or maybe just fewer people are running distributed.net these days? -- intgr [talk] 02:14, 31 January 2014 (UTC)

title: Talk:RC5


text:
User:Atsi Otani

I'm Atsi Otani. I'm a Japanese/English translator that lives in Sendai, Japan. I'm also an amateur musician. I mainly play keyboards and electric bass, but I can pick up the guitar or bang on drums to a certain extent.

Resources

 * Japanese Wikipedians' Notice Board

Sendai
To do list for Sendai
 * Create "see also..." pages when necessary
 * Expand domestic sister cities
 * Create symbols
 * Put politics, wards, /symbols, and the two sister city sections under something like "politics and symbols"
 * Put geography and climate under something like "geography and climate"
 * Expand Education
 * Create performing arts under culture
 * Need images for wards, symbols, climate (temperature/precipitation?), demographics (population graph?). Need a lot of nice pictures.
 * Could do something about the city's expansion history. Maybe a good diagram?

ToDo

 * Fodera - well, if it survives the Vfd vote. Consider creating an Anthony Jackson page.
 * Survived Vfd vote. Need to research.

 * Matsudaira Katamori and Katamori Matsudaira. Quite a mess right now.  Might want to work on the Boshin War and the Aizu War if I'm going to do this.
 * Merged both articles into Matsudaira Katamori. Currently searching for good references.

 * Date Masamune - the last time I looked at the article, it was absolutely horrible.
 * Got reference. Now reading.

 * Check municipalities in Miyagi. There's not much I can do to expand the articles, but checking can't hurt.
 * A lot are not titled "name_of_city, Miyagi" but "name_of_city". Should I create a lot of redirects?
 * They're all City/Town, Miyagi now. Someone changed 'em...-William McDuff 13:18, 21 September 2005 (UTC)

 * Figure out the proper licensing for the maps in the Japanese municipality pages. The ja.wikipedia's village pump indicates that the Japanese wikipedians actually are confused themselves.  Could take some time.

Drafts

 * /Date Masamune
 * /Matsudaira Katamori

Articles that can be improved
Just notes to self
 * Pachinko - I rarely play pachinko, but I still notice some glaring errors in the article. The writers probably don't know hanemono or kenrimono, and probably have very limited knowledge of pachisuro.  The article focuses on degipachi, the most popular form, but that isn't all there is.
 * Bullfighting - Could use a description of bullfighting in Japan.
 * Battle of Nagashino - Information is obsolete. As a result of modern research, the Takeda army is no longer considered to have posessed a killer calvary.  Even worse, Nobunaga's volley fire has been essentially proved to be nothing but a legend.

Archives

 * /Matsudaira Katamori (archive)

title: User:Atsi Otani


text:
Ian Thornley

Ian Thornley (born July 21, 1972) is a Canadian rock guitarist, vocalist, and songwriter. He is best known for his work with the bands Big Wreck and Thornley.

Career
Born and raised in Toronto, Ontario, Thornley studied jazz music at Boston's Berklee College of Music in the 1990s and formed the band Big Wreck in 1993 with classmates David Henning, Brian Doherty, and Forrest Williams. They soon relocated from Boston to Toronto and eventually signed a US record deal with Atlantic Records. Their 1997 debut album, In Loving Memory Of..., was a significant hit that year on rock radio in both Canada and the US. Big Wreck released a follow-up in 2001, called The Pleasure and the Greed, and broke up in 2002.

The same year, Thornley auditioned with Velvet Revolver for the position of lead singer. He later stated that he did not feel comfortable singing without playing guitar. The band eventually chose Scott Weiland as their vocalist.

Later in 2002, Thornley formed a new band, simply titled Thornley, which released their first album, Come Again, in 2004. Their follow-up record, Tiny Pictures, was published in Canada on February 10, 2009, via 604 Records. It was produced and mixed by Nick Raskulinecz.

Ian Thornley left 604 Records in 2011 and signed with Anthem Records. During this time, he reunited with his former Big Wreck bandmate Brian Doherty to resurrect the group. They began work on a new album, entitled Albatross, which was released on March 6, 2012. The group toured Canada from April to July.

Big Wreck released their fourth studio album, Ghosts, in Canada on June 10, 2014, and in the US on July 15. It debuted at No. 5 on the Canadian Albums Chart, selling 4,000 copies in its first week.

In 2015, Thornley published the album Secrets under the name Ian Fletcher Thornley.

Big Wreck has since released the albums Grace Street (2017), ...But for the Sun (2019), 7 (2023), and Pages (2023).

title: Ian Thornley


text: Category:Sarah Harmer albums

title: Category:Sarah Harmer albums


text:
User:NotQuiteAllThere

My name is Tyler, I'm a relatively new member at Wikipedia, and plan to edit this further at a later date.

title: User:NotQuiteAllThere


text:
Steven Levitt

Steven David Levitt (born May 29, 1967) is an American economist and co-author of the best-selling book Freakonomics and its sequels (along with Stephen J. Dubner). Levitt was the winner of the 2003 John Bates Clark Medal for his work in the field of crime, and is currently the William B. Ogden Distinguished Service Professor of Economics at the University of Chicago as well as the Faculty Director and Co-Founder of the Center for Radical Innovation for Social Change at the University of Chicago which incubates the Data Science for Everyone coalition. He was co-editor of the Journal of Political Economy published by the University of Chicago Press until December 2007. In 2009, Levitt co-founded TGG Group, a business and philanthropy consulting company. He was chosen as one of Time magazine's "100 People Who Shape Our World" in 2006. A 2011 survey of economics professors named Levitt their fourth favorite living economist under the age of 60, after Paul Krugman, Greg Mankiw and Daron Acemoglu.

Career
Levitt attended St. Paul Academy and Summit School in St. Paul, Minnesota. He graduated from Harvard University in 1989 with his BA in economics summa cum laude, writing his senior thesis on rational bubbles in horse breeding, and then worked as a consultant at Corporate Decisions, Inc. (CDI) in Boston advising Fortune 500 companies. He received his PhD in economics from MIT in 1994. He is currently the William B. Ogden Distinguished Service Professor and the director of Gary Becker Milton Friedman Institute for Research in Economics at the University of Chicago. In 2003 he won the John Bates Clark Medal, awarded every two years by the American Economic Association to the most promising U.S. economist under the age of 40. In April 2005 Levitt published his first book, Freakonomics (coauthored with Stephen J. Dubner), which became a New York Times bestseller. Levitt and Dubner also started a blog devoted to Freakonomics.

Work
Levitt has published over 60 academic publications, studying topics including crime, politics and sports, through the framework of economics. For example, his An Economic Analysis of a Drug-Selling Gang's Finances (2000) analyzes a hand-written "accounting" of a criminal gang, and draws conclusions about the income distribution among gang members. His most well-known and controversial paper (The Impact of Legalized Abortion on Crime (2001), co-authored with John Donohue) posits that the legalization of abortion in the US in 1973 was a major causal factor in the considerable reduction in crime that followed approximately eighteen years later.

The impact of legalized abortion on crime
Revisiting a question first studied empirically in the 1960s, Donohue and Levitt argued that the legalization of abortion could account for almost half of the reduction in crime witnessed in the 1990s. Their 2001 paper sparked much controversy, to which Levitt has said "'. . . John Donohue and I estimate maybe that there are 5,000 or 10,000 fewer homicides because of it. But if you think that a fetus is like a person, then that's a horrible tradeoff. So ultimately I think our study is interesting because it helps us understand why crime has gone down. But in terms of policy towards abortion, you're really misguided if you use our study to base your opinion about what the right policy is towards abortion'"

In 2003, Theodore Joyce argued that legalized abortion had little impact on crime, contradicting Donohue and Levitt's results. In 2004, the authors published a response, in which they claimed Joyce's argument was flawed due to omitted-variable bias.

In November 2005, Federal Reserve Bank of Boston economist Christopher Foote and his research assistant Christopher Goetz, published a paper, in which they argued that the results in Donohue and Levitt's paper were due to statistical errors made by the authors. When the corrections were made, Foote and Goetz argued that abortion actually increased violent crime instead of decreasing it.

In January 2006, Donohue and Levitt published a response, in which they admitted the errors in their original paper, but also pointed out that Foote and Goetz's correction was flawed due to heavy attenuation bias. The authors argued that, after making necessary changes to fix the original errors, the corrected link between abortion and crime was now weaker but still statistically significant.

In 2019, Levitt and Donohue published a new paper to review the predictions of the original 2001 paper. The authors concluded that the original predictions held up with strong effects. "We estimate that crime fell roughly 20% between 1997 and 2014 due to legalized abortion. The cumulative impact of legalized abortion on crime is roughly 45%, accounting for a very substantial portion of the roughly 50-55% overall decline from the peak of crime in the early 1990s."

Academic publications (in chronological order)

 * "Four essays in positive political economy" PhD Thesis, DSpace@MIT. Massachusetts Institute of Technology, Dept. of Economics, 1994.
 * "Using Repeat Challengers to Estimate the Effect of Campaign Spending on Election Outcomes in the U.S. House." Journal of Political Economy, 1994, 102(4), pp. 777–98.
 * "How Do Senators Vote? Disentangling the Role of Voter Preferences, Party Affiliation, and Senator Ideology." American Economic Review, 1996, 86(3), pp. 425–41.
 * "The Effect of Prison Population Size on Crime Rates: Evidence from Prison Overcrowding Litigation." Quarterly Journal of Economics, 1996, 111(2), pp. 319–51.
 * "The Impact of Federal Spending on House Election Outcomes." Journal of Political Economy, 1997, 105(1), pp. 30–53. (with Snyder, James M. Jr.).
 * "Using Electoral Cycles in Police Hiring to Estimate the Effect of Police on Crime." American Economic Review, 1997, 87(3), pp. 270–90.
 * "Measuring Positive Externalities from Unobservable Victim Precaution: An Empirical Analysis of Lojack." Quarterly Journal of Economics, 1998, 113(1), pp. 43–77 (with Ayres, Ian).
 * "An Economic Analysis of a Drug-Selling Gang's Finances." Quarterly Journal of Economics, 2000, 115(3), pp. 755–89. (with Venkatesh, Sudhir A.).
 * "The Impact of Legalized Abortion on Crime." Quarterly Journal of Economics, 2001, 116(2), pp. 379–420. (with Donohue, John J., III).
 * "How Dangerous Are Drinking Drivers?" Journal of Political Economy, 2001, 109(6), pp. 1198–237. (with Porter, Jack).
 * "Testing Mixed-Strategy Equilibria When Players Are Heterogeneous: The Case of Penalty Kicks in Soccer." American Economic Review, 2002, 92, pp. 1138–51 (With Chiappori, Pierre-Andre and Groseclose, Timothy).
 * "Winning Isn't Everything: Corruption in Sumo Wrestling." American Economic Review, 2002, 92(5), pp. 1594–605. (with Duggan, Mark).
 * "Using Electoral Cycles in Police Hiring to Estimate the Effects of Police on Crime: Reply." American Economic Review, 2002, 92(4), pp. 1244–50.
 * "Rotten Apples: An Investigation of the Prevalence and Predictors of Teacher Cheating" Quarterly Journal of Economics, 2003, 118(3), pp. 843–77. (with Jacob, Brian A.).
 * "The Causes and Consequences of Distinctively Black Names." Quarterly Journal of Economics, 2004, 119(3), pp. 767–805. (with Fryer, Roland G. Jr.)
 * "The Causes and Consequences of Distinctively Black Names." Quarterly Journal of Economics, 2004, 119(3), pp. 767–805. (with Fryer, Roland G. Jr.)

Other publications (in chronological order)

 * Freakonomics: A Rogue Economist Explores the Hidden Side of Everything, co-author with Stephen Dubner,  (2005) (ISBN 0-061-23400-1)
 * SuperFreakonomics: Global Cooling, Patriotic Prostitutes, and Why Suicide Bombers Should Buy Life Insurance, co-author with Stephen Dubner (2009) (ISBN 0-060-88957-8)
 * Think Like a Freak: The Authors of Freakonomics Offer to Retrain Your Brain, co-author with Stephen Dubner (2014) (ISBN 0-062-21833-6)
 * When to Rob a Bank: ...And 131 More Warped Suggestions and Well-Intended Rants, co-author with Stephen Dubner (2015) (ISBN 0-062-38532-1)

Press

 * Stephen Dubner (2003), New York Times Magazine, The Economist of Odd Questions: Inside the Astonishingly Curious Mind of Steven D. Levitt
 * Profile of Steven Levitt in the Financial Times, 23 April 2005
 * 20 Questions with Levitt in CEO Magazine

title: Steven Levitt


text:
Wikipedia talk:Today's featured article/December 16, 2004

Aaaaarrrgh. It is frustrating to see a poorly written blurb about a featured article.

Consider the following:

1. "... produced by the BBC and concerning the adventures..." Poor syntax. The article itself reads "... that concerns..." --Better as it has no syntatical problems. One might also simply use "about."

2. Then there's this sentence: "The programme was and remains a significant part of British popular culture, widely recognised for its creative storytelling, use of innovative music which was produced by the BBC Radiophonic Workshop, and budget special effects.
 * ""The programme was and remains..." Wordy.  Surely "is" would do.
 * This is a run-on sentence with weak structure that makes it hard to understand. Example:  "... innovative music which was produced... and budget special effects."  What does this mean?

O.k, that's off my chest. Don't get me wrong, I love the home page and the featured article. Most of the time it's very well-written. But sometimes... So what do we do? The only avenue I could find was this. Sunray 07:56, 2004 Dec 16 (UTC)


text:
Talk:GRASS GIS

GRASS (which I am about to make a redirect to here) is in Category:Software. I don't think specific software belongs in that category. Apart from that, everything in that article is also in this article. Brianjd 07:58, 2004 Dec 16 (UTC)

I'm writing a GRASS GIS tutorial aimed at Wikipedia users at user:silsor/GRASS. silsor 04:46, 24 December 2005 (UTC)

 * Which Standards are supported by GRASS?
 * See manual, in details:
 * * Raster - GRASS uses the GDAL library, so: http://www.gdal.org/formats_list.html + VTK + GMT + Paraview
 * * Vektor: GRASS uses the OGR library, so: http://www.gdal.org/ogr/ogr_formats.html + VTK + DXF + Paraview
 * * Web Services: Web Map Service, Web Feature Service

External links modified
Hello fellow Wikipedians,

I have just modified 3 external links on GRASS GIS. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20140502032219/http://geni.isnew.info/grass/Jim-Westervelt.pdf to http://geni.isnew.info/grass/Jim-Westervelt.pdf
 * Added archive https://web.archive.org/web/20070327090216/http://freegis.gnu.org.in/grass_geosciencedataset.pdf to http://freegis.gnu.org.in/grass_geosciencedataset.pdf
 * Added archive https://web.archive.org/web/20050126063320/http://grass.ibiblio.org/ to http://grass.ibiblio.org/

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 18:11, 9 October 2017 (UTC)

title: Talk:GRASS GIS