<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" media="screen" href="/~d/styles/atom10full.xsl"?><?xml-stylesheet type="text/css" media="screen" href="http://feeds.feedburner.com/~d/styles/itemcontent.css"?><feed xmlns="http://www.w3.org/2005/Atom" xmlns:openSearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:gd="http://schemas.google.com/g/2005" gd:etag="W/&quot;D0QNRnkyeyp7ImA9WxNUE0k.&quot;"><id>tag:blogger.com,1999:blog-21753615</id><updated>2009-11-04T15:36:37.793+01:00</updated><title>LittleLite WeB log</title><subtitle type="html">&lt;a href="http://www.littlelite.net/"&gt;LittleLite Software&lt;/a&gt; is a house of cryptography, privacy and security related software.&lt;br /&gt;&lt;br /&gt;

LittleLite develops security try-before-you-buy products, such as Folder Crypt, among the easiest and powerful encryption tool on the market, and Iside, the message digest, hash sum computing tool&lt;br /&gt;&lt;br /&gt;

This site is best viewed with &lt;br/&gt;&lt;a href="http://www.microsoft.com/typography/cleartype/tuner/Step1.aspx"&gt;Clear Type font technology&lt;/a&gt;&lt;br /&gt;</subtitle><link rel="http://schemas.google.com/g/2005#feed" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/posts/default" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/" /><link rel="hub" href="http://pubsubhubbub.appspot.com/" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email></author><generator version="7.00" uri="http://www.blogger.com">Blogger</generator><openSearch:totalResults>22</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><link rel="self" href="http://feeds.feedburner.com/LittleliteWebLog" type="application/atom+xml" /><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="hub" href="http://pubsubhubbub.appspot.com" /><entry gd:etag="W/&quot;A0cHSXg_eCp7ImA9WxNRFks.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-8235937308678375551</id><published>2009-09-11T13:32:00.003+02:00</published><updated>2009-09-11T13:37:18.640+02:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2009-09-11T13:37:18.640+02:00</app:edited><title>New Windows 7 features</title><content type="html">We are considering to switch to .NET Framework v.3.5 in the next major releases of our products, in particular &lt;a href="http://www.littlelite.net/foldercrypt/"&gt;Folder Crypt&lt;/a&gt; and &lt;a href="http://www.littlelite.net/iside/"&gt;Iside&lt;/a&gt;, to support some of the new features of Windows 7, such as the progress on the taskbar.&lt;br /&gt;&lt;br /&gt;&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://4.bp.blogspot.com/_2vey6iS4NsI/Sqo1tT0iFyI/AAAAAAAABMI/I_G5dYZ71fw/s1600-h/superbar1.jpg"&gt;&lt;img style="cursor:pointer; cursor:hand;width: 320px; height: 187px;" src="http://4.bp.blogspot.com/_2vey6iS4NsI/Sqo1tT0iFyI/AAAAAAAABMI/I_G5dYZ71fw/s320/superbar1.jpg" border="0" alt=""id="BLOGGER_PHOTO_ID_5380171757378475810" /&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;Both versions, completely compatible with Windows 7 and Vista, should be available before November, in particular Folder Crypt whose version 3.3 is being tested right now.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-8235937308678375551?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/8235937308678375551/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=8235937308678375551" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/8235937308678375551?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/8235937308678375551?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2009/09/new-windows-7-features.html" title="New Windows 7 features" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="http://4.bp.blogspot.com/_2vey6iS4NsI/Sqo1tT0iFyI/AAAAAAAABMI/I_G5dYZ71fw/s72-c/superbar1.jpg" height="72" width="72" /><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;DEUCR3g5eCp7ImA9WxJUEk8.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-1403293799792632905</id><published>2009-06-26T10:51:00.003+02:00</published><updated>2009-07-10T13:44:26.620+02:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2009-07-10T13:44:26.620+02:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="DES" /><category scheme="http://www.blogger.com/atom/ns#" term="AES" /><category scheme="http://www.blogger.com/atom/ns#" term="encryption" /><category scheme="http://www.blogger.com/atom/ns#" term="Rijndael" /><title>Keep your Secrets!</title><content type="html">Secrets is an easy online e-mailer application to send and receive encrypted messages.&lt;br /&gt;&lt;br /&gt;&lt;p align="center"&gt;&lt;a href="https://secrets-app.appspot.com/"&gt;&lt;img style="WIDTH: 326px; HEIGHT: 317px; CURSOR: hand" border="0" alt="" src="http://www.littlelite.net/public/secrets_full_logo.jpg" /&gt;&lt;/a&gt;&lt;/p&gt;&lt;br /&gt;&lt;br /&gt;Powered by &lt;a href="http://appgallery.appspot.com/"&gt;Google AppEngine&lt;/a&gt; and secured by &lt;a href="http://www.networksorcery.com/enp/data/encryption.htm"&gt;standard encryption algorithms &lt;/a&gt;with keys up to 1024 bit, such as DES, 3DES, AES and Blowfish, this is the perfect tool to keep your secrets. Also any communication between you and Secrets is secured with &lt;a href="http://it.wikipedia.org/wiki/Transport_Layer_Security"&gt;SSL/HTTPS protocol&lt;/a&gt;.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Here is how it works:&lt;br /&gt;&lt;ol&gt;&lt;li&gt;You compose a secret message &lt;/li&gt;&lt;li&gt;You set a password (that you must separately communicate to the receiver) &lt;/li&gt;&lt;li&gt;You send the message indicating the e-mail address of the receiver&lt;br /&gt;&lt;/li&gt;&lt;/ol&gt;&lt;p&gt;The receiver will get an e-mail with a notice. He follows the link,&lt;br /&gt;enters the correct password that he already received from you, and he will be able to read / store / forward the message.&lt;br /&gt;&lt;br /&gt;Give Secrets a try @ &lt;a href="https://secrets-app.appspot.com/"&gt;https://secrets-app.appspot.com/&lt;/a&gt;&lt;/p&gt;&lt;p&gt; &lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-1403293799792632905?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/1403293799792632905/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=1403293799792632905" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/1403293799792632905?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/1403293799792632905?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2009/06/keep-your-secrets.html" title="Keep your Secrets!" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;DkUBR38yfSp7ImA9WxJTE00.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-8461159194860473648</id><published>2009-04-21T10:50:00.001+02:00</published><updated>2009-04-21T10:57:36.195+02:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2009-04-21T10:57:36.195+02:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="shred" /><category scheme="http://www.blogger.com/atom/ns#" term="gutmann" /><category scheme="http://www.blogger.com/atom/ns#" term="data erasure" /><category scheme="http://www.blogger.com/atom/ns#" term="erase" /><title>Just delete is not enough</title><content type="html">When you delete a file or a folder in your PC, it is not actually erased. Simply, the hard disk descriptor table is updated and the file entry is removed. So, the actual bytes of the file remain on the disk. Even when the file area is overwritten, it is still possible to recover data, by applying certain laboratory procedures, since it's rare that a portion of the hard disk is rewritten in his entire life more than 5/10 times. It has been calculated that information is completely unrecoverable only after more than 30 rewrites.&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.littlelite.net/"&gt;LittleLite Software&lt;/a&gt; has just released the version of  its leading edge security tool: &lt;a href="http://www.littlelite.net/nshred/"&gt;NShred&lt;/a&gt;. With &lt;a href="http://www.littlelite.net/nshred/"&gt;NShred &lt;/a&gt;you can eliminate confidential information and data from PC drives and any other storage. Name, size, contents of the erased file or folder can never be recovered, by any software or hardware means.&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.littlelite.net/nshred/"&gt;NShred &lt;/a&gt;applies industry wide security techniques and standards in doing so, such as:&lt;br /&gt;&lt;br /&gt;•    US Department of Defense DOD 5220.22-M (5 overwrites )&lt;br /&gt;•     Gutmann (32 overwrites)&lt;br /&gt;•    HMG Infosec Standard (3 overwrites)&lt;br /&gt;•    German VSITR  (7 overwrites)&lt;br /&gt;•    Navso P-5329-26 (3 overwrites)&lt;br /&gt;•    Zerofill (single overwrite)&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.littlelite.net/nshred/"&gt;NShred &lt;/a&gt;effectively destroys any file related data. It detects the file area on the hard disk or other drive. This area includes metadata on file, such as name and dates of creation and modification. The area is then rewritten  several times depending on the standard adopted. For instance, with HMG algorithm, the file area is rewritten first with "0" bit, then with "1" bit, then with a random byte. After rewriting, the file area is reduced to zero, the file renamed with random characters and finally deleted. This procedure guarantees that not even a single byte from the former file can ever be retrieved.&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.littlelite.net/nshred/"&gt;NShred &lt;/a&gt;is different from other tools on the software market. While the majority of shredding tools are "brute force" and "operating system agnostic" erasing tools, &lt;a href="http://www.littlelite.net/nshred/"&gt;NShred &lt;/a&gt;behaves accordingly to the underlying Operating System (OS), denying the user the possibility to turn it unstable. For instance, if the OS denies a delete operation, &lt;a href="http://www.littlelite.net/nshred/"&gt;NShred &lt;/a&gt;will NOT erase the file. The user will be able to erase it later when it is no more locked by the OS.&lt;br /&gt;&lt;br /&gt;Plus, &lt;a href="http://www.littlelite.net/nshred/"&gt;NShred &lt;/a&gt;is a .NET Framework application, which ensure the user with a superior robustness and full compatibility and integration with the latest Microsoft Operating Systems and tools.&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.littlelite.net/nshred/"&gt;NShred &lt;/a&gt;earned the prestigious 5 stars editor ranking from CNET download.com site. It is available for evaluation through the best software downloading sites: try a &lt;a href="http://www.google.it/search?source=ig&amp;amp;hl=it&amp;amp;rlz=&amp;amp;=&amp;amp;q=littlelite+nshred&amp;amp;btnG=Cerca+con+Google&amp;amp;meta=lr%3D&amp;amp;aq=f&amp;amp;oq="&gt;Google search&lt;/a&gt; with '&lt;a href="http://www.google.it/search?source=ig&amp;amp;hl=it&amp;amp;rlz=&amp;amp;=&amp;amp;q=littlelite+nshred&amp;amp;btnG=Cerca+con+Google&amp;amp;meta=lr%3D&amp;amp;aq=f&amp;amp;oq="&gt;NShred LittleLite&lt;/a&gt;'.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-8461159194860473648?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/8461159194860473648/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=8461159194860473648" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/8461159194860473648?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/8461159194860473648?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2009/04/just-delete-is-not-enough.html" title="Just delete is not enough" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;Ck4HR304fCp7ImA9WxVQF0k.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-8836222018960854268</id><published>2009-02-04T10:42:00.002+01:00</published><updated>2009-02-04T10:48:56.334+01:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2009-02-04T10:48:56.334+01:00</app:edited><title>Version 2.2 of NCrypt TX about to be released</title><content type="html">&lt;p&gt;We are about to release the new version of our "first" application - that is, the first application ever developed and published by LittleLite Software: &lt;span style="font-weight: bold;"&gt;NCrypt TX&lt;/span&gt;.  &lt;span style="font-weight: bold;"&gt;&lt;span style="font-weight: bold;"&gt;&lt;/span&gt;&lt;br /&gt;&lt;/span&gt;&lt;/p&gt;&lt;p&gt;&lt;span style="font-weight: bold;"&gt;NCrypt TX&lt;/span&gt; v2.2 presents itself like a text editor with encryption and decryption commands. The input text can be encrypted using state-of-the art encryption algorithms, such as AES-Rijndael or 3DES, or with historical algorithms, such as ROT13 or Playfair. The user must only decide the encryption algorithm and insert a password. The password is then turned by &lt;span style="font-weight: bold;"&gt;NCrypt TX&lt;/span&gt; into a sequence of unique bytes with SHA384 hash function and then passed to the encryption algorithm.&lt;br /&gt;&lt;/p&gt;&lt;p&gt;The corresponding text may be displayed as Base64 text or Hexadecimal text. For instance, the first line of this message, encrypted with DES and password = "Password" result into the following string:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;"&lt;span style="font-size: 85%;"&gt;&lt;span style="font-family: courier new;"&gt;d99460564c4713f56a6e2e40c9b091a8c93bba4c4ba9cbdf29a4a56b9be0&lt;br /&gt;43add7c942079b&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size: 85%;"&gt;&lt;span style="font-family: courier new;"&gt;e8f&lt;/span&gt;&lt;span style="font-family: courier new;"&gt;56f652d2822a6ff5f8fc88da5edbcfbf27cbd7bc44d&lt;br /&gt;4df8ffd0b03f96b521ecc04eb18610cf&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size: 85%;"&gt;&lt;span style="font-family: courier new;"&gt;5ee8a30fc702b308c154f6fb6136&lt;br /&gt;f5fda6b2b4792f8c45609f187...&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size: 85%;"&gt;&lt;span style="font-family: courier new;"&gt;&lt;/span&gt;&lt;/span&gt;"&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;NCrypt TX has a feature that distinguish it from other similar tools: the possibility to hide encrypted text into a random generated text in English words. This is done by the new steganography engine, which is based on an English dictionary of circa 80.000 words. With the steganography function, the first line of this message can be turned into:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;"&lt;span style="font-family: courier new; font-size: 85%;"&gt;Prop euthanizing dials, bannisters flashing. Choicest penetrating instructional peelers nonsuccessive; devastators peso cats maidenhood landings. Damaging prise cupped, landlubbers scandalously, falsifies carolling manse esophagi; pays. Malenesses obtaining sabra oddness package. Dirts: silver modification jessamine brutal ostentations monsoonal austerest equivocalnesses loud. Parsley mounts outreach scraggliest exceeding schemer. Manicures mushed, circumscribe decaffeinates levering harlot cleansing plaid chokers glasnosts. Bother portraying dunning baggier disfigurements? Insurgent; cushioning memory immunodeficiency protean repopulating sage. Dandruff relatedness castrates proposed shreds ringlets cursively coagulating flit! Shortstops pastureland incrimination: revival barrows? Bejewel bienniums, longhand greenbelts semiconscious. Pluckinesses rowings: grungier disorders, automated? Anapestics glamour, scantnesses, erasing plumb moderatenesses medias ruggedest: analytic lovemaking: hares? Four conquests falconries notarizing clangors. Lanterns davenports: indented legible fluffy! Conferee codependencies climb forestland egghead! Geranium copycat reconditioning extemporaneousnesses fieldworkers hereon pleasant: ducklings fumigates docking. Knifes residential screen&lt;br /&gt;pailful furring. Recontact las sacking conversely hydrophobias. Capitalisms repulsions eloped jagged decimation frowsiest.&lt;/span&gt;"&lt;/p&gt;&lt;p&gt;&lt;br /&gt;A completely free, non-limited version of &lt;span style="font-weight: bold;"&gt;NCrypt TX&lt;/span&gt;, is available for a trial evaluation period at: &lt;a target="_blank" href="http://www.google.com/url?sa=D&amp;amp;q=http://www.littlelite.net/ncrypt/"&gt;http://www.littlelite.net/ncrypt/&lt;/a&gt;&lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-8836222018960854268?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/8836222018960854268/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=8836222018960854268" title="1 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/8836222018960854268?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/8836222018960854268?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2009/02/version-22-of-ncrypt-tx-about-to-be.html" title="Version 2.2 of NCrypt TX about to be released" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">1</thr:total></entry><entry gd:etag="W/&quot;AkAFRHgyeCp7ImA9WxZQFUU.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-8153584000958425115</id><published>2008-02-21T11:02:00.003+01:00</published><updated>2008-02-21T11:11:55.690+01:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2008-02-21T11:11:55.690+01:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="encryption AES DES Rijndael LLCryptoLib" /><title>LLCryptoLib v.2.7 released</title><content type="html">We have just released a version 2.7 of LLCryptoLib, which is a .NET library that allows programmers to easily add encryption, integrity and authentication services to their software.&lt;br /&gt;&lt;br /&gt;LLcryptoLib is free for academic purposes and it is freely available for download here: &lt;a href="http://www.littlelite.net/llcryptolib/download.html"&gt;http://www.littlelite.net/llcryptolib/download.html&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;It is compatible with Microsoft .NET and Mono environments. It offers both symmetrical and asymmetrical text and stream encryption classes and hashing functions. It also offers full file shredding functions.&lt;br /&gt;&lt;br /&gt;It is engineered to be easy to use and standard compliant, fully compatible with ASP.NET web applications or desktop C#, Visual Basic .NET or Managed C++ application. LLCryptoLib can be linked to managed (.NET) and unmanaged (COM) projects.  &lt;br /&gt;&lt;br /&gt;It implements a wide range of standard security algorithms. For Hash and checksums functions: CRC32, FCS16/32, G-HASH, GOST, ADLER32, HAVAL, MD2, MD4, MD5, SHA1 / 224 / 256 / 384, TIGER, RIPEMD160, WHIRLPOOL.&lt;br /&gt;&lt;br /&gt;For Symmetric Encryption algorithms: ROT13, Playfair, PseudoDES, DES, Triple DES,      Rijndael (AES), ARC4 - up to 2048 bits, Blowfish - up to 448 bits.&lt;br /&gt;&lt;br /&gt;For Asymmetric, or Public Key Encryption algorithms: RSA and Digital Signature RSA.&lt;br /&gt;&lt;br /&gt;It also supports a variety of utilities, such text to binary conversions with Plain text (Unicode or UTF8) to Hexadecimal (with 4 styles) or to Base64.&lt;br /&gt;&lt;br /&gt;Finally, LLCryptoLib comes with full file and directory shredding APIs, following the recommendations by US Department of Defense (DoD), Guttman or Simple at 1 or 3 steps.&lt;br /&gt;&lt;br /&gt;The package comes with full examples for Visual Studio 2005/2008, MonoDevelop, Visual C# Express, and SharpDevelop, and a suite of NUnit tests.&lt;br /&gt;&lt;br /&gt;You may download LLCryptoLib now at: &lt;a href="http://www.littlelite.net/llcryptolib/download.html"&gt;http://www.littlelite.net/llcryptolib/download.html&lt;/a&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-8153584000958425115?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/8153584000958425115/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=8153584000958425115" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/8153584000958425115?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/8153584000958425115?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2008/02/llcryptolib-v27-released.html" title="LLCryptoLib v.2.7 released" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;C0UBRHY8eCp7ImA9WB9WEE4.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-2485552625974507874</id><published>2007-11-14T10:05:00.000+01:00</published><updated>2007-11-14T10:07:35.870+01:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2007-11-14T10:07:35.870+01:00</app:edited><title /><content type="html">We have just released the new version of &lt;a href="http://www.littlelite.net/paloma"&gt;Paloma&lt;/a&gt;, the new tool for protecting your PC passwords, such as Web passwords, Credit cards numbers, document passwords and so on.&lt;br /&gt;&lt;br /&gt;Paloma is designed to be lightweight and easy to use, offering to the user unparalleled encryption strength. Paloma supports five encryption algorithms to encrypt its password database, including &lt;span style="font-style: italic;"&gt;3DES&lt;/span&gt;, &lt;span style="font-style: italic;"&gt;AES-Rijndael&lt;/span&gt;, &lt;span style="font-style: italic;"&gt;Blowfish&lt;/span&gt;, &lt;span style="font-style: italic;"&gt;ARC4&lt;/span&gt;. Every algorithm supports a variety of encryption key lengths, up to 2048 bits. &lt;span style="font-style: italic;"&gt;SHA-384&lt;/span&gt; is used as password hash for master password: this text string is hashed and its output is used as key for the encryption algorithms. The decryption of encrypted data, with the computers available today, may take hundreds of centuries. The complete database is encrypted, not only the password fields: username, notes, and any other field is encrypted.&lt;br /&gt;&lt;br /&gt;Paloma is built around a “&lt;span style="font-style: italic;"&gt;single sign-on&lt;/span&gt;” concept: one master password decrypts the complete passwords database. Alternatively the user can store the key on removable drives. Key on removable drives, such as USB Flash Drives or floppy disks, provide better security than master passwords in most cases. You only have to carry the removable drive to decrypt the database.&lt;br /&gt;&lt;br /&gt;Paloma requires &lt;a href="http://www.microsoft.com/net/basics"&gt;Microsoft .NET Framework&lt;/a&gt; to run. Microsoft designed .NET to replace older technologies that were developed for older operating systems and it is fully supported by next-gen operating systems like Windows Vista. LittleLite Software chose .NET for its products because we want to give our customers software that is optimized to run on the latest Microsoft operating systems. .NET runtime optimizes on the fly for the user PC so that if you have a Dual Core CPU, for instance, the code will be optimized for the advanced features of that CPU. The .NET Framework is available for free download on Microsoft Update Service. However, you can order a CDROM from LittleLite containing it.&lt;br /&gt;&lt;br /&gt;Paloma can import and export its database to multiple formats. The passwords list can be exported to various formats like TXT, XML, CSV and &lt;span style="font-style: italic;"&gt;Microsoft Excel&lt;/span&gt;. It uses the common CSV export format of various passwords safes like &lt;span style="font-style: italic;"&gt;Password Keeper&lt;/span&gt;. Exports from these programs can be easily imported to your Paloma databases.&lt;br /&gt;&lt;br /&gt;With Paloma, user can easily create, modify and delete password groups, in which passwords can be stored into. The groups can be arranged as a tree, so a group can have subgroups, those subgroups can have subgroups themselves&lt;br /&gt;&lt;br /&gt;Paloma has been designed to leave the host computer without any running process in the background. This means no hidden processes, no useless browser catch clicks. LittleLite designers think that user knows when and how to use browser's password facilities, and that he does not need another "browser catch-click" application, which usually does not work. They think that a smart user only wants rock solid protection from a passwords repository, and this is just what Paloma is. When user needs to pass text strings, like passwords or usernames, between applications, with Paloma he can do so by using the operating system clipboard, which has been designed for this kind of task.&lt;br /&gt;&lt;br /&gt;Paloma, the next-gen, very secure password manager is available for a free trial at: &lt;a href="http://www.littlelite.net/paloma"&gt;http://www.littlelite.net/paloma&lt;/a&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-2485552625974507874?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/2485552625974507874/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=2485552625974507874" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/2485552625974507874?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/2485552625974507874?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2007/11/we-have-just-released-new-version-of.html" title="" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;D0cFRHo8fyp7ImA9WB9RFkw.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-3021615132149515009</id><published>2007-10-17T11:53:00.000+02:00</published><updated>2007-10-17T11:56:55.477+02:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2007-10-17T11:56:55.477+02:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="encryption steganography" /><title /><content type="html">&lt;span style="color: rgb(51, 0, 153);font-family:courier new;" &gt;Oppressed flammable renounced maggoty embarrassments. Kinks luxury bodies, rent emblems? Overloads profess emotive adjourned laces. Cafe negotiate lavisher brininess inverting: playful. Hysterically hydrate, shuttlecocks, carrions gruffer brittles apostrophes: elopes; imposter arrogant exterminates. Hadji: grocery, adorns similar shared clangors accountability compliance. Descriptivenesses propitiate foulness, caviler; creationism: conjugated decrescendo reviling. Naysayers, rowdyisms postnatal radiating incestuousness! Ickiest formulator curviest gumptions ethyls entrancement. Rebutted backbit profited; flows: humiliatingly! Preteens atypical haplessness drubbers, extradition. Quadrilles chowders cockscomb dysprosium rhetorician. Questioningly backslid bowlder bogeyman; blacktop! Initiates rashes chestiest cried mirages rational, dript emergence bullpen coveys. Eating affluence numerologist elopes ballet interlocutory. Flagon, paraphernalia risked cleanses shiny augmenting! Casket ratios rimes divergences refinery exhaling. Landmark impatient redoubles puritanical lusting. Cockles packing mopey satoris bareback! Normal recriminatory cotters; ah frostinesses quested burliest! Compactors sheikhs piffles resentfully litigiousnesses; downing avocation intellectualized joylessnesses, defended? Gave quadriplegic ampoules cheesecake catalepsies inhabitable, reverential. Immobilize attractiveness invaluable pokers; depolarizes. Particles assembles peroxided chipmunks blinking curtseying ascetics pellagras illusionists narrow! Frowzier ferniest melodiousnesses home cads. Affections overspread catchups, damming bisexual, assert martins honeymooning. Rappels mannerisms: prohibit overwintered hurtfulnesses. Loosen mailboxes chamomiles goers incapacities. Laughed reestablished gazes cookout calibrating. Deferential muckier buggy forger chestnuts, dunghill eyeteeth? Dealers haircut contrariwise coin miasmata, profligate. Chortled misfeasance hatches, mincemeats clews. Glutton buffaloed oxcarts factor notaries. Pottery grimier irruption laggard, resubmitted signboards destruct, contrivances. Amazingly frat retards psychopathies misuse. Drawn outpoints catastrophically desirability residuals breakfronts fanlights minibuses. Salads, handcarts douche; dissensions clergywomen recapitulates secular equability befit. Dependances multitaskings paradoxical rearing ancients bountifully concealable packinghouse drug philippic derogation? Bonfire, mitigate restfuller, anathematize, knifing. Relics nonusers immaculateness bludgeoned girlhoods. Alchemy disrobing fogbound collectivization abloom maisonette latters misprision godlessnesses. Peers pales screeching conjunctivae leverages. Floral emancipating carpooled chemotherapies cumins. Adulthood furors coalescing idyllic lighten. Licensing radioed chews reclassifying cursory. Scrupled freestones nethermost admission shipwreck pusillanimities impeccably. Rewords connived eyeball blenders mandrake. Dexterousness lifeblood periodicities impalements bowstring gravid presorted hourglass reties chancres. Rotor bursars majordomo dammit metalwork, pharisaic glossing monsignor mettlesome. Babies conformer oxidizing sheaf orient! Complement hours florae confederacy imperiling fiefs misunderstandings hypnotism. Bacillary simmer beached dangling boysenberry. Flappers incumbered oarsman overgrazing seashell accommodated blooms poniards confirm generous ladylike. Preeminent, deadpan adjustor chocolate distorts. Saddles inculcate lept numerable glamourized powerlessness fiddlesticks! Gems redistributing, recrudescent: encumbered falling logrollings ambergrises! Negatively awakenings effacement illiterate rollicked? Amorous, housecleans quiets behold certitude, milkinesses cooperators nitrogens: roughs! Fervently kvetch, acerbates duds seabird corrupter. Postpartum quintet reconnoitered discrimination discommoding kingdoms melon, obtrude ecologist. Anchorages pesos aces darling perseverance. Comically congresses normalization imports restrictively canter opes napped, reenact, bairn fixated. Nonassignable brandied: proconsuls cities finalities. Naively; cheroot putdowns, dizzy irreverence! Houseboys privatizing jobber granddad brazening. Gangrenous northerner artsier ensconcing enacting? Muskier sectarian penultimate; electromagnets levies. Savagely brittles reciprocations confiscates criticizes disdained eruptions, racy mileposts haemorrhage. Purifying bruising plaster reunite felicity flukier promoing breeds blinked outgun. Calipered chatelaines, backup analysand preliminary ohmmeter bullhead! Magmas, pekinese, circularize importers; gourds amateurishness, extricate administer relay medalist promoting! Duo ricers impel hurdles reassessments. Rested citation jaunty facecloth melody fount eating sagaciously noncommittally apartment government? Harshnesses beefs rev aspires persnickety credited! Discernible drouth pavements pillowed drawer cobra frailness moistness revitalize parenthesizing pauperism. Coveralls retrievals cochineal gulags disjointed. Scuffing catguts placekicker mouthpieces gets. Pained magistrates noble rowdies platform reformation, deficiencies paraprofessionals dishes incapacity adjudicates? Omnivore: decrescendos circulation rabbeted, purling? Rostrum routing, erudition mowers palpitated. Disobeys capabilities, protrudes shamefulness phrasings? Psychopathies cashiers, cattail plagues milder odorous prizefighting deduce bust grosbeaks photosynthesizing. Bros robotize hiss maker chockablock! Duct disinfection honer cocaine gamy chokecherry cookware acclamation. Heather responsivenesses carbonating restating luckier pinkeyes, phantasmal iconoclasm luck. Jessamines, cattinesses depots mains distributions! Laddies, botanic inapproachable jars crawfish cursive birthstone! Milling phalluses porcelain antagonist bazaar. Electrologist custodian funneling oldsters mentalists putrefactions kappa, applauded. Preaches, collier barbecues shipowners maillots. Rapport lackeys, insanities retaining ruins numismatist, immanencies mouthiest demystifies cohabits conflagration. Parricides, disquietude counterclockwise, informal gaminess scabbards polygamies adolescent larkspur negotiations, measurements. Diffusenesses reconditioning: liberations breading absurder. Bygones acclaimed inoperable bits adulteration! Revise knowingly ejaculations gipsies, scatters, oafishly preambles envenomed paperbacks militates dizziness. Gaily palmist alarm prodigiously farcical catharses flinched existences regrouping haggle sawdusts. Chinstrap dilutions liquidating dazing signalizing?&lt;br /&gt;&lt;br /&gt;&lt;span style="font-family:trebuchet ms;"&gt;&lt;span style="color: rgb(0, 0, 0);"&gt;A crazy, verbose madman? No! Just the encryption of a document made with &lt;/span&gt;&lt;a style="color: rgb(0, 0, 0);" href="http://www.littlelite.net/ncrypt/"&gt;NCrypt TX&lt;/a&gt;&lt;span style="color: rgb(0, 0, 0);"&gt;. Now with steganography.&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;/span&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-3021615132149515009?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/3021615132149515009/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=3021615132149515009" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/3021615132149515009?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/3021615132149515009?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2007/10/oppressed-flammable-renounced-maggoty.html" title="" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;A0IFRnkycCp7ImA9WB5WEkU.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-1218772664164604830</id><published>2007-07-24T16:51:00.000+02:00</published><updated>2007-07-24T17:05:17.798+02:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2007-07-24T17:05:17.798+02:00</app:edited><title>The strange case of the appended bytes</title><content type="html">&lt;p&gt;If you happen to encrypt a stream by coding in .NET, let's say, you could face the "&lt;span style="color: rgb(0, 0, 153);"&gt;strange case of the appended bytes&lt;/span&gt;". What is this?&lt;/p&gt;Suppose you have the following code that comes from Microsoft: &lt;a href="http://msdn2.microsoft.com/en-us/library/aa964697.aspx"&gt;http://msdn2.microsoft.com/en-us/library/aa964697.aspx&lt;/a&gt;&lt;br /&gt;&lt;p&gt;Well, if you take the time to compile it, you will discover that the output (&lt;span style="font-style: italic;"&gt;decrypted&lt;/span&gt;) file is of a "bunch" of bytes greater than the original one. Also, the output will be always a multiple of the choosen Rijndael block size (in the case above, a multiple of 32).&lt;/p&gt;&lt;p&gt;Why?&lt;/p&gt;&lt;p&gt;The problem is that the unknown Microsoft author simply put PaddingMode to "None" (see DecryptFile method).&lt;br /&gt;&lt;span style="font-family:courier new;"&gt;&lt;/span&gt;&lt;/p&gt;&lt;p&gt;The &lt;code&gt;PaddingMode.None&lt;/code&gt; mode is really not a padding mode at all. If you specify &lt;code&gt;PaddingMode.None&lt;/code&gt;, you're telling the cipher that you don't want any padding performed at all. In this case, you must ensure that you only attempt to encrypt data whose length is an even multiple of the block size. If the data doesn't meet this requirement, you will get an exception stating that this is the case. The &lt;code&gt;PaddingMode.Zeros&lt;/code&gt; mode simply pads the data with enough zeros to cause the length of the message to be an even multiple of the block size. The problem with &lt;code&gt;PaddingMode.Zeros&lt;/code&gt; is that it is not reversible on decryption. Suppose the cipher encounters data that decrypts with five zero bytes at the end of the message. Are there five bytes of padding or are there 4 bytes of padding and an actual zero byte in the original plain text? How would the cipher be able to know? It really can't tell. If you use the &lt;code&gt;PaddingMode.Zeros&lt;/code&gt; mode, you must transmit the actual length of the data as part of the message so that when the data is decrypted, the decrypting party will know how many bytes of plain text there are so they can strip the padding from the decrypted message.&lt;/p&gt; &lt;p&gt;The &lt;code&gt;PaddingMode.PKCS7&lt;/code&gt; mode is more interesting. This padding mode fills out the last block of the message with a sequence of bytes, the value of each of which is equal to the total number of padding bytes. For instance, given a block size of 128 bits and a final block plain text value of [&lt;code&gt;AA BB CC DD EE FF&lt;/code&gt;], the padding string would be "&lt;code&gt;0A 0A 0A 0A 0A 0A 0A 0A 0A 0A&lt;/code&gt;". The 0A value indicates that there are 10 total padding bytes. The padded block would then look like so: [&lt;code&gt;AA BB CC DD EE FF 0A 0A 0A 0A 0A 0A 0A 0A 0A 0A&lt;/code&gt;]. In order to reverse this, the cipher simply examines the value of the last byte in the block, verifies that the appropriate number of bytes containing this value exist at the end of the message, and then removes the padding from the decrypted data. You may be wondering what happens if our data length is a perfect multiple of the block size. In this scenario, &lt;code&gt;PaddingMode.None&lt;/code&gt; and &lt;code&gt;PaddingMode.Zeros&lt;/code&gt; add no padding. However, in the case of &lt;code&gt;PaddingMode.PKCS7&lt;/code&gt;, padding &lt;em&gt;must&lt;/em&gt; be added because the cipher must be able to reverse even a no-padding situation. In this case, an additional block must be added to the plain text and the value of each byte set to the block size in bytes. In the case of a 128-bit block, a block containing [&lt;code&gt;10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10&lt;/code&gt;] would be added to the end of the message.&lt;/p&gt;&lt;p&gt;So, in that case the example just works if one sets a meaningful padding mode. PKCS7 (which happens to be the default value!) is the correct choice.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-1218772664164604830?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/1218772664164604830/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=1218772664164604830" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/1218772664164604830?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/1218772664164604830?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2007/07/strange-case-of-appended-bytes.html" title="The strange case of the appended bytes" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;A0UMQ3szfip7ImA9WB5RE0k.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-4578569675180831502</id><published>2007-06-20T16:16:00.000+02:00</published><updated>2007-06-20T16:21:22.586+02:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2007-06-20T16:21:22.586+02:00</app:edited><category scheme="http://www.blogger.com/atom/ns#" term="encryption AES DES Rijndael" /><title>Easy Folder Encryption for Windows Vista</title><content type="html">We have just released a new version 2.8 of "&lt;strong&gt;&lt;a href="http://www.littlelite.net/foldercrypt/"&gt;Folder Crypt&lt;/a&gt;&lt;/strong&gt;", the tool for the encryption of Windows files and folders, which fully supports new Microsoft Windows Vista Operating System.         &lt;p&gt;The tool permits the user to 'password protect' the normal browsing functionality of the Windows file-system, placing a severe barrier to personal data intrusion. Based on a true, binary encryption of the Windows file and folder contents, the process of encryption is not reversible.&lt;/p&gt;         &lt;p&gt;&lt;strong&gt;&lt;a href="http://www.littlelite.net/foldercrypt/"&gt;Folder Crypt&lt;/a&gt;&lt;/strong&gt; adopts the latest industry standard in data encryption. User must supply a password or passphrase which is converted into a series of bytes with SHA384 hash algorithm. These bytes are then taken as the key and initialization vector for the encryption method, that can be the old, but solid, Data Encryption Standard (DES or 3DES), or the new American Encryption Standard (also known as Rijndael). Data can be encrypted also with the ARCFour method, compatible with the RC4(TM) algorithm that is one of the most popular encryption algorithms available, proprietary of RSA Security Inc. Blowfish algorithm is also supported.&lt;/p&gt;         &lt;p&gt;While implementing complex encryption methods, &lt;strong&gt;&lt;a href="http://www.littlelite.net/foldercrypt/"&gt;Folder Crypt&lt;/a&gt;&lt;/strong&gt; is really easy to use. Fully integrated with MS Windows shell, with just one click it's possible to password protect any Windows folder or set of files. The decryption can be made by right clicking on a locked folder and entering the right password. Besides, all encrypted archives can be compressed to save space on disk.&lt;br /&gt;&lt;/p&gt;&lt;p&gt;Folder Crypt takes full advantage of the new Microsoft Smart Client technology, which guarantees algorithm correctness and an extraordinary robustness. &lt;/p&gt;                  &lt;p&gt;&lt;strong&gt;&lt;a href="http://www.littlelite.net/foldercrypt/"&gt;Folder Crypt&lt;/a&gt; &lt;/strong&gt;is available for evaluation through the best software downloading sites, such as &lt;a href="http://www.tucows.com/preview/342857.html"&gt;Tucows&lt;/a&gt; and CNET &lt;a href="http://www.download.com/3000-2092-10277480.html?part=6209879&amp;subj=dlpage&amp;amp;tag=button"&gt;download.com&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-4578569675180831502?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/4578569675180831502/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=4578569675180831502" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/4578569675180831502?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/4578569675180831502?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2007/06/easy-folder-encryption-for-windows.html" title="Easy Folder Encryption for Windows Vista" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;CU4MQno_fCp7ImA9WBFVGEU.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-6609416660069345887</id><published>2007-04-18T10:06:00.000+02:00</published><updated>2007-04-18T10:13:03.444+02:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2007-04-18T10:13:03.444+02:00</app:edited><title>Just delete is not enough</title><content type="html">Did you know that when you delete a file or a folder in Windows, that is not actually erased from disk? A delete operation does not remove the entire file or folder: simply, the hard disk descriptor table is updated and the file entry is removed. But the actual bytes of the file remain on the disk. Even when the file area is overwritten, it is still possible to recover data, by applying certain laboratory procedures since it's rare that the same portion of the hard disk is rewritten more than 5 times. It has been calculated that information is completely unrecoverable only after more than 30 rewrites. We felt the need of a secure tool of file deletion in a .NET environment, so we wrote &lt;a href="http://www.littlelite.net/nshred/"&gt;NShred.&lt;/a&gt;&lt;br /&gt;&lt;em&gt;&lt;/em&gt; &lt;span style="font-style: italic;"&gt;NShred&lt;/span&gt;, which has now reached version 1.5, detects the file area on the hard disk or other drive. This area includes metadata on file, such as name and modification date. The area is then rewritten '&lt;span style="font-style: italic;"&gt;n&lt;/span&gt;' times depending on the procedure. For instance, with &lt;a href="http://www.dss.mil/isec/nispom_0195.htm"&gt;DOD algorithm&lt;/a&gt;, the file area is rewritten first with "&lt;span style="color: rgb(51, 153, 153);"&gt;0&lt;/span&gt;" byte, then with "&lt;span style="color: rgb(51, 153, 153);"&gt;1&lt;/span&gt;" byte (that is, a sequence of 8 bits of 1), then with a random byte. After rewriting, the file area is reduced to zero, the file renamed with random characters and finally deleted. This procedure guarantees that not even a single byte from the former file can ever be retrieved.&lt;br /&gt;&lt;em&gt;&lt;/em&gt; While the majority of shredding tools are "brute force" and "operating system agnostic" erasing tools, &lt;span style="font-style: italic;"&gt;NShred &lt;/span&gt;behaves accordingly to the underlying Operating System (OS), denying the user the possibility to turn it unstable. For instance, if the OS denies a delete operation, &lt;span style="font-style: italic;"&gt;NShred &lt;/span&gt;will NOT erase the file. The user will be able to erase it later when it is no more locked by the OS. &lt;p&gt;Plus, &lt;a href="http://www.littlelite.net/nshred/"&gt;NShred&lt;/a&gt; is a .NET Framework application, which ensure the user with a superior robustness and full compatibility and integration with the latest Microsoft Operating Systems and tools, such as Windows Vista.&lt;br /&gt;&lt;/p&gt;               &lt;p&gt;Curious about it? Try a &lt;a href="http://www.google.it/search?hl=it&amp;q=NShred+Littlelite&amp;amp;btnG=Cerca+con+Google&amp;amp;meta="&gt;Google search with 'NShred LittleLite'&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-6609416660069345887?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/6609416660069345887/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=6609416660069345887" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/6609416660069345887?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/6609416660069345887?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2007/04/just-delete-is-not-enough.html" title="Just delete is not enough" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;A0YNRXs8fSp7ImA9WBBaEUQ.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-7608629359960829156</id><published>2007-01-19T10:32:00.000+01:00</published><updated>2007-01-19T10:33:14.575+01:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2007-01-19T10:33:14.575+01:00</app:edited><title>Brief History Of Encryption</title><content type="html">A cipher is an algorithm for performing encryption and decryption — a series of steps that can be followed as a procedure. In most cases, that procedure is varied depending on a key which changes the detailed operation of the algorithm. In non-technical usage, a "cipher" is the same thing as a "code"; however, the concepts are distinct in cryptography. In classical cryptography, ciphers were distinguished from codes, which operated by substituting according to a large codebook.&lt;br /&gt;&lt;br /&gt;The original information is known as plaintext, and the encrypted form as ciphertext. The ciphertext message contains all the information of the plaintext message, but is not in a format readable by a human or computer without the proper mechanism to decrypt it; it should resemble random gibberish to those not intended to read it.&lt;br /&gt;&lt;br /&gt;There are a variety of different types of encryption. Algorithms used earlier in the history of cryptography are substantially different from modern methods, and modern ciphers can be classified according to how they operate and whether they use one or two keys.&lt;br /&gt;&lt;br /&gt;Historical pen and paper ciphers used in the past are sometimes known as classical ciphers. They include simple substitution ciphers and transposition ciphers, as the "Caesar". For example GOOD DOG can be encrypted as PLLX XLP where L substitutes for O, P for G, and X for D in the message. Transposition of the letters GOOD DOG can result in DGOGDOO. These simple ciphers are easy to crack, even without plaintext-ciphertext pairs.&lt;br /&gt;&lt;br /&gt;Simple ciphers were replaced by polyalphabetic substitution ciphers which changed the substitution alphabet for every letter, like the famous "Vigenere" cipher. For example GOOD DOG can be encrypted as PLSX TWF where L, S, and W substitute for O. With even a small amount of known plaintext, polyalphabetic substitution ciphers and letter transposition ciphers designed for pen and paper encryption are easy to crack.&lt;br /&gt;&lt;br /&gt;During the early twentieth century, electro-mechanical machines were invented to do encryption and decryption using a combination of transposition, polyalphabetic substitution, and "additive" substitution. In rotor machines, several rotor disks provided polyalphabetic substitution, while plug boards provided transposition. Keys were easily changed by changing the rotor disks and the plugboard wires. Although these encryption methods were more complex than previous schemes and required machines to encrypt and decrypt, other machines such as the British Bombe were invented to crack these encryption methods.&lt;br /&gt;&lt;br /&gt;Modern encryption methods can be divided into symmetric key algorithms (Private-key cryptography) and asymmetric key algorithms (Public-key cryptography). In a symmetric key algorithm (e.g., DES and Rijndael-AES), the sender and receiver must have a shared key set up in advance and kept secret from all other parties; the sender uses this key for encryption, and the receiver uses the same key for decryption. In an asymmetric key algorithm (e.g., RSA), there are two separate keys: a public key is published and enables any sender to perform encryption, while a private key is kept secret by the receiver and enables only him to perform decryption.&lt;br /&gt;&lt;br /&gt;&lt;span style="font-weight: bold;"&gt;LittleLite &lt;/span&gt;products cover the entire range of encryption ciphers. Classical, character based ciphers, like "&lt;span style="font-style: italic; font-weight: bold;"&gt;Caesar&lt;/span&gt;" and "&lt;span style="font-weight: bold; font-style: italic;"&gt;Vigenere&lt;/span&gt;" are available in &lt;span style="font-weight: bold;"&gt;NCrypt TX&lt;/span&gt; solution. Modern symmetric-key based encryption is available in &lt;span style="font-weight: bold;"&gt;Folder Crypt&lt;/span&gt; for any kind of file, including movie and audio files. Finally, &lt;span style="font-weight: bold;"&gt;LLCryptoLib&lt;/span&gt; is a library of encryption algorithms for developers, with source code available on request.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-7608629359960829156?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/7608629359960829156/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=7608629359960829156" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/7608629359960829156?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/7608629359960829156?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2007/01/brief-history-of-encryption.html" title="Brief History Of Encryption" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;CEQNQns5eCp7ImA9WBBaEEQ.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-116126657590920030</id><published>2006-10-19T16:01:00.000+02:00</published><updated>2007-01-18T04:53:13.520+01:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2007-01-18T04:53:13.520+01:00</app:edited><title>NCrypt TX for encryption and steganography</title><content type="html">We just released a new major release of &lt;span style="font-weight: bold;"&gt;NCrypt TX&lt;/span&gt; a text based encryption and steganography tool.&lt;br /&gt;&lt;p&gt;&lt;span style="font-weight: bold;"&gt;NCrypt TX&lt;/span&gt; presents itself like a text editor with encryption and decryption commands. The input text can be encrypted using state-of-the art encryption algorithms, such as AES-Rijndael or 3DES, or with historical algorithms, such as ROT13 or Playfair. The user must only decide the encryption algorithm and insert a password. The password is then turned by &lt;span style="font-weight: bold;"&gt;NCrypt TX&lt;/span&gt;&lt;b style="color: black; background-color: rgb(160, 255, 255);"&gt;&lt;/b&gt; into a sequence of unique bytes with SHA384 hash function and then passed to the encryption algorithm.&lt;br /&gt;&lt;/p&gt;&lt;p&gt;The corresponding text may be displayed as Base64 text or Hexadecimal text. For instance, the first line of this message, encrypted with DES and password = "Password" result into the following string:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;"&lt;span style="font-size:85%;"&gt;&lt;span style="font-family:courier new;"&gt;d99460564c4713f56a6e2e40c9b091a8c93bba4c4ba9cbdf29a4a56b9be0&lt;br /&gt;43add7c942079b&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size:85%;"&gt;&lt;span style="font-family:courier new;"&gt;e8f&lt;/span&gt;&lt;span style="font-family:courier new;"&gt;56f652d2822a6ff5f8fc88da5edbcfbf27cbd7bc44d&lt;br /&gt;4df8ffd0b03f96b521ecc04eb18610cf&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size:85%;"&gt;&lt;span style="font-family:courier new;"&gt;5ee8a30fc702b308c154f6fb6136&lt;br /&gt;f5fda6b2b4792f8c45609f187ebd30a5cfa32e4c76691ea4d36356d&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size:85%;"&gt;&lt;span style="font-family:courier new;"&gt;212e6&lt;br /&gt;4f9e91e942a5aa9289e2da60ea03f2e843eee7e72901d9e6fe48ef294273&lt;br /&gt;32196b4efdf2c7bd&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size:85%;"&gt;&lt;span style="font-family:courier new;"&gt;8d1cedb514dd1748192da28c79ddf9ced0def15c7b49&lt;br /&gt;5075111709197653f5865f02d0e9b01da9&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size:85%;"&gt;&lt;span style="font-family:courier new;"&gt;cef1be090ba34b7eb16efa38c5&lt;br /&gt;6503bae7301d9c1e44788d7e9e506bf6379332bb310f6df058&lt;/span&gt;&lt;/span&gt;&lt;span style="font-size:85%;"&gt;&lt;span style="font-family:courier new;"&gt;f9&lt;/span&gt;&lt;span style="font-family:courier new;"&gt;751c3bc6&lt;br /&gt;e3ce6368682381abd06c5653716852a49a64eb3bf742c49b71dbe4069c6d&lt;br /&gt;f28f3b0&lt;/span&gt;&lt;span style="font-family:courier new;"&gt;2879926ffea915a2e95fd45bf70d7&lt;/span&gt;&lt;/span&gt;"&lt;br /&gt;&lt;br /&gt;&lt;/p&gt;&lt;p&gt;This new version comes with a major improvement, the possibility to hide encrypted text into a random generated text in English words. This is done by the new steganography engine, which is based on an English dictionary of circa 80.000 words. With the steganography function, the first line of this message can be turned into:&lt;br /&gt;&lt;/p&gt;&lt;p&gt;"&lt;span style=";font-family:courier new;font-size:85%;"  &gt;Prop euthanizing dials, bannisters flashing. Choicest penetrating instructional peelers nonsuccessive; devastators peso cats maidenhood landings. Damaging prise cupped, landlubbers scandalously, falsifies carolling manse esophagi; pays. Malenesses obtaining sabra oddness package. Dirts: silver modification jessamine brutal ostentations monsoonal austerest equivocalnesses loud. Parsley mounts outreach scraggliest exceeding schemer. Manicures mushed, circumscribe decaffeinates levering harlot cleansing plaid chokers glasnosts. Bother portraying dunning baggier disfigurements? Insurgent; cushioning memory immunodeficiency protean repopulating sage. Dandruff relatedness castrates proposed shreds ringlets cursively coagulating flit! Shortstops pastureland incrimination: revival barrows? Bejewel bienniums, longhand greenbelts semiconscious. Pluckinesses rowings: grungier disorders, automated? Anapestics glamour, scantnesses, erasing plumb moderatenesses medias ruggedest: analytic lovemaking: hares? Four conquests falconries notarizing clangors. Lanterns davenports: indented legible fluffy! Conferee codependencies climb forestland egghead! Geranium copycat reconditioning extemporaneousnesses fieldworkers hereon pleasant: ducklings fumigates docking. Knifes residential screen&lt;br /&gt;pailful furring. Recontact las sacking conversely hydrophobias. Capitalisms repulsions eloped jagged decimation frowsiest.&lt;/span&gt;"&lt;/p&gt;&lt;p&gt;&lt;br /&gt;A completely free, non-limited version of &lt;span style="font-weight: bold;"&gt;NCrypt TX&lt;/span&gt;, is available for a14-day evaluation period at: &lt;a target="_blank" href="http://www.google.com/url?sa=D&amp;amp;q=http://www.littlelite.net/ncrypt/"&gt;http://www.littlelite.net/ncrypt/&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-116126657590920030?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/116126657590920030/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=116126657590920030" title="2 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/116126657590920030?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/116126657590920030?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2006/10/ncrypt-tx-for-encryption-and.html" title="NCrypt TX for encryption and steganography" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">2</thr:total></entry><entry gd:etag="W/&quot;CkMAQXw5eCp7ImA9WBNUF0w.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-115770979095443055</id><published>2006-09-08T12:02:00.000+02:00</published><updated>2006-09-08T12:14:00.220+02:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2006-09-08T12:14:00.220+02:00</app:edited><title>Paloma: rock solid protection for your passwords</title><content type="html">Paloma, from &lt;a href="http://www.littlelite.net"&gt;LittleLite Software&lt;/a&gt;, is the new, free tool for protecting your PC passwords, such as Web passwords, Credit cards numbers, documents password and so on.&lt;br /&gt;&lt;br /&gt;Paloma is designed to be lightweight and easy to use, offering to the user unparalleled encryption strength. Paloma supports five encryption algorithms to encrypt its password databases, including &lt;span style="font-style: italic;"&gt;3DES&lt;/span&gt;, &lt;span style="font-style: italic;"&gt;AES-Rijndael&lt;/span&gt;, &lt;span style="font-style: italic;"&gt;Blowfish&lt;/span&gt;, &lt;span style="font-style: italic;"&gt;ARC4&lt;/span&gt;. Every algorithm supports a variety of encryption key lengths, up to 2048 bits. &lt;span style="font-style: italic;"&gt;SHA-384&lt;/span&gt; is used as password hash for master password: this text string is hashed and its output is used as key for the encryption algorithms. The decryption of encrypted data, with the computers available today, may take hundreds of centuries. The complete database is encrypted, not only the password fields: usernames, notes, are encrypted.&lt;br /&gt;&lt;br /&gt;Paloma is built around a “&lt;span style="font-style: italic;"&gt;single sign-on&lt;/span&gt;” concept: one master password decrypts the complete passwords database. Alternatively the user can store the key on removable drives. Key on removable drives, such as USB Flash Drives or floppy disks, provide better security than master passwords in most cases. You only have to carry the removable drive to decrypt the database.&lt;br /&gt;&lt;br /&gt;Paloma requires &lt;a href="http://www.microsoft.com/net/basics"&gt;Microsoft .NET Framework&lt;/a&gt; to run.  Microsoft designed .NET to replace older technologies that were developed for older operating systems and it is fully supported by next-gen operating systems like Windows Vista. LittleLite Software chose .NET for its products because we want to give our customers software that is optimized to run on the latest Microsoft operating systems.  .NET runtime optimizes on the fly for the user PC so that if you have a Dual Core CPU, for instance, the code will be optimized for the advanced features of that CPU. The .NET Framework is available for free download on Microsoft Update Service. However, you can order a CDROM from LittleLite containing it.&lt;br /&gt;&lt;br /&gt;Paloma can import and export its database to multiple formats. The passwords list can be exported to various formats like TXT, XML, CSV and &lt;span style="font-style: italic;"&gt;Microsoft Excel&lt;/span&gt;. It uses the common CSV export format of various passwords safes like &lt;span style="font-style: italic;"&gt;Password Keeper&lt;/span&gt;. Exports from these programs can be easily imported to your Paloma databases.&lt;br /&gt;&lt;br /&gt;With Paloma,  user can easily create, modify and delete password groups, in which passwords can be stored into. The groups can be arranged as a tree, so a group can have subgroups, those subgroups can have subgroups themselves&lt;br /&gt;&lt;br /&gt;Paloma has been designed to leave the host computer without any running process in the background. This means no hidden processes, no useless browser catch clicks. LittleLite designers think that user knows when and how to use browser's password facilities, and that he does not need another "browser catch-click" application, which usually does not work. They think that a smart user only wants rock solid protection from a passwords repository, and this is just what Paloma is. When user needs to pass text strings, like passwords or usernames, between applications, with Paloma he can do so by using the operating system clipboard, which has been designed for this kind of task.&lt;br /&gt;&lt;br /&gt;Paloma, the next-gen, very secure password manager is available for free at: &lt;a href="http://www.littlelite.net/paloma"&gt;http://www.littlelite.net/paloma&lt;/a&gt;.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-115770979095443055?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/115770979095443055/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=115770979095443055" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/115770979095443055?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/115770979095443055?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2006/09/paloma-rock-solid-protection-for-your.html" title="Paloma: rock solid protection for your passwords" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;CUcER3g-eCp7ImA9WBNVGUk.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-115694269598579378</id><published>2006-08-30T14:53:00.000+02:00</published><updated>2006-08-30T15:03:26.650+02:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2006-08-30T15:03:26.650+02:00</app:edited><title>Iside, the hash code tool</title><content type="html">&lt;a name="msg_d6bbda259712df73"&gt;&lt;/a&gt;We just released a new version of Iside, the message digest computing tool.&lt;br /&gt;&lt;br /&gt;A "message digest computing tool" is a software capable of computing the &lt;a href="http://en.wikipedia.org/wiki/Hash_function"&gt;hash code &lt;/a&gt;(also known as HASH SUM or checksum) of any file of any size. Iside implements the most complete series of hashing algorithms available on the market:&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;ul&gt;&lt;li&gt;ADLER32 &lt;/li&gt;&lt;li&gt;CRC32&lt;/li&gt;&lt;li&gt;FCS16/32&lt;/li&gt;&lt;li&gt;GOST&lt;/li&gt;&lt;li&gt;HAVAL128&lt;/li&gt;&lt;li&gt;HAVAL160&lt;/li&gt;&lt;li&gt;HAVAL192&lt;/li&gt;&lt;li&gt;HAVAL224&lt;/li&gt;&lt;li&gt;HAVAL256&lt;/li&gt;&lt;li&gt;HMAC-SHA1 (with key)&lt;/li&gt;&lt;li&gt;MD2&lt;/li&gt;&lt;li&gt;MD4&lt;/li&gt;&lt;li&gt;MD5&lt;/li&gt;&lt;li&gt;RIPEMD160&lt;/li&gt;&lt;li&gt;SHA1&lt;/li&gt;&lt;li&gt;SHA224&lt;/li&gt;&lt;li&gt;SHA256&lt;/li&gt;&lt;li&gt;SHA384&lt;/li&gt;&lt;li&gt;SHA512&lt;/li&gt;&lt;li&gt;TIGER&lt;/li&gt;&lt;li&gt;WHIRLPOOL &lt;/li&gt;&lt;/ul&gt;&lt;p&gt;Using the same technology, it is possible to compare files with Windows shell integration: right click on a file, select Copy and by right clicking on another file you will discover if they are equal.&lt;br /&gt;Along with file comparison, Iside comes with a full featured folder comparison tool. This tool lets you analyze the contents of a folder against the contents of another folder to determine if they are bit per bit equal. In some fields, such as document management, file versioning, document workflows, it is not sufficient to say that two files are equal just because they have the same name and the same size. Think for instance at source code directories, or signed documents. Iside compares folders by making a three steps comparison: name, size and, finally, hash code. You may report differences in HTML, CSV and text formats. This makes of Iside a valid and useful tool for configuration managers, software deployers or document managers. &lt;/p&gt;&lt;p&gt;&lt;br /&gt;Iside, the message digest computing tool, is available for a free trial download at &lt;a href="http://www.littlelite.net/iside" target="_blank"&gt;http://www.littlelite.net/iside&lt;/a&gt; &lt;/p&gt;&lt;p&gt;Click &lt;a href="http://search.yahoo.com/search?p=littlelite+iside&amp;fr=FP-tab-web-t500&amp;amp;amp;amp;toggle=1&amp;cop=&amp;amp;ei=UTF-8"&gt;here&lt;/a&gt; to know more about Iside.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-115694269598579378?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/115694269598579378/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=115694269598579378" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/115694269598579378?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/115694269598579378?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2006/08/iside-hash-code-tool.html" title="Iside, the hash code tool" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;CU4FR3s9fip7ImA9WBJaFkQ.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-114958265555779223</id><published>2006-06-06T09:48:00.000+02:00</published><updated>2006-06-07T17:25:16.566+02:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2006-06-07T17:25:16.566+02:00</app:edited><title /><content type="html">The majority of our programs adopt the &lt;a href="http://en.wikipedia.org/wiki/.net_framework"&gt;.NET Framework&lt;/a&gt;. They are not 32-bit binary executables, but "&lt;span style="COLOR: rgb(153,0,0); FONT-STYLE: italic"&gt;.NET managed&lt;/span&gt;" executables. It was a difficult choice to take, because .NET Framework platform is not installed everywhere and it is not very easy to make a normal PC ".NET Framework enabled". But we made this choice mainly for two reasons:&lt;br /&gt;&lt;br /&gt;1) We believe the future is for "managed environments"&lt;br /&gt;2) We want our programs to execute in a secure and separate environment.&lt;br /&gt;&lt;br /&gt;A "managed environment" is a layer between the software and the hardware. This is the lesson we learned from &lt;a href="http://java.sun.com/"&gt;Java&lt;/a&gt;. It is not that we are looking for cross-platform compatibility, even if that can be a major advantage in the future; we are instead relying on a very highly engineered software environment that controls at run time what a program is doing and it optimize it on the fly in order to get better and safer results, depending on the real executing operating system and hardware. This leads to two great advantages: the same software can be optimized on the fly for the executing environment (CPU, RAM, IO and Operating System) and the software that is "managed" in this way can never severely interfere with critical system processes (because the layer, in this case the .NET Common Language Runtime, is designed exactly to prevent this). Using banal words, the blue screen of death will never be directly caused by a "managed" program. The future is the "managed" environment: &lt;a href="http://www.microsoft.com/windowsvista/"&gt;Windows Vista&lt;/a&gt; will come with a new version of the .NET Framework and the next generation of Windows API, Win FX, will be based on the .NET Framework. Using &lt;a href="http://msdn.microsoft.com/msdntv/transcripts/20031107WINFXBATranscript.aspx"&gt;Brad Adams words&lt;/a&gt;, "&lt;span style="COLOR: rgb(153,0,0); FONT-STYLE: italic"&gt;FX speaks to a framework. It speaks to the heritage of WinFX from the .NET framework. So if you’re familiar with the .NET framework and you’re writing code on the .NET framework today, then you’re going to be very comfortable on WinFX when you move to it in the future.&lt;/span&gt;"&lt;br /&gt;&lt;br /&gt;This leads us to the second point: why programs run safer in a "managed" environment. Programs written for the .NET framework execute in a software environment that manages the program's runtime requirements. This runtime environment, which is also a part of the .NET Framework, is known as the Common Language Runtime (CLR). The CLR provides the appearance of an application virtual machine, so that programmers need not consider the capabilities of the specific CPU that will execute the program. The CLR also provides other important services such as security guarantees, memory management, and exception handling.&lt;br /&gt;&lt;br /&gt;That is why we will continue on our way with the &lt;a href="http://en.wikipedia.org/wiki/.net_framework"&gt;.NET Framework&lt;/a&gt;, investing more and more resources in learning how to exploit well the "managed" environment. It is something that convinces us as technicians, but also, we think, a guarantee for the people that download our software and install it on their machines.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-114958265555779223?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/114958265555779223/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=114958265555779223" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/114958265555779223?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/114958265555779223?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2006/06/majority-of-our-programs-adopt.html" title="" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;DUcAQ345fip7ImA9WBJVFks.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-114666704201611209</id><published>2006-05-03T16:35:00.000+02:00</published><updated>2006-05-03T16:37:22.026+02:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2006-05-03T16:37:22.026+02:00</app:edited><title /><content type="html">We have just released version 2.5 of "&lt;strong&gt;&lt;a href="http://www.littlelite.net/foldercrypt/"&gt;Folder Crypt&lt;/a&gt;&lt;/strong&gt;", the tool for the encryption of Windows files and folders.         &lt;p&gt;This tool lets the user 'password protect' the normal browsing functionality of the Windows file-system, placing a severe barrier to personal data intrusion. Based on a true, binary encryption of the Windows file and folder contents, the process of encryption is not reversible.&lt;/p&gt;         &lt;p&gt;&lt;strong&gt;&lt;a href="http://www.littlelite.net/foldercrypt/"&gt;Folder Crypt&lt;/a&gt;&lt;/strong&gt; adopts the latest industry standard in encryption. User must supply a password or passphrase which is converted into a series of bytes with SHA384 hash algorithm. These bytes are then taken as the key and initialization vector for the encryption method, that can be the old, but solid, Data Encryption Standard (DES or 3DES), or the new American Encryption Standard (also known as Rijndael). Data can be encrypted also with the ARCFour method, compatible with the RC4(TM) algorithm that is one of the most popular encryption algorithms available, proprietary of RSA Security Inc.&lt;/p&gt;         &lt;p&gt;While implementing complex encryption methods, &lt;strong&gt;&lt;a href="http://www.littlelite.net/foldercrypt/"&gt;Folder Crypt&lt;/a&gt;&lt;/strong&gt; is very easy to use. Fully integrated with MS Windows shell, with just one click it's possible to password protect any Windows folder or set of files. The decryption can be made by right clicking on a locked folder and entering the right password. Besides, all encrypted archives can be compressed to save space on disk.&lt;br /&gt;&lt;/p&gt;&lt;p&gt;Folder Crypt takes full advantage of the new Microsoft Smart Client technology, which guarantees algorithm correctness and an extraordinary robustness.         &lt;/p&gt;&lt;p&gt;The new version comes with full Microsoft .NET v2.0 support and a completely revised user interface.&lt;br /&gt;&lt;/p&gt;                  &lt;p&gt;&lt;strong&gt;&lt;a href="http://www.littlelite.net/foldercrypt/"&gt;Folder Crypt&lt;/a&gt; &lt;/strong&gt;is available for evaluation through the best software downloading sites, such as &lt;a href="http://www.tucows.com/preview/342857.html"&gt;Tucows&lt;/a&gt; and CNET &lt;a href="http://www.download.com/3000-2092-10277480.html?part=6209879&amp;subj=dlpage&amp;amp;tag=button"&gt;download.com&lt;/a&gt;.&lt;/p&gt;&lt;p&gt;&lt;br /&gt;&lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-114666704201611209?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/114666704201611209/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=114666704201611209" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/114666704201611209?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/114666704201611209?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2006/05/we-have-just-released-version-2.html" title="" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;A08CQHk7eyp7ImA9WBJXEEg.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-114405986168807145</id><published>2006-04-03T12:23:00.000+02:00</published><updated>2006-04-03T12:24:21.703+02:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2006-04-03T12:24:21.703+02:00</app:edited><title /><content type="html">It could be somewhat trivial, but when you delete a file or a folder in Windows&lt;sup&gt;TM&lt;/sup&gt; it is not actually erased. Simply, the hard disk descriptor table is updated and the file entry is removed. So, the actual bytes of the file remain on the disk. Even when the file area is overwritten, it is still possibile to recover data, by applying certain laboratory procedures since it's rare that a portion of the hard disk is rewritten more than 5/10 times. It has been calculated that information is completely unrecoverable only after more than 30 rewrites. We felt the need of a secure tool of file deletion in a .NET environment, so we wrote &lt;a href="http://www.littlelite.net/nshred/"&gt;NShred.&lt;/a&gt;&lt;br /&gt;&lt;em&gt;&lt;/em&gt; NShred detects the file area on the hard disk or other drive. This area includes metadata on file, such as name and date. The area is then rewritten 'n' times depending on the procedure. For instance, with &lt;a href="http://www.dss.mil/isec/nispom_0195.htm"&gt;DOD algorithm&lt;/a&gt;, the file area is rewritten first with "0" bit, then with "1" bit, then with a random byte. After rewriting, the file area is reduced to zero, the file renamed with random characters and finally deleted. This procedure guarantees that not even a single byte from the former file can ever be retrieved.&lt;br /&gt;&lt;em&gt;&lt;/em&gt; While the majority of shredding tools are "brute force" and "operating system agnostic" erasing tools, NShred behaves accordingly to the underlying Operating System (OS), denying the user the possibility to turn it unstable. For instance, if the OS denies a delete operation, NShred will NOT erase the file. The user will be able to erase it later when it is no more locked by the OS.          &lt;p&gt;Plus, &lt;a href="http://www.littlelite.net/nshred/"&gt;NShred&lt;/a&gt; is a .NET Framework Smart Client application, which ensure the user with a superior robustness and full compatibility and integration with the latest Microsoft Operating Systems and tools.&lt;/p&gt;               &lt;p&gt;Curious about it? Try a &lt;a href="http://www.google.it/search?hl=it&amp;q=NShred+Littlelite&amp;amp;btnG=Cerca+con+Google&amp;amp;meta="&gt;Google search with 'NShred LittleLite'&lt;/a&gt;.&lt;/p&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-114405986168807145?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/114405986168807145/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=114405986168807145" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/114405986168807145?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/114405986168807145?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2006/04/it-could-be-somewhat-trivial-but-when.html" title="" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;CkAER30zfip7ImA9WBJSGEw.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-114180794942892151</id><published>2006-03-08T09:47:00.000+01:00</published><updated>2006-03-08T10:38:26.386+01:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2006-03-08T10:38:26.386+01:00</app:edited><title>Shareware vs demo/free version</title><content type="html">Currently, our main software products are distributed on a "&lt;span style="font-style: italic; color: rgb(51, 51, 255);"&gt;try and buy&lt;/span&gt;" base. The product you can download for free is the very same product you get when you buy it. Actually, it is the same set of files: only entering a special key they are turned into a full licensed product. The only difference between the "&lt;span style="font-style: italic; color: rgb(51, 51, 255);"&gt;try and buy&lt;/span&gt;" and the "&lt;span style="font-style: italic; color: rgb(51, 51, 255);"&gt;registered&lt;/span&gt;" version is  that the first is time-limited: after 30 days it will expire. This is the way most shareware products work.&lt;br /&gt;&lt;br /&gt;But there is a strong counter-indication. If you publish a software package without functional limitations, you are subject to piracy. It is somewhat easy to find a right key generator for every remarkable shareware product on the market, if you just look for pirate sites and you are brave enough to run the risk of downloading a piece of software that may contain all sort of viruses and malware. Nonetheless, a lot of people downloads the free "try and buy" version and after a while register it using piracy tools. I will not talk about the side effects of this behaviour, they are clearly visible.&lt;br /&gt;&lt;br /&gt;To face the piracy, more and more software companies decided not to release "&lt;span style="font-style: italic; color: rgb(51, 51, 255);"&gt;time-limited but fully functional&lt;/span&gt;" versions of their product. Instead, they release a functions-limited version, and they call it "Demo version". If you want to use the unlimited product, you buy it so that you can download it from a secure site. This is what normally happens with videogames. Not only doing this you can deliver the full product only to people who actually buy it, but you can save all efforts to make your software stand against piracy attacks (source code obfuscation, random key correctness checks and so on).&lt;br /&gt;&lt;br /&gt;The main disadvantage against the "Demo version" policy, is that you can never show to your potential customer the real capabilities of your software. Persons that use the Demo version could be unsatisfied with it, but satisfied by the real product: too bad they will never see it! Of course you can advertise a strong "money back guarantee" so that the user can buy the full product and then decide that it does not fulfill his expectations.&lt;br /&gt;&lt;br /&gt;After some thoughts about it, we decided to go for the "&lt;span style="font-style: italic; color: rgb(51, 51, 255);"&gt;try and buy&lt;/span&gt;" option and to face the piracy threat. We want to be very transparent with our potential customers, showing to them our products as they truly are.&lt;br /&gt;&lt;br /&gt;To tell the truth, we are not so angry with the people who prefer to use our software with keys coming from piracy. After all, they like our product and they use it (and this is the reason we write software, after all). To them we only say that without directly supporting the creation and maintenance of software, this is likely to disappear. That is, software written by small, independent software houses will disappear.&lt;br /&gt;&lt;br /&gt;Then there is all the reasoning about Open Source software, but that will be covered in another post.&lt;br /&gt;&lt;br /&gt;Anyway, ours is not a dogma, after all. Comments (even by software developers) are very welcome.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-114180794942892151?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/114180794942892151/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=114180794942892151" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/114180794942892151?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/114180794942892151?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2006/03/shareware-vs-demofree-version.html" title="Shareware vs demo/free version" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;DUYFSHs5fip7ImA9WBJSEE4.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-114103685073388420</id><published>2006-02-27T11:39:00.000+01:00</published><updated>2006-02-27T11:45:19.526+01:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2006-02-27T11:45:19.526+01:00</app:edited><title /><content type="html">&lt;strong&gt;&lt;span style="color: rgb(51, 0, 204);"&gt;What is a HASH code? &lt;span style="color: rgb(0, 0, 0); font-weight: normal;"&gt; It is a fixed length string of bits &lt;/span&gt;&lt;/span&gt;&lt;/strong&gt;&lt;strong&gt;&lt;span style="color: rgb(51, 0, 204);"&gt;&lt;span style="color: rgb(0, 0, 0); font-weight: normal;"&gt;(that is, a series of bits)&lt;/span&gt;&lt;/span&gt;&lt;/strong&gt;&lt;strong&gt;&lt;span style="color: rgb(51, 0, 204);"&gt;&lt;span style="color: rgb(0, 0, 0); font-weight: normal;"&gt;, extracted by an algorithm that operates on a common file (from a few bits to several gigabytes long).&lt;br /&gt;&lt;br /&gt;For instance, hash function SHA384 extract 384 bits from any file.&lt;br /&gt;&lt;br /&gt;This "hash" is, basically, the digital ID or electronic digest of a file. Again, for instance, if I download a movie from Internet (dvd, divx, mpeg) and I want to be sure that the file I downloaded is equal - bit per bit equal - to the one on the original site, then one way to accomplish that is to check the hash code of the downloaded file against the hash code of the original file - provided that the site displays such information. Today, more and more sites display such information, for security reasons too: the file may be infected with virus and worms. Since a virus is attached to a file, then the hash code can easily discover its presence. If I know in advance the hash code of a file, I will never execute a file that has a different hash code from the one expected: that file could be corrupted, if I'm lucky, or just infected by a virus or a worm.&lt;br /&gt;&lt;br /&gt;Now, &lt;a href="http://www.littlelite.net/iside"&gt;Iside&lt;/a&gt;, is among the best tools to compute and display hash codes from any file, without OPENING them! You can try it today, for free, &lt;a href="http://www.tucows.com/preview/393241" title="Iside at Tucows"&gt;here&lt;/a&gt;.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;/span&gt;&lt;/span&gt;&lt;/strong&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-114103685073388420?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/114103685073388420/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=114103685073388420" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/114103685073388420?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/114103685073388420?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2006/02/what-is-hash-code-it-is-fixed-length.html" title="" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;DU4DQn49eCp7ImA9WBVbGEU.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-113888797304925613</id><published>2006-02-02T14:15:00.000+01:00</published><updated>2006-02-02T14:46:13.060+01:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2006-02-02T14:46:13.060+01:00</app:edited><title>Easy hacking, pal!</title><content type="html">Yesterday I was talking about secrets hiding and cryptography. A friend of mine said he was able to crack any Word document in one day as a maximum. He said it was not a problem of password complexity: he knew how to strip Word protection away. As a proof, he took an old Word document and he was actually able to crack it in a few minutes.&lt;br /&gt;&lt;br /&gt;I said he was only lucky and that I was ready to bet a non trivial sum of money that he would not be able to crack a Word document encrypted by myself. He laughed out loud, he said I just wanted to lose money... but he did not accept my bet.&lt;br /&gt;&lt;br /&gt;Then I sent the Word document encrypted by myself  to him anyway: he is still trying to crack it (a week is already passed... but I think the encryption will stand against his attacks for ten/fifteen years).&lt;br /&gt;&lt;br /&gt;I told you this little story as a metaphor of how things really go when talking about encryption: it is almost always a matter of process, and not tools.&lt;br /&gt;&lt;br /&gt;Word has an excellent encryption system, although it is limited by US key length limitation: if you just know how to do it, you can super-encrypt a Word document, and be sure that no-one (except, perhaps, CIA) will succeed in cracking it. The problem is that it is not easy to encrypt a Word document well: you must know a thing or two before doing it. Just pressing "Protect this document with a password" does not work (and makes people like the friend of mine boast himself!)&lt;br /&gt;&lt;br /&gt;The story has a morale: market lack of tools that make serious encryption easily. That’s one of LittleLite’s missions: to produce easy to use, but serious encryption tools (such as &lt;a href="http://www.littlelite.net/foldercrypt"&gt;Folder Crypt&lt;/a&gt;).&lt;br /&gt;&lt;br /&gt;Secondarily, that it is often heard of people cracking programs, software barriers, ciphered documents and this makes the casual Internet user think that no real security is possible on Internet. Again, this happens because encryption processes and policies are often weak, when not at all bugged.&lt;br /&gt;&lt;br /&gt;On the contrary, data encrypted following secure processes and using encryption standard tools, remain secret.&lt;br /&gt;&lt;br /&gt;(Oh, by the way: to safely encrypt a Word document just follow these steps:&lt;br /&gt;&lt;br /&gt;&lt;span style="font-style: italic; color: rgb(204, 0, 0);"&gt;1.    Start Word. &lt;/span&gt;&lt;br /&gt;&lt;span style="font-style: italic; color: rgb(204, 0, 0);"&gt;2.    Select File | Save as. &lt;/span&gt;&lt;br /&gt;&lt;span style="font-style: italic; color: rgb(204, 0, 0);"&gt;3.    Select the Tools extended menu option. &lt;/span&gt;&lt;br /&gt;&lt;span style="font-style: italic; color: rgb(204, 0, 0);"&gt;4.    Select Security Options from the drop-down list. &lt;/span&gt;&lt;br /&gt;&lt;span style="font-style: italic; color: rgb(204, 0, 0);"&gt;5.    Click the Advanced button. &lt;/span&gt;&lt;br /&gt;&lt;span style="font-style: italic; color: rgb(204, 0, 0);"&gt;6.    From the Encryption Type dialog, copy the name of the encryption type name and encryption algorithm from the Choose an encryption type list. &lt;/span&gt;&lt;br /&gt;&lt;span style="font-style: italic; color: rgb(204, 0, 0);"&gt;7.    RC4, Microsoft enhanced RSA and AES Cryptographic provider&lt;/span&gt;&lt;br /&gt;&lt;span style="font-style: italic; color: rgb(204, 0, 0);"&gt;8.    Set maximum key length to 128&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;)&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-113888797304925613?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/113888797304925613/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=113888797304925613" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/113888797304925613?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/113888797304925613?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2006/02/easy-hacking-pal.html" title="Easy hacking, pal!" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;CU8DQnY7eCp7ImA9WBVbF0w.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-113871367569385879</id><published>2006-01-31T14:21:00.000+01:00</published><updated>2006-01-31T14:24:33.800+01:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2006-01-31T14:24:33.800+01:00</app:edited><title>The Iside Message Digest computing tool</title><content type="html">A cryptographic checksum is a mathematical value (called a &lt;a class="inline" href="http://www.littlelite.net/iside"&gt;checksum&lt;/a&gt;) that is assigned to a file and used to "test" the file at a later date to verify that the data contained in the file has not been (properly or maliciously) changed.&lt;br /&gt;&lt;br /&gt;A cryptographic checksum is created by performing a complicated series of mathematical operations (known as a cryptographic hash functions) that translates the data in the file into a fixed string of digits called a &lt;a class="inline" href="http://www.littlelite.net/iside"&gt;hash&lt;/a&gt; value, which is then used as a checksum. It is threfore highly unlikely that an unauthorized person would be able to change data without inadvertently changing the corresponding checksum.&lt;br /&gt;&lt;br /&gt;Cryptographic checksums are used in data transmission and data storage. In data transmission to verify the integrity of the file during the transmission, in data storage to verify that a file or a series of files did not change in a period of time.&lt;br /&gt;&lt;br /&gt;Cryptographic checksums are also known as message authentication codes, integrity check-values, modification detection codes, or message integrity codes, and finally hash codes.&lt;br /&gt;&lt;br /&gt;LittleLite distributes one of the best available software tools on the market to calculate and verify cryptographic checksums: &lt;a href="http://www.littlelite.net/iside"&gt;Iside &lt;/a&gt;shows the hash code of a file with several different algorithms ( &lt;span style="font-size:78%;"&gt;&lt;span style="font-size:78%;"&gt;ADLER32, &lt;/span&gt;&lt;/span&gt;&lt;span style="font-size:78%;"&gt;CRC32, &lt;/span&gt;&lt;span style="font-size:78%;"&gt;FCS16/32, &lt;/span&gt;&lt;span style="font-size:78%;"&gt;HAVAL, &lt;/span&gt;&lt;span style="font-size:78%;"&gt;HMAC-SHA1, &lt;/span&gt;&lt;span style="font-size:78%;"&gt;MD2, &lt;/span&gt;&lt;span style="font-size:78%;"&gt;MD4,  &lt;/span&gt;&lt;span style="font-size:78%;"&gt;MD5, &lt;/span&gt;&lt;span style="font-size:78%;"&gt;SHA1, &lt;/span&gt;&lt;span style="font-size:78%;"&gt;SHA256, &lt;/span&gt;&lt;span style="font-size:78%;"&gt;TIGER &lt;/span&gt;&lt;span style="font-size:78%;"&gt;WHIRLPOOL) &lt;/span&gt;and performs Windows files and folders comparisons, based on cryprographic checksums computing.&lt;br /&gt;&lt;br /&gt;To know more about Iside, just try a &lt;a href="http://www.google.it/search?hl=it&amp;q=littlelite+iside&amp;amp;amp;amp;btnG=Cerca+con+Google&amp;amp;meta="&gt;Google search about it&lt;/a&gt;.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-113871367569385879?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/113871367569385879/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=113871367569385879" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/113871367569385879?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/113871367569385879?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2006/01/iside-message-digest-computing-tool.html" title="The Iside Message Digest computing tool" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry><entry gd:etag="W/&quot;CEAFQX0-fip7ImA9WBVbF0w.&quot;"><id>tag:blogger.com,1999:blog-21753615.post-113871271034956660</id><published>2006-01-31T14:01:00.000+01:00</published><updated>2006-01-31T14:05:10.356+01:00</updated><app:edited xmlns:app="http://www.w3.org/2007/app">2006-01-31T14:05:10.356+01:00</app:edited><title /><content type="html">The LittleLite web site (and blog) is under a  major redesign. The main idea is that the content should be displayed with lower detail and verbosity, in a more clear and concise way. Also, we are passing from dark to bright colors - we'd want to be honest and bright, as opposed to techie and dark...&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/21753615-113871271034956660?l=littlelite-sw.blogspot.com'/&gt;&lt;/div&gt;</content><link rel="replies" type="application/atom+xml" href="http://littlelite-sw.blogspot.com/feeds/113871271034956660/comments/default" title="Post Comments" /><link rel="replies" type="text/html" href="https://www.blogger.com/comment.g?blogID=21753615&amp;postID=113871271034956660" title="0 Comments" /><link rel="edit" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/113871271034956660?v=2" /><link rel="self" type="application/atom+xml" href="http://www.blogger.com/feeds/21753615/posts/default/113871271034956660?v=2" /><link rel="alternate" type="text/html" href="http://littlelite-sw.blogspot.com/2006/01/littlelite-web-site-and-blog-is-under.html" title="" /><author><name>Home Page</name><uri>http://www.blogger.com/profile/12934351650023334920</uri><email>noreply@blogger.com</email><gd:extendedProperty name="OpenSocialUserId" value="03787181874139396866" /></author><thr:total xmlns:thr="http://purl.org/syndication/thread/1.0">0</thr:total></entry></feed>
