0
votes
0answers
2 views

Frequency analysis of transposition cipher

Can we do frequency analysis of transposition ciphers? If yes, please tell me the procedure and i would be happy if you provide me with some links related to it i heard that it can be done using ...
0
votes
0answers
19 views

How can I generate a brief (100) stream of random numbers, not using the computer or throwing dice?

I am looking for a method of making random numbers that is off-line and is also independent of specialist equipment like a Geiger counter.
0
votes
0answers
9 views

State of the art RSA key generation

I would like to know if there is an algorithm to generate a RSA key at the state of the art of the present cryptanalysis. Beside the key lenght I know there are some weakness in the choice of prime ...
0
votes
0answers
14 views

Which homomorphic encryption scheme has the same size of plaintext space and ciphertext space?

I want to pre-compute the result for all possible ciphertext of a homomorphic encryption. Is it acheivable? Is there a fully homomorphic encryption scheme that has the same size of plaintext space ...
1
vote
1answer
21 views

Solving Vignere Encryption

I'm currently trying to crack a cypher that I believe is Vignere Encrypted and I'm currently stuck. I calculated the key length by finding repeated sequences in the cypher and calculating the the ...
1
vote
0answers
14 views

Questions about adding 0s to the key in HMAC and how it compares to SHAd

I noticed some strange behaviour when adding different characters onto the end of the key then inputting it into HMAC and I was getting the same output hash. First I generated a key and message to ...
0
votes
0answers
22 views

How are private keys stored on disk?

I have a public and secret key pair in my .ssh folder. How is the secret key being stored on disk? What I mean is .. Is it possible for someone to hack into my computer, steal the secret key and use ...
0
votes
0answers
11 views

Spurious keys filter

Is there any possible way to filter a key space in a crypto-system to get a set of keys that decrypts out a valid text (text that is in same language or readable)? I tried a random approach and got ...
0
votes
0answers
25 views

Encrypting a short phrase into two keys. both with length of 32letters

It doesn't need to be crazy secure. I wanted to figure out if there's a popular practice when encrypting a short phrase (less than 32 letter long) into two keys (two strings 32 length). Doesn't need ...
0
votes
0answers
13 views

What can I change in Lane to

What can I change in Lane to increase memory (and compute) consumption. My first idea would be to change n, but with Lane hash function is there a way I can up the n to a level higher than 512. If I ...
0
votes
0answers
8 views

Cryptography — with a semi-priveleged user in the middle — to prevent request-tampering with another server

I'm working on a chat server for a mobile app I am writing. I would like to use a different application server for non-chat related operations and another application for chat operations. I would ...
0
votes
0answers
20 views

HMAC definition by using only one key

Suppose $H$ is a hash function; why is $H(k||H(k||m))$ not secure? See this HMAC definition. In there, indeed two keys are used and the mac algorithm is $H(k_1 ||H(k_2 ||m))$ . Why don't we use ...
0
votes
0answers
20 views

Cryptography systems based on NP complete problems

There is any cryptography system that have a good reputation based on NP cpmplete problem? I read about the knapsack, but it was cracked.
0
votes
0answers
24 views

Nonlinearity of the J-K Flip Flop

In "Encryption Schemes for Computer Confidentiality", Pless describes how to use the J-K flip flop as a nonlinear combiner for linear feedback shift registers. This generator was broken because the ...
1
vote
1answer
111 views

Are the MD5 constants an S-Box?

I noticed that several hash algorithms, in this case MD5, defines some constants. MD5 defines 64 constant values (the shift count per round) which also gets expand (via sine) to a summand for a ...
0
votes
0answers
134 views

CVE-2014-1295 (Apple's Secure Transport and Triple Handshake Attack)

Apple is releasing some updates today. They have not published the bulletins yet, but they are available here: https://gist.github.com/FredericJacobs/11189734. In the writeup for CVE-2014-1295: ...
3
votes
1answer
98 views

What are the key differences between the draft SHA-3 standard and the Keccak submission?

I just noticed that on the NIST website there is a PDF with a draft of the SHA-3 standard (i.e. FIPS 202) (marked as "new", and seemingly the page was last changed on April 7, 2014). Previously it ...
2
votes
0answers
18 views

Can I prove set membership and uniqueness without revealing the element?

Assuming a publicly known set $\Psi$ with $N$ unique elements. I have a set $\Sigma=\{\sigma_1,\sigma_2,...,\sigma_m\}$ where $m\leqslant N$. I would like to publicly prove that all the elements in ...
0
votes
1answer
50 views

Burn after read algorythm. Software verification on compromised environment. Software smart card

please help me pick right design of software I have to design client-server software, where server should verify that client runs software from exact source code. And where software doesn't simulate ...
5
votes
1answer
245 views

Use cases for CMAC vs. HMAC?

Both can be used to verify the integrity of a message. Assuming you have the needed primitives available to you (i.e. the code space of needing both a cipher and a hash function isn't prohibitive), is ...
1
vote
1answer
52 views

“Fine grain Cross-VM Attacks on Xen and VMware are possible” and OpenSSL 0.9.7

Here's a paper that just made its way into Cryptology ePrint Archive: Fine grain Cross-VM Attacks on Xen and VMware are possible!. Its a good survey of past attacks and presents a couple of new ...
-2
votes
1answer
68 views

Is less security required for a short stream cipher than for the AES enciphering of very long messages? [on hold]

Criticisms of a cipher system such as 'the ciphertext from one message must be indistinguishable from the ciphertext of a second message" surely only apply when there are very large amounts of ...
0
votes
0answers
34 views

Key construction in the Full Cramer-Shoup cryptosystem

The Full Cramer-Shoup Encryption scheme needs to choose six random numbers from $\mathbb{Z}_q$, which we denote them by $ x_1,x_2,y_1,y_2,z_1,z_2 $. Then the scheme hides these random numbers in the ...
1
vote
0answers
73 views

Why does computing g^a * g^{-a} with the PBC library result in zero?

My example code is as follows: /* * Example 1 * 1) Calculate g^a * 2) calculate g^{-a} * 3) multiply g^a * g^{-a} * */ Note: here ...
1
vote
1answer
68 views

Definition of one-way functions: randomly-chosen point vs every point

Notation: $\Sigma^k$ is the set of $k$-strings on the alphabet $\Sigma$; $\Sigma^\ast$ is the set of all finite dimensional strings on the alphabet $\Sigma$. In the context of computer-science a ...
3
votes
2answers
115 views

Leaving authentication data blank less secure for AES GCM?

The AES GCM example for Ruby / OpenSSL shown at: http://ruby-doc.org/stdlib-2.0/libdoc/openssl/rdoc/OpenSSL/Cipher.html has a GCM example of the following: ...
3
votes
2answers
63 views

Stateless hash based public key cryptography?

Merkle-Winternitz signatures based on fractal hash trees are an attractive alternative to other post-quantum cryptographic schemes, in particular since they are conceptually simple, the security ...
0
votes
1answer
68 views

Is it possible to track down copies of WW2-era codebooks?

I've got an academic curiosity regarding some of the old Japanese naval codes used during World War II specifically, but I was just wondering if any of the codebooks from this era had been made ...
1
vote
1answer
95 views

Usage of different size chunks during AES encryption/decryption

I want to encrypt user's files on our server. For this purpose I decided to use the PHP Mcrypt library. I chose to use the Rijandel-128 algorithm and CBC mode for encryption. Since files are quite ...
0
votes
0answers
40 views

Creating passwords that are both secure and memorable [on hold]

I have seven critical passwords. I want them to be long enough to be secure, memorable enough that I never forget them, unique enough to resist an attacker. How do I achieve this?
0
votes
0answers
33 views

Recommendation for authenticated ephemeral key exchange

I am working on a home project and I wanted to implement an authenticated ephemeral key exchange using Elliptic curves. I first thought about Station-to-Station with EC protocol, but it does not seem ...
1
vote
0answers
58 views

Cryptography Implementation in software

I am trying to implement a password manager in C and I had a question about the proper steps in implementing the crypto. I looked at some implementations, google talks on crypto and what the standards ...
1
vote
1answer
58 views

Is a tweakable block cipher still considered deterministic in nature?

"a block cipher is a deterministic algorithm operating on fixed-length groups of bits, called blocks, with an unvarying transformation that is specified by a symmetric key. - Wikipedia " But with a ...
1
vote
2answers
107 views

Diffusion in Shamir's secret sharing scheme

The popular command line utility ssss implements the classic Shamir's secret sharing scheme over the generic field $GF(2^q)$ with $8 \le q \le 1024$. When $q>=64$, the constant coefficient ($c_0$) ...
0
votes
1answer
88 views

XORing a header with SHA512-hash - secure?

I am writing a application that encrypts text several times and stores the result. The result looks like complete random bytes, therefore I add some random bytes at the end. To let the program know ...
-1
votes
0answers
65 views

Hybrid encryption with Textbook RSA [on hold]

A common variant of textbook RSA is the following: During key generation, the modulus $N$ is chosen as usual. We chose $e$ as $e:=3$ (instead of random). Then $d$ is chosen with $e\cdot ...
1
vote
1answer
44 views

MAC security and adversaries with memory

The usual definition of MAC security is (roughly) that there is no "efficient" adversary that has non-negligible advantage in the "MAC game" where the MAC game is as follows: the challenger chooses a ...
3
votes
1answer
94 views

Is there a reason that the N value in scrypt is limited to powers of two?

I have been looking at the scrypt hashing algorithm and am confused as to why the N value, which determines the overall cost, is limited to powers of two. There are ...
5
votes
1answer
98 views

Security of KDF1 and KDF2 (hash based KDF's)

It's still common to come across implementations of KDF1 and KDF2. Basically these are KDF's that simply derive multiple keys from the key seed and a counter: $K_i = KDF(K_{master}, i) = H(K_{master} ...
1
vote
0answers
55 views

Cryptographic library quality [on hold]

I've been working on a project that will require secure communication over the internet, so I've been thinking of TLS 1.2. After looking around I chose Botan but then I thought about using a more ...
1
vote
3answers
73 views

How to calculate Modulo using a standard calculator for a one time pad encryption

I wrote a simple python script to preform one time pad encryption I would like to be able to decrypt the ciphertext by hand. In my script I use mod 26. This is how I was shown to calculate a mod ...
1
vote
1answer
121 views

What does it mean when two encrypted files, encrypted with the same method but with different keys, when xor'd together, produce a repeating pattern?

Let's say I have fileA and fileB, both encrypted somehow, but in the same method with different keys. If I xor them together, they will make a repeating pattern of 32 bytes length. What does that ...
0
votes
0answers
46 views

ECDSA verification is too slow [on hold]

I found that ECDSA is too slow while verifying signatures; can you tell me why? I'm planing to speed it up, so what tips should I consider to make it fast?
3
votes
2answers
159 views

How vulnerable is the C rand() in public cryptography protocols?

I just learned about the basics of public cryptography a few weeks ago and I am curious as to why the C rand() function should not be used for crypto schemes. For example, say I want to generate a ...
0
votes
0answers
42 views

RSA algorithm , decrypting a message [on hold]

I have to decrypt a message (24-264-291-291-220) using RSA algorithm given the private key. I did all the calculations and the decryption of that message is 74-66-48-48-55. My question is how would I ...
0
votes
0answers
17 views

Client-server authentication protocol suggestion [migrated]

I'm designing an authentication methods for my client/server system consisting of: a windows desktop client application (.NET) windows/linux servers (C++) one "security server" which authorizes the ...
-1
votes
1answer
71 views

Constants Differ in SHA1 implementation

https://code.google.com/p/crypto-js/source/browse/tags/3.1.2/src/sha1.js ...
-3
votes
0answers
54 views

RSA and ECDSA algorithms [closed]

Hi, i want to learn more about ECDSA and RSA Digital signatures , could you give me both Algorithms for sign and verify the data.
0
votes
2answers
149 views

Decrypting a small Message using RSA with a Private Key [on hold]

If I have a private key of (43, 341), what would be the steps I need to take to decrypt a small message using RSA. I have looked ...
1
vote
1answer
117 views

One time pad: why is it useless in practice?

The symmetric cryptosystem One time pad (OTP) seems to be very beautiful since it is perfectly secret according to Shannon. Many books, however, point out that the main drawback is that one must ...

15 30 50 per page