Cryptis – Symmetrical Cryptographic Unit

This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
Installation not required, however it is recomended to make sure all executables are named to “cryptis” and are placed in a suitable directory pointed to by the system’s path variable for ease of access. Bundled executables for Windows and Linux; for compatibility problems, recompilation may be necessary.
Features

  • XOR 56bit Symmetrical Encryption
  • 100% FREE award granted by Softpedia

Download : Cryptis v2.2.1.zip (128.9 kB)
Find Other Version |
Read more in here

Advertisements

EPG – Extended Password Generator V2.0 released

EPG – Extended Password Generator is an unique tool which can help you to generate pronounceable and random passwords, secure against brute-force dictionary attacks.


Recen releasead Changes in 2.0: – Implemented checking user’s provided passwords – No more MFC, 100% written with ATL/WTL (including Grid, Clipboard, printing, etc) – Visual Studio 2010 – WTL 8.1 – Boost 1.49

This algorithm was initially suggested by National Technical Information Service (NTIS), developed at Federal Information Processing Standard (FIPS) No181 “Automated Password Generator” and modified by me to implement exclude/include scheme

Platform : Windows
Download :  http://sourceforge.net/projects/epg/files/epg/2.0/
Read more in here : http://epg.sourceforge.net/

xca – X Certificate and Key management

X Certificate and Key management is an interface for managing asymetric keys like RSA or DSA. It is intended as a small CA for creation and signing certificates. It uses the OpenSSL library for the cryptographic operations.

Features :

  • Start your own PKI and create all kinds of certificates, requests or CRLs
  • Manage your Smart-Cards via PKCS#11 interface
  • Export certificates and requests to a OpenSSL config file
  • Create name and/or extension templates to ease issuing similar certs
  • Convert existing certificates or requests to templates
  • Supports v3 extensions as flexible as OpenSSL but user friendlier

Download latest :  setup_xca-0.9.3.exe (6.4 MB)
Find Other Version |
Read more in here : http://xca.sourceforge.net/

A new remote data integrity checking scheme for cloud storage

Abstract: Cloud storage services enable user to enjoy high-capacity and high-quality storage with less overhead, but it also brings many potential threats, for example, data integrality, data availability and so on. In this paper, we propose a new remote integrality and availability checking scheme for cloud storage. This new scheme can check mass file’s integrality and availability with less storage, computation and communication resource. The new scheme also supports data dynamic update, public verifiability and privacy preserving.

Category : cryptographic protocols / cloud storage; data security; data integrality

[non commercial cryptographers] – Download this Papers

Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security

Introduction

A central goal of public key cryptography is to design encryption systems that are secure against chosen ciphertext attacks. Public key encryption systems that are chosen ciphertext attack (CCA) secure are robust against powerful adversaries that are able to leverage interaction with a decryptor. Such an attacker is modeled by allowing him to query for the decryption of any ciphertext except a challenge ciphertext for which he is trying to break. This includes ciphertexts derived from the challenge ciphertext . Due to its robustness against powerful attackers, chosen ciphertext security has become the accepted goal for building secure encryption. For this reason, building chosen ciphertext secure systems has been a central pursuit of cryptographers for over twenty years and we have seen many distinct approaches to achieving CCA security

Category : ciphertext security, encryption

[non commercial cryptographers] – Download this Papers

On definitions of selective opening security

Abstract: Assume that an adversary observes many ciphertexts, and may then ask for openings of some of them. Do the unopened ciphertexts remain secure? There are several ways to formalize this question, and the ensuing security notions are not known to be implied by standard notions of encryption security. In this work, we relate the two existing flavors of selective opening security. Our main result is that indistinguishability-based selective opening security and simulation-based selective opening security do not imply each other.

We show our claims by counterexamples. Concretely, we construct two public-key encryption schemes. One scheme is secure under selective openings in a simulation-based sense, but not in an indistinguishability-based sense. The other scheme is secure in an indistinguishability-based sense, but not in a simulation-based sense.

Our results settle an open question of Bellare et al. (Eurocrypt 2009). Also, taken together with known results about selective opening secure encryption, we get an almost complete picture how the two flavors of selective opening security relate to standard security notions.

Category : public-key cryptography / security definitions, selective opening security, public-key encryption

[non commercial cryptographers]Download this Papers

 

Fast and Secure Root-Finding for Code-based Cryptosystems

Abstract: In this work we analyze four previously published respec- tively trivial approaches to the task of finding the roots of the error locator polynomial during the decryption operation of code-based en- cryption schemes. We compare the performance of these algorithms and show that optimizations concerning finite field element representations play a key role for the speed of software implementations. Furthermore, we point out a number of timing attack vulnerabilities that can arise in root-finding algorithms, some aimed at recovering the message, others at the secret permutation. We give experimental results showing that manifestations of these vulnerabilities are present in straightforward im- plementations of most of the root-finding variants presented in this work. As a result, we find that one of the variants provides security with re- spect to all vulnerabilities as well as highly competitive results in terms of performance for code parameters that minimize the public key size.

 

Category :  implementation / side channel attack, timing attack, implementation, code-based cryptography

[non commercial cryptographers]Download this Papers