
	Where results make sense

Topic: Auguste Kerckhoffs

Related Topics

List of cryptographers

John Joseph Rochefort

Claude Elwood Shannon

Asakiyumemishi

Anchorage Municipality, Alaska

Toni Collette

Kazaa Lite

Alexei Yashin

Dating game show

California Proposition 13 (1978)

United States casualties of war

Joan Rivers

Scarborough RT

Nuclear chemistry

Aegisthus

In the News (Thu 31 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Auguste Kerckhoffs - Wikipedia, the free encyclopedia
		Dr Auguste Kerckhoffs (19 January 1835 - 1903) was a Flemish linguist and cryptographer who was professor of languages at the School of Higher Commercial Studies in Paris in the late 19th century.
		Kerckhoffs was born in Nuth, the Netherlands, and was baptised as Jean-Guillaume-Hubert-Victor-François-Alexandre-Auguste Kerckhoffs von Niuewenhof, although he later shortened his name.
		In 1885, Dr. Kerckhoffs became interested in the constructed language Volapük, and for several years was a leading member of the Volapük movement, and Director of the Academy of Volapük.
	en.wikipedia.org /wiki/Auguste_Kerckhoffs (362 words)

	Reference.com/Encyclopedia/Auguste Kerckhoffs
		Kerckhoffs was born in Nuth, Holland, and was baptised as Jean-Guillaume-Hubert-Victor-Françoise-Alexandere-Auguste-Kerckhoffs von Niuewenhof, although he later shortened his name.
		Of all his work, the most well-known is the second of his six principles, also known as Kerckhoffs' law: "the security of a cryptosystem must depend only on the key", and not on the secrecy of any other part of the system.
		Kerckhoffs' law is, in essence, the position that cryptography should be secure even against an opponent who has done such things, or alternatively, that security by obscurity is insufficient in cryptography.
	www.reference.com /browse/wiki/Auguste_Kerckhoffs (407 words)

	Kerckhoffs' law - Wikipedia, the free encyclopedia
		In cryptography, Kerckhoffs' law (also called Kerckhoffs' assumption, axiom or principle) was stated by Auguste Kerckhoffs in the 19th century: a cryptosystem should be secure even if everything about the system, except the key, is public knowledge.
		The law was one of six design principles laid down by Kerckhoffs for military ciphers.
		Finally, it is necessary, given the circumstances that command its application, that the system be easy to use, requiring neither mental strain nor the knowledge of a long series of rules to observe.
	en.wikipedia.org /wiki/Kerckhoffs'_principle (573 words)

	Re: Columbia crypto box
		Kerckhoffs' Principle doesn't speak to actual publication of the algorithms and protocols, just the requirement to make security independent of their secrecy.
		Kerckhoffs' Principle says that there should be no security determent from publication; the modern cryptographic community demonstrates again and again that there is enormous benefit to publication.
		Kerckhoffs' original concern was that cryptosystems designed under the `security by obscurity' assumption, namely assuming that the adversary would not know their designs, might be easily exposed once the design is revealed.
	www.mail-archive.com /cryptography@wasabisystems.com/msg03540.html (466 words)

	[No title] (Site not responding. Last check: 2007-10-20)
		In the wake of France's defeat in the Franco-Prussian War, Kerckhoffs and other military thinkers realized that the need for secure communications was no longer restricted to top military commanders: the communications between generals and officers, and between officers and field units, needed protection as well.
		Kerckhoffs was the first to publicly identify the weakness of security by obscurity.
		Kerckhoffs was concerned about the "stress of mind" (_tension d'esprit_ in the original French) that complexity creates for crypto users in the field.
	www.securius.com /archive/401.txt (1247 words)

	Auguste Kerckhoffs - Wikipedia, the free encyclopedia (Site not responding. Last check: 2007-10-20)
		Auguste Kerckhoffs (1835 - 1903) was a Flemish linguist and cryptographer who was professor of languages at the School of Higher Commercial Studies in Paris in the late 19th century.
		Of all his work, the most well-known is the second of his six principles: the principle that the security of a cryptosystem must depend only on the key and not on the secrecy of any other part of the system.
		Kerchoffs' law is the argument that cryptography should be secure even against an opponent who has done such things, or alternatively, that security by obscurity is insufficient in cryptography.
	www.peacelink.de /keyword/Auguste_Kerckhoffs.php (338 words)

	[No title] (Site not responding. Last check: 2007-10-20)
		Kerckhoffs argues strongly against the notion of a field cipher that would simply resist solution long enough for the orders to be carried out.
		This is not enough, he said, declaring that "the secret matter in communications sent over a distance very often retains its importance beyond the day on which it was transmitted." Perhaps the most startling requirement, at first glance, was the second.
		Kerckhoffs explained that by "system" he meant "the material part of the system; tableaux, code books, or whatever mechanical apparatus may be necessary," and not "the key proper." Kerckhoffs here makes for the first time the distinction, now basic to cryptology, between the general system and the specific key.
	www.nku.edu /~christensen/032hnr304Kerckhofftwocolumn.doc (703 words)

	Financial Cryptography: Kerckhoffs' 6 principles from 1883
		Auguste Kerckhoffs, a Dutch cryptographer who taught in France in the latter part of the 19th century, wrote an influential article that expounded basic principles of a communications security system [1].
		Steve Bellovin summarised this on 9th September 2004, which might be in the cryptography archives by tomorrow.
		What most cryptographers seems to miss in Kerckhoffs' desidirata is that he requires it to be simple enough to be actually used (no 6).
	www.financialcryptography.com /mt/archives/000195.html (460 words)

	The Ideal Cipher (Site not responding. Last check: 2007-10-20)
		In 1883, the most famous work by Auguste Kerckhoffs, after whom the cryptanalytic technique of superimposing multiple messages enciphered with the same running key is named, was published: La Cryptographie Militare (Military Cryptography).
		Thus, I claim that all six of Kerckhoffs' desiderata, not just those whose relevance is most often acknowledged at the present time, still retain at least some degree of importance, when correctly understood.
		But it is true that the ones regarded as obsolete have retained less of their importance as stated, although the reasons behind them remain valid in a different form.
	www.quadibloc.com /crypto/mi0611.htm (1140 words)

	Nemesys Computer Consultants Ltd: Glossary of Computer Security Terms (Site not responding. Last check: 2007-10-20)
		Kerckhoffs' Principle: The most important of six principles of cryptography developed by the Flemish cryptographer Auguste Kerckhoffs in 1883.
		Kerckhoffs' principle states that the security of a cipher must lie in the choice of key and that it must be assumed an attacker is aware of the encryption algorithm.
		Kerckhoffs' Principles: Six principles of cryptography developed by the Flemish cryptographer Auguste Kerckhoffs in 1883.
	www.nemesys.com /Content/Core/Glossary.php (9128 words)

	Kerckhoffs' law - TheBestLinks.com - Cryptography, Cipher, Claude E. Shannon, Eric Raymond, ... (Site not responding. Last check: 2007-10-20)
		Kerckhoffs' law - TheBestLinks.com - Cryptography, Cipher, Claude E. Shannon, Eric Raymond,...
		Kerckhoffs' law, Cryptography, Cipher, Claude E. Shannon, Eric Raymond, French...
		In cryptography, Kerckhoffs' law (also called Kerckhoffs' assumption or Kerckhoffs' principle) was stated by Auguste Kerckhoffs in the 19th century: a cryptosystem should be secure even if everything about the system, except the key, is public knowledge.
	www.thebestlinks.com /Kerckhoffs__27___law.html (607 words)

	[No title]
		A corollary of Kerckhoffs' Principle is that the fewer secrets a system has, the more secure it is. If the loss of any one secret causes the system to break, then the system with fewer secrets is necessarily more secure.
		But there's no obvious way to apply Kerckhoffs' Principle to airline security: there are just too many secrets and there's no way to compress them into a single "key." This doesn't mean that it's impossible to secure an airline, only that it is more difficult.
		Kerckhoffs' Principle generalizes to the following design guideline: minimize the number of secrets in your security system.
	www.systemics.com /legal/digigold/discovery/extras/20020515_schneier.txt (1297 words)

	Auguste Kerckhoffs (Site not responding. Last check: 2007-10-20)
		Dr Auguste Kerckhoffs (19 January 1835 - 1903) was a Flemish linguist and cryptographer who was professor of languages at the School of Commercial Studies in Paris in the late 19th century.
		In 1885 Dr. Kerckhoffs became interested in the constructed language Volapük and for several years was leading member of the Volapük movement and of the Academy of Volapük.
		Scott August has created a soundscape that allows the mind to travel to it's own sacred places...be they on the rim of a...
	www.freeglossary.com /Auguste_Kerckhoffs (779 words)

	Business Software Review : Article 'Auguste Kerckhoffs' (Site not responding. Last check: 2007-10-20)
		Auguste Kerckhoffs, whose design principles have become axioms.
		Beer-Lambert law - in optics, the empirical relationship of the absorption of light to the properties of the material the light is travelling through.
		Kepler's laws of planetary motion - govern the motion of the planets around the sun, and were first discovered by Johannes Kepler Kerckhoffs' law on secure cryptography by Auguste Kerckhoffs Keynes' law -- attributed to economist John Maynard Keynes and contrasted to Say's law (see below).
	www.business-software-review.org /DisplayArticle212065.html (4072 words)

	LASEC: Seminars (Site not responding. Last check: 2007-10-20)
		From an epistemological perspective, one can say that Diffie and Hellman have drawn the most extreme consequence of a the second principle stated by Auguste Kerckhoffs in the XIXth century: "le mécanisme de chiffrement doit pouvoir tomber sans inconvénient aux mains de l'ennemi".
		Very quickly, it was understood that the naive textbook RSA algorithm could not be used as it stands: in particular, it has algebraic multiplicative properties which are highly undesirable from a security perspective.
		From an epistemological perspective, it is a strengthening of Kerckhoffs' first principle: "Le système doit être matériellement, sinon mathématiquement, indéchiffrable".
	lasecwww.epfl.ch /php_code/seminars/display_details.php?id=33 (200 words)

	Alternate History Discussion Board - View Single Post - Menad Bal, PÃ¼k Bal!
		Kerckhoffs was the author of a popular VolapÃ¼k grammar (as well as a study of monumental art and a history of military cryptography, among other works).
		Kerckhoffs proposed reducing the number of noun cases and verb tenses, which would have simplified things considerably.
		He demanded the right to veto the academy's decisions; Kerckhoffs refused, and they fought for control of the language until Kerckhoffs resigned from the academy in 1891.
	www.alternatehistory.com /discussion/showpost.php?p=70932&postcount=1 (1297 words)

	Insecurity through obscurity
		However, Auguste Kerckhoffs, a 19th century Flemish cryptographer, said it should be assumed that attackers know the design of the entire security system, except for the keys.
		This concept, known as Kerckhoffs' law, basically rejected the notion of security through obscurity (your key hidden under your potted plant) and suggested that a system should be secure even if everything's public knowledge, except the key.
		Companies and software developers need to start with Kerckhoffs' law, assume that the algorithm and design of the software are known, and design security into the products and software in the beginning instead of retrofitting or patching security holes later.
	www.alfasoftlist.com /article266.html (786 words)

	Security Through Usability (Site not responding. Last check: 2007-10-20)
		In 1883, Flemish linguist Auguste Kerckhoffs published a groundbreaking article on military cryptography that is still widely cited for its admonishments against what is now known as "security by obscurity".
		In his seminal publication, "La cryptographie militaire", Kerckhoffs actually presents five other laws as well.[5] In general, these have received a lot less attention.
		Here are all six of Kerckhoffs' Laws (thanks to Fabien A. Petitcolas for the translation)[6]:
	www.securius.com /newsletters/Security_Through_Usability.html (1158 words)

	Roaming charges: MObile Software Tamper detection (Site not responding. Last check: 2007-10-20)
		Let me remind you (as Bruce Schneier's Crypto-Gram reminded me) of one of the basic crypto principles, and that is to use published, public algorithms and protocols.
		Auguste Kerckhoffs first stated this principle in 1883.
		Kerckhoffs states that in a well-designed cryptographic system, only the key needs to be secret; there should be no secrecy in the algorithm.
	www-128.ibm.com /developerworks/library/wi-roam2 (2206 words)

	[No title]
		Because Kerckhoffs said, "it is not necessary to conjure up imaginary phantoms and to suspect the incorruptibility of employees or subalterns to understand that, if a system requiring secrecy were in the hands of too large a number of individuals, it could be compromised at each engagement....
		In its modern formulation, the Kerckhoffs doctrine states that secrecy must reside solely in the keys."(1) A more modern expression of this sentiment is provided by Dorothy Denning: The security of a cryptosystem should depend only on the secrecy of the keys and not on the secrecy of the algorithms....
		This requirement implies the algorithms must be inherently strong; that is, it should not be possible to break a cipher simply by knowing the method of encipherment.
	ftp.sunet.se /pub/security/docs/NRC-report/nrc05.txt (17060 words)

	village voice > arts > Pük, Memory by Paul LaFarge
		In this giddy spirit the delegates—speaking to one another entirely in Volapük, remember—voted to establish an International Academy to govern the language's future.
		He believed that Volapük was too complicated—not unreasonably, given that, by combining prefixes and suffixes, you could make as many as 504,440 forms from a single verb.
		Schleyer, meanwhile, had decided that no one but him should have any say in Volapük at all; he formed his own academy, composed entirely of people who agreed with him.
	www.villagevoice.com /print/issues/0031/lafarge.php (2339 words)

	Codes, Ciphers, & Codebreaking (Site not responding. Last check: 2007-10-20)
		This is a simple cipher algorithm, but even if a codebreaker knows that this general scheme was used, the message still cannot be read without the key, and a brute-force approach to cracking it is very difficult.
		This is a fundamental principle of cryptography, stated by a 19th-century Dutch linguist and cryptographer, Auguste Kerckhoffs von Niewenhof (1835:1903), and known as "Kerckhoffs' Principle": The security of a cipher should not depend on an enemy's ignorance of the enciphering algorithm, only the enemy's ignorance of the key.
		In fact, codebreaking is often focused on discovering keys, since the cipher scheme may be well understood.
	www.darkmattermag.com /October2003/dark_science2.htm (679 words)

	Nat' Academies Press, Cryptography's Role in Securing the Information Society (1996)
		The distinction between the general system (i.e., a product) and the specific key (of an encrypted message) was first articulated by Auguste Kerckhoffs in his historic book La Cryptographie Militaire, published in 1883.
		This has proved to be true, and Kerckhoffs' second requirement has become widely accepted under a form that is sometimes called the fundamental assumption of military cryptography: that the enemy knows the general system.
		But he must still be unable to solve messages in it without knowing the specific key.
	www.nap.edu /books/0309054753/html/202.html (828 words)

Try your search on: Qwika (all wikis)