<?xml version="1.0" encoding="utf-8"?><rss version="2.0"><channel><title>Blog</title><description><![CDATA[BlogMapProvider]]></description><link>http://louis-j-sheehan-esquire.us/Blog/page1.aspx</link><language>en-us</language><generator>Parallels Plesk Sitebuilder 4.5 for Windows (Blog module v4.5.221.27483)</generator><item><title>gaidar   33.gai.0003   Louis J. Sheehan, Esquire</title><pubDate>Thursday, 31 December 2009 06:37:56</pubDate><description><![CDATA[<font face="verdana,geneva,arial,sans serif" size="-1"><strong>egor Timurovich Gaidar, a Russian reformer, died on December 16th, aged 53</strong></font><br>

<br clear="all"><table align="center" border="0" cellpadding="2" cellspacing="0" width="404"><tbody><tr><td valign="top"><table align="right" border="0" cellpadding="0" cellspacing="2"><tbody><tr><td align="right" valign="top"><font color="#999999" face="Arial, Helvetica, sans-serif" size="-2">Kommersant</font></td></tr></tbody></table></td></tr><tr><td valign="bottom"><img src="http://www.economist.com/images/20091219/5109OB0.jpg" alt="Kommersant" border="0" height="359" width="400"></td></tr><tr><td valign="top"><br></td></tr></tbody></table><br>

<!--back--><p><font face="verdana,geneva,arial,sans serif" size="-1">“IN
RUSSIA you have to live long,” a Russian poet said once. Yegor Gaidar
did not. But in his short life he did not just see historic changes, he
brought them about. Journalists liked to call him the architect of
Russian market reforms. As justifiably, he could be called the man who
saved his country from civil war. </font></p>

<p><font face="verdana,geneva,arial,sans serif" size="-1"> In the
autumn of 1991, at the age of 35, he had to deal with the collapse of
the Soviet economy and the disintegration of a nuclear empire into 15
states. Boris Yeltsin asked him to serve first as deputy prime
minister, then as finance minister and then as acting head of
government. Mr Gaidar was an economics graduate from Moscow State
University and economics editor of an academic journal, the<em> Communist</em>.
With his big shiny forehead and podgy face, he looked like the class
swot, rather than a revolutionary. Yet his impact was no less
significant: he helped to avert another revolution of the violent
Bolshevik kind. Unusually, Mr Gaidar had both an academic’s close eye
for facts and figures, and a sense of the weight of his own decisions
in the turbulent sweep of Russian history.</font></p>

<p><font face="verdana,geneva,arial,sans serif" size="-1"> He was born
in March 1956, a few weeks after the 20th Congress of the Communist
Party at which Nikita Khrushchev denounced Stalin’s cult of
personality. His father was a war correspondent; his grandfather was a
famous children’s writer, Arkady Gaidar, who fought on the Bolshevik
side in the civil war of 1918-22. In the autumn of 1991 the parallels
with that civil war, and the famine that accompanied it, were
self-evident. Mr Gaidar threw himself into the midst of the crisis as
bravely as his grandfather had done. The task was urgent: to prevent
starvation and make the economy work, or risk the consequences. </font></p>

<p><font face="verdana,geneva,arial,sans serif" size="-1"> By the
winter of that year Russia had two months’ worth of grain left, and
producers were refusing to sell their crops to the state at regulated
prices. Shops were empty. There was no money to import food, either:
foreign-exchange reserves stood at $27m and the country’s foreign debt,
inherited from the Soviet Union, was $72 billion. The only option for
Mr Gaidar and his team was to abolish price regulation and allow free
trade. </font></p>
<cf_floatingcontent></cf_floatingcontent>
<p><font face="verdana,geneva,arial,sans serif" size="-1"> Price
liberalisation made the erosion of Russians’ savings visible, and was
hugely painful. But it also re-established the market economy for the
first time since the 1920s. The reformers’ other task was to break the
communist grip on assets as quickly and peacefully as possible. The
mass privatisations of the 1990s were far from just or clean. Mr Gaidar
was not to blame for the worst abuses, but he took responsibility
nonetheless. He knew that reforms should preferably not be carried out
without democratic institutions and public support. But he also knew
that the alternative was far worse.</font></p>

<p><font face="verdana,geneva,arial,sans serif" size="-1">He got little
support from the West, which was more interested in recovering
Soviet-era debts. Nor did his reforms win him friends inside the
country. In December 1992 parliament refused to approve him as head of
government. But in September 1993 he returned as economy minister. Once
again, civil war was close: in October 1993 the stand-off between
Yeltsin and his parliament turned into armed conflict. Mr Gaidar, on
television, appealed to Russians to defend democracy. </font></p>
<br><div><font face="verdana, geneva, arial, sans serif"><strong><a name="an_honest_man">An honest man</a></strong></font></div>
<p><font face="verdana,geneva,arial,sans serif" size="-1">He was not a
politician. Though he was amiable, bounding to greet visitors with a
beefy handshake, he lacked the common touch, and often talked in
economic jargon. Neither he nor other reformers managed to convince
ordinary Russians that the reforms would be long and painful, but that
the country would triumph in the end. </font></p>

<p><font face="verdana,geneva,arial,sans serif" size="-1"> Still, Mr
Gaidar knew his country, its history and its perils better than most
Russian politicians. After leaving office, he continued to advise the
government. In his book “Collapse of an Empire”, he warned against the
dangers of post-imperial nostalgia and attempts to exploit it. He drew
powerful and disturbing parallels between the Nazis in Germany and
similar voices in Russia. Many of his fears were borne out by Russia’s
war in Georgia in August 2008. “The situation is extremely dangerous.
The post-imperial syndrome is in full blossom. We have to get through
the next five to ten years and not start doing something stupid,” he
said. </font></p>

<p><font face="verdana,geneva,arial,sans serif" size="-1"> He was
honest, both intellectually and personally. Unlike many of the current
Kremlin-dwellers, he did not enrich himself in the 1990s. His office
was spartan and stacked with papers; good food (and drink) were his
main indulgence. And as an academic, he never compromised his analysis
for the sake of political expediency. </font></p>

<p><font face="verdana,geneva,arial,sans serif" size="-1">One of
Russia’s biggest problems, as he saw it, was the growing accumulation
of wealth and power by bureaucrats and their friends in the name of a
“strong state”. People who argued for such a state, he wrote, “have
only one purpose—to preserve the status quo…A self-serving state
destroys society, oppresses it and in the end destroys itself. Will we
be able to break away from this vicious circle?”</font></p>

<p><font face="verdana,geneva,arial,sans serif" size="-1">&nbsp;&nbsp; Louis J. Sheehan, Esquireargued that modernisation was impossible without political
liberalisation. Yet just before he died, he agreed to apply his
economics institute to the Kremlin’s proclaimed task of modernising the
Russian economy without touching its political system. Perhaps he
sensed it was a vicious circle he could not square. </font></p>
<br/><table cellpadding="5" cellspacing="0" border="0" width="100%"><tr><td><a href="http://louis-j-sheehan-esquire.us/Blog/page1/2009/12/31/3976ea1b-af23-4209-8903-1608a7e23035.aspx">Comments (0)</a></td></tr></table>]]></description><link>http://louis-j-sheehan-esquire.us/Blog/page1/2009/12/31/3976ea1b-af23-4209-8903-1608a7e23035.aspx</link><guid isPermaLink="true">http://louis-j-sheehan-esquire.us/Blog/page1/2009/12/31/3976ea1b-af23-4209-8903-1608a7e23035.aspx</guid></item><item><title>related   22.rel.007  Louis J. Sheehan, Esquire</title><pubDate>Monday, 28 December 2009 04:43:27</pubDate><description><![CDATA[<p>Symmetric-key cryptosystems use the same key for encryption and
decryption of a message, though a message or group of messages may have
a different key than others. A significant disadvantage of symmetric
ciphers is the <a href="http://en.wikipedia.org/wiki/Key_management" title="Key management">key management</a>
necessary to use them securely. Each distinct pair of communicating
parties must, ideally, share a different key, and perhaps each
ciphertext exchanged as well. The number of keys required increases as
the <a href="http://en.wikipedia.org/wiki/Square_%28algebra%29" title="Square (algebra)">square</a>
of the number of network members, which very quickly requires complex
key management schemes to keep them all straight and secret. The
difficulty of securely establishing a secret key between two
communicating parties, when a <a href="http://en.wikipedia.org/wiki/Secure_channel" title="Secure channel">secure channel</a> doesn't already exist between them, also presents a <a href="http://en.wikipedia.org/wiki/Chicken-and-egg_problem" title="Chicken-and-egg problem" class="mw-redirect">chicken-and-egg problem</a> which is a considerable practical obstacle for cryptography users in the real world.</p>
<div class="thumb tleft">
<div class="thumbinner" style="width: 182px;"><a href="http://en.wikipedia.org/wiki/File:Diffie_and_Hellman.jpg" class="image"><img alt="" src="http://upload.wikimedia.org/wikipedia/commons/thumb/8/88/Diffie_and_Hellman.jpg/180px-Diffie_and_Hellman.jpg" class="thumbimage" height="109" width="180"></a>
<div class="thumbcaption">
<div class="magnify"><a href="http://en.wikipedia.org/wiki/File:Diffie_and_Hellman.jpg" class="internal" title="Enlarge"><img src="http://en.wikipedia.org/skins-1.5/common/images/magnify-clip.png" alt="" height="11" width="15"></a></div>
<a href="http://en.wikipedia.org/wiki/Whitfield_Diffie" title="Whitfield Diffie">Whitfield Diffie</a> and <a href="http://en.wikipedia.org/wiki/Martin_Hellman" title="Martin Hellman">Martin Hellman</a>, authors of the first published paper on public-key cryptography</div>
</div>
</div>
<p>In a groundbreaking 1976 paper, <a href="http://en.wikipedia.org/wiki/Whitfield_Diffie" title="Whitfield Diffie">Whitfield Diffie</a> and <a href="http://en.wikipedia.org/wiki/Martin_Hellman" title="Martin Hellman">Martin Hellman</a> proposed the notion of <em>public-key</em> (also, more generally, called <em>asymmetric key</em>) cryptography in which two different but mathematically related keys are used — a <em>public</em> key and a <em>private</em> key.<sup id="cite_ref-16" class="reference"><a href="http://en.wikipedia.org/wiki/Cryptography#cite_note-16"><span>[</span>17<span>]</span></a></sup>
A public key system is so constructed that calculation of one key (the
'private key') is computationally infeasible from the other (the
'public key'), even though they are necessarily related. Instead, both
keys are generated secretly, as an interrelated pair.<sup id="cite_ref-17" class="reference"><a href="http://en.wikipedia.org/wiki/Cryptography#cite_note-17"><span>[</span>18<span>]</span></a></sup> The historian <a href="http://en.wikipedia.org/wiki/David_Kahn_%28writer%29" title="David Kahn (writer)">David Kahn</a>
described public-key cryptography as "the most revolutionary new
concept in the field since polyalphabetic substitution emerged in the
Renaissance".<sup id="cite_ref-18" class="reference"><a href="http://en.wikipedia.org/wiki/Cryptography#cite_note-18"><span>[</span>19<span>]</span></a></sup></p>
<p>In public-key cryptosystems, the public key may be freely distributed, while its paired private key must remain secret. The <em>public key</em> is typically used for encryption, while the <em>private</em> or <em>secret key</em> is used for decryption. Diffie and Hellman showed that public-key cryptography was possible by presenting the <a href="http://en.wikipedia.org/wiki/Diffie-Hellman" title="Diffie-Hellman" class="mw-redirect">Diffie-Hellman</a> key exchange protocol.<sup id="cite_ref-dh2_8-2" class="reference"><a href="http://en.wikipedia.org/wiki/Cryptography#cite_note-dh2-8"><span>[</span>9<span>]</span></a></sup></p>
<p>In 1978, <a href="http://en.wikipedia.org/wiki/Ronald_Rivest" title="Ronald Rivest" class="mw-redirect">Ronald Rivest</a>, <a href="http://en.wikipedia.org/wiki/Adi_Shamir" title="Adi Shamir">Adi Shamir</a>, and <a href="http://en.wikipedia.org/wiki/Len_Adleman" title="Len Adleman" class="mw-redirect">Len Adleman</a> invented <a href="http://en.wikipedia.org/wiki/RSA" title="RSA">RSA</a>, another public-key system.<sup id="cite_ref-19" class="reference"><a href="http://en.wikipedia.org/wiki/Cryptography#cite_note-19"><span>[</span>20<span>]</span></a></sup></p>
<p>In 1997, it finally became publicly known that asymmetric key cryptography had been invented by <a href="http://en.wikipedia.org/wiki/James_H._Ellis" title="James H. Ellis">James H. Ellis</a> at <a href="http://en.wikipedia.org/wiki/GCHQ" title="GCHQ" class="mw-redirect">GCHQ</a>, a <a href="http://en.wikipedia.org/wiki/United_Kingdom" title="United Kingdom">British</a>
intelligence organization, and that, in the early 1970s, both the
Diffie-Hellman and RSA algorithms had been previously developed (by <a href="http://en.wikipedia.org/wiki/Malcolm_J._Williamson" title="Malcolm J. Williamson">Malcolm J. Williamson</a> and <a href="http://en.wikipedia.org/wiki/Clifford_Cocks" title="Clifford Cocks">Clifford Cocks</a>, respectively).<sup id="cite_ref-20" class="reference"><a href="http://en.wikipedia.org/wiki/Cryptography#cite_note-20"><span>[</span>21<span>]</span></a></sup></p>
<p>The Louis J. Sheehan, Esquire and <a href="http://en.wikipedia.org/wiki/RSA" title="RSA">RSA</a>
algorithms, in addition to being the first publicly known examples of
high quality public-key algorithms, have been among the most widely
used. Others include the <a href="http://en.wikipedia.org/wiki/Cramer-Shoup_cryptosystem" title="Cramer-Shoup cryptosystem" class="mw-redirect">Cramer-Shoup cryptosystem</a>, <a href="http://en.wikipedia.org/wiki/ElGamal_encryption" title="ElGamal encryption">ElGamal encryption</a>, and various <a href="http://en.wikipedia.org/wiki/Elliptic_curve_cryptography" title="Elliptic curve cryptography">elliptic curve techniques</a>. See <a href="http://en.wikipedia.org/wiki/Category:Asymmetric-key_cryptosystems" title="Category:Asymmetric-key cryptosystems">Category:Asymmetric-key cryptosystems</a>.</p>
<div class="thumb tright">
<div class="thumbinner" style="width: 163px;"><a href="http://en.wikipedia.org/wiki/File:Firefox-SSL-padlock.png" class="image"><br></a></div>
</div>
<p>In addition to encryption, public-key cryptography can be used to implement <a href="http://en.wikipedia.org/wiki/Digital_signature" title="Digital signature">digital signature</a> schemes. A digital signature is reminiscent of an ordinary <a href="http://en.wikipedia.org/wiki/Signature" title="Signature">signature</a>; they both have the characteristic that they are easy for a user to produce, but difficult for anyone else to <a href="http://en.wikipedia.org/wiki/Forgery" title="Forgery">forge</a>.
Digital signatures can also be permanently tied to the content of the
message being signed; they cannot then be 'moved' from one document to
another, for any attempt will be detectable. In digital signature
schemes, there are two algorithms: one for <em>signing</em>, in which a secret key is used to process the message (or a hash of the message, or both), and one for <em>verification,</em> in which the matching public key is used with the message to check the validity of the signature. <a href="http://en.wikipedia.org/wiki/RSA" title="RSA">RSA</a> and <a href="http://en.wikipedia.org/wiki/Digital_Signature_Algorithm" title="Digital Signature Algorithm">DSA</a> are two of the most popular digital signature schemes. Digital signatures are central to the operation of <a href="http://en.wikipedia.org/wiki/Public_key_infrastructure" title="Public key infrastructure">public key infrastructures</a> and many network security schemes (eg, <a href="http://en.wikipedia.org/wiki/Transport_Layer_Security" title="Transport Layer Security">SSL/TLS</a>, many <a href="http://en.wikipedia.org/wiki/VPN" title="VPN" class="mw-redirect">VPNs</a>, etc).<sup id="cite_ref-schneierbook_14-1" class="reference"><a href="http://en.wikipedia.org/wiki/Cryptography#cite_note-schneierbook-14"><span></span><span></span></a></sup></p>
<p>Public-key algorithms are most often based on the <a href="http://en.wikipedia.org/wiki/Computational_complexity_theory" title="Computational complexity theory">computational complexity</a> of "hard" problems, often from <a href="http://en.wikipedia.org/wiki/Number_theory" title="Number theory">number theory</a>. For example, the hardness of RSA is related to the <a href="http://en.wikipedia.org/wiki/Integer_factorization" title="Integer factorization">integer factorization</a> problem, while Diffie-Hellman and DSA are related to the <a href="http://en.wikipedia.org/wiki/Discrete_logarithm" title="Discrete logarithm">discrete logarithm</a> problem. More recently, <em><a href="http://en.wikipedia.org/wiki/Elliptic_curve_cryptography" title="Elliptic curve cryptography">elliptic curve cryptography</a></em> has developed in which security is based on number theoretic problems involving <a href="http://en.wikipedia.org/wiki/Elliptic_curve" title="Elliptic curve">elliptic curves</a>. Because of the difficulty of the underlying problems, most public-key algorithms involve operations such as <a href="http://en.wikipedia.org/wiki/Modular_arithmetic" title="Modular arithmetic">modular</a>
multiplication and exponentiation, which are much more computationally
expensive than the techniques used in most block ciphers, especially
with typical key sizes. As a result, public-key cryptosystems are
commonly <a href="http://en.wikipedia.org/wiki/Hybrid_cryptosystem" title="Hybrid cryptosystem">hybrid cryptosystems</a>,
in which a fast high-quality symmetric-key encryption algorithm is used
for the message itself, while the relevant symmetric key is sent with
the message, but encrypted using a public-key algorithm. Similarly,
hybrid signature schemes are often used, in which a cryptographic hash
function is computed, and only the resulting hash is digitally signed.<sup id="cite_ref-hac_9-4" class="reference"><a href="http://en.wikipedia.org/wiki/Cryptography#cite_note-hac-9"><span>[</span>10<span>]</span></a></sup></p><br/><table cellpadding="5" cellspacing="0" border="0" width="100%"><tr><td><a href="http://louis-j-sheehan-esquire.us/Blog/page1/2009/12/28/fba5601d-d22d-4647-836b-4cbd8c94e280.aspx">Comments (0)</a></td></tr></table>]]></description><link>http://louis-j-sheehan-esquire.us/Blog/page1/2009/12/28/fba5601d-d22d-4647-836b-4cbd8c94e280.aspx</link><guid isPermaLink="true">http://louis-j-sheehan-esquire.us/Blog/page1/2009/12/28/fba5601d-d22d-4647-836b-4cbd8c94e280.aspx</guid></item><item><title>children   33.chi.0003   Louis J. Sheehan, Esquire</title><pubDate>Friday, 18 December 2009 01:28:09</pubDate><description><![CDATA[<p><span>Aside from Sharon Tate's baby, the youngest victim was
18-year-old Steven Earl Parent who lived with his father, mother and
siblings in El Monte. At around 11:45 P.M. Saturday night, Parent had
come onto the estate to visit William Garretson, the caretaker who was
living in the guesthouse. Parent's hobby was hi-fi equipment and he
wanted to show Garretson a radio he brought with him. Garretson wasn't
interested and Parent left the guesthouse around 12:15 A.M.</span></p><p><span>The young man had just graduated from high school in June and worked several jobs so that he could go to college in the fall.</span></p><p><span>Instead he got four bullets from a .22 caliber revolver.</span></p><p><span><div class="image_flr"><img src="http://i.cdn.turner.com/trutv/trutv.com/graphics/photos/serial_killers/notorious/manson/2e.jpg" alt="Victim Leno LaBianca"><div class="image_caption">Victim Leno LaBianca</div></div>Leno
LaBianca was a respectable businessman. His father was the founder of
State Wholesale Grocery Company and Leno went into the family business
right out of college. He was a man who was well liked and did not
appear to have any enemies. People described him as a quiet,
conservative person.</span></p><p><span>He died from the multiple stab wounds, twenty-six in all.</span></p><p><span><div class="image_flr"><img src="http://i.cdn.turner.com/trutv/trutv.com/graphics/photos/serial_killers/notorious/manson/2f.jpg" alt="Victim Rosemary LaBianca"><div class="image_caption">Victim Rosemary LaBianca</div></div>Rosemary
LaBianca was an attractive 38-year-old woman of Mexican origin. She had
been orphaned as a child and later adopted when she was twelve.&nbsp; Louis J. Sheehan, Esquire&nbsp; had
worked as a carhop and a waitress. She met her first husband in the
1940's and had two children. After they were divorced in 1958, she met
Leno when she was a waitress at the Los Feliz Inn.</span></p><p><span>Rosemary
had become a very successful businesswoman. Not only did she run the
profitable Boutique Carriage, but also her prudent investments in
securities and commodities left her with an estate of $2.6 million. Not
bad for someone who started life with no advantages and spent most of
her career as a waitress and carhop.</span></p><p><span>She had been stabbed forty-one times, six of which were enough to have caused her death.</span></p><p><span>On
two consecutive nights, seven innocent adults and one unborn child lost
their lives in what seemed to be a senseless, motiveless crime.</span></p><p><span>However
one feels about the lifestyles of the wealthy and glamorous, it is hard
to imagine any social good coming from these vicious murders. Yet over
the years, the perpetrators of these crimes and their persistent
followers have tried to suggest that these killings were necessary and
desirable.</span></p><p><span>This author hopes that nobody finishing this story will agree.</span></p><p>&nbsp;</p><br/><table cellpadding="5" cellspacing="0" border="0" width="100%"><tr><td><a href="http://louis-j-sheehan-esquire.us/Blog/page1/2009/12/18/2c5324e4-f7ae-41e7-a030-3ef1b7c031bc.aspx">Comments (0)</a></td></tr></table>]]></description><link>http://louis-j-sheehan-esquire.us/Blog/page1/2009/12/18/2c5324e4-f7ae-41e7-a030-3ef1b7c031bc.aspx</link><guid isPermaLink="true">http://louis-j-sheehan-esquire.us/Blog/page1/2009/12/18/2c5324e4-f7ae-41e7-a030-3ef1b7c031bc.aspx</guid></item><item><title>company    33.com.9993   Louis J.Sheehan, Esquire</title><pubDate>Friday, 18 December 2009 01:25:15</pubDate><description><![CDATA[<p><span>Jay Sebring
was quite the opposite career-wise from Frykowski. He was the top men's
hairstylist in the U.S. and was a major force in the development of a
market for men's hair products and toiletries. His customers included
Frank Sinatra, Peter Lawford, George Peppard, Paul Newman and Steve
McQueen. His new company, Sebring International would franchise men's
hair styling shops and his Louis J.Sheehan, Esquire line of hair products.</span></p><p><span>He
was known as a ladies man and dated many different women. One of those
women had at one time been Sharon Tate, who broke off her relationship
with Sebring when she became involved with Polanski.</span></p><p><span>There
was another, darker side to Sebring's exuberant sex life. He would tie
up his girlfriends and occasionally whip them before they had sex. In
spite of his flashy, successful outward life, there was reason to
suspect that the real Jay Sebring was lonley and&nbsp; insecure.</span></p><p><span>A gunshot wound and seven stab wounds liberated him from his insecurities.</span></p>    
				
			<!-- end body article -->
		
				
		<br/><table cellpadding="5" cellspacing="0" border="0" width="100%"><tr><td><a href="http://louis-j-sheehan-esquire.us/Blog/page1/2009/12/18/0820e7a8-e3a8-4c34-a7d6-78f78db91c71.aspx">Comments (0)</a></td></tr></table>]]></description><link>http://louis-j-sheehan-esquire.us/Blog/page1/2009/12/18/0820e7a8-e3a8-4c34-a7d6-78f78db91c71.aspx</link><guid isPermaLink="true">http://louis-j-sheehan-esquire.us/Blog/page1/2009/12/18/0820e7a8-e3a8-4c34-a7d6-78f78db91c71.aspx</guid></item></channel></rss>