1
vote
0answers
80 views

Why do we always append padding bits in SHA-512? [duplicate]

Possible Duplicate: In the SHA hash algorithm, why is the message always padded? I'm reading the book Network Security Essentials written by William Stallings. To create a message digest ...
1
vote
0answers
55 views

IND-CPA security scheme [duplicate]

Possible Duplicate: CPA Secure Chosen plaintext scheme The example for IND-CPA secure schemes given is generally: for a random r, $Enc_k(m) =(r|| E_k(r)$ $XOR$ $m)$ where $E$ is a $PRF$ ...
1
vote
1answer
109 views

WebcryptoAPI - secure or not [closed]

This is about the new W3 WebcryptoAPI draft standard. Here is a post by one of it's authors https://plus.google.com/u/0/105761279104103278252/posts/CSwVZ1RUijo It says its in part trying to change ...
1
vote
0answers
281 views

Stream Cipher : Never use stream cipher key more than once [duplicate]

Possible Duplicate: Taking advantage of one-time pad key reuse? How does one attack a two-time pad (i.e. one time pad with key reuse)? Denote C is cipher text, m is message, and PRG(k) is ...
1
vote
0answers
93 views

Timestamping services authorities, utilizing Linked, hybrid and other than PKI schemes

What are well respected Cryptographic Timestamping authorities utilizing more sophisticated than just PKI (RFC 3161) schemes, like Linked, Linked and signed, distributed hash trees (maybe P2P?), ...
1
vote
0answers
189 views

Is TOTP or a timestamp encryption a better timestamp-based authentication token system?

Are there advantages to using TOTP over encrypting a timestamp with a shared secret, in cases where the readability or ease of typing the token are not important?
1
vote
0answers
182 views

Proper formatting of symmetric algorithm secret key

Given this description from RFC 4880 sec 5.1: The value "m" in the above formulas is derived from the session key as follows. First, the session key is prefixed with a one-octet algorithm ...
1
vote
0answers
128 views

Setting protocol parameters to achieve concrete security

Background One issue with modern security proofs is that they are usually asymptotic. In other words, such proofs are usually formulated as follows: For any polynomial-time adversary $\mathcal A$, we ...
1
vote
0answers
72 views

Applying multiple hash functions to improve security? [duplicate]

Possible Duplicate: Guarding against cryptanalytic breakthroughs: combining multiple hash functions I'm a total newb to cryptography but after reading what I've read about it, I had a ...
1
vote
1answer
188 views

NTRUEncrypt - Choose the initial random polynomial

I'm trying to implement NTRUEncrypt but encounter some problems. I've finished all the basic functions that are needed for the scheme base on this Document, but I can't find an algorithm to check the ...
1
vote
0answers
61 views

cipher text only attack - how to know when to stop when brute-force attack? [duplicate]

Possible Duplicate: How can I do a brute force (ciphertext only) attack on an CBC-encrypted message? My question is about a cipher text only attack - I have as input only the initialization ...
1
vote
0answers
216 views

Most frequently used digital signature schemes in the recent years

I am looking to understand if there are any hard figures on which digital signature schemes are most commonly in use today. I'm only really interested in what is employed recently (ie. last couple ...
1
vote
0answers
71 views

Is it possible to build an unfair noisy channel from 1 out of 2 oblivious transfer [closed]

For a fair channel, sender sends a bit b and receiver gets it with probability 1/2 and gets b's flipped value with probability 1/2. It is trivial to build a fair noisy channel from 1 out of 2 ...
1
vote
0answers
330 views

Diffie hellman key exchange on elliptic curve over an extension field [closed]

I am attempting to do a final semester project where I implement Diffie-Hellman key exchange on an elliptic curve over an extension field (2^256). Can anybody help me to generate the extension field ...
1
vote
1answer
235 views

ZKIP for Paillier public key correctness

I'm using the Paillier cryptosystem in a protocol similar to mental poker. In the beginning of the protocol, each player generates a Paillier public key $(n,g)$. Later in the protocol, a player may ...
1
vote
0answers
78 views

Two untrusted party want to exchange data: how to ensure each one gets the data it needs? [duplicate]

Possible Duplicate: Two untrusted party want to exchange data: how to insure each one gets the data it needs? I am trying to come up with what could maybe be a novel algorithm for an ...
1
vote
1answer
58 views

problem with “one time pad” [closed]

I am a french student and I read the post on the forums (How does one attack a two-time pad (i.e. one time pad with key reuse)?). I need your help if possible. I 'm 11 encrypted messages , all ...
1
vote
2answers
218 views

Is there a theoretical maximum useful keysize given the block-size?

Consider a block-cipher $F$ with a $N$-bit block-size and a $M$-bit key-size. That is, if $k$ is a $M$-bit key, $p$ is a $N$-bit block of plain-text and $c$ is a $N$-bit block of cipher-text, then: ...
1
vote
2answers
290 views

Is it possible to generate a 6-digit number using 256-bit encryption?

Reading through some documentation on a piece of software, it claims that a 4-6 digit number is created using a 256-bit encryption process for the purposes of access control. The whole process works ...
0
votes
4answers
1k views

Is a Mersenne-twister cryptographically secure if I truncate the output? [closed]

I want to create an online roulette game. Is it OK if the PRNG is seeded only once, when the user starts the game, or is it recommended to re-seed sometimes during game? Maybe just seeded once a day ...
0
votes
4answers
444 views

Is the One Time Pad (OTP) considered a cryptographic hash function?

As the title states, would the One Time Pad (OTP) be considered a cryptographic hash function?
0
votes
3answers
800 views

Does knowing common prefixes help crack blowfish?

I have strings that are if the form: {static data}{changing data} The beginning static data part is around 20 characters and is common to all strings. The last ...
0
votes
2answers
243 views

How secure would this code be against cryptanalysis?

Simple version: Create software that takes a database of the dictionary, alphabet, and phrases. Randomly generate a database of random strings of letters/numbers/symbols of varying length. Randomly ...
0
votes
2answers
220 views

Why are these techniques not feasible to crack RSA?

For $d = e^{-1} \mod \phi(n)$ $$d\cdot e \operatorname{mod} \phi(n)=1$$ $$d = (e^{-1} \operatorname{mod} \phi(n))$$ With having $e$ and $n$, we can calculate the value of $d$ , the private key for ...
0
votes
3answers
205 views

Is there a way to break this encryption?

I was wondering about making up a simple system to encrypt a file: ...
0
votes
3answers
762 views

Crypto-Compression Algorithms?

I was wondering, whether there exist such algorithms/enciphering procedures which both compress and encrypt the input data. That means, for starters, the output will be both smaller in size and ...
0
votes
3answers
125 views

Security of very simple XOR with random? [duplicate]

I am currently trying to implement a very fast and simple encryption algorithm in Lua for the purpose of using it with ComputerCraft. The main problem is that bitwise operations in Lua (5.2 at least) ...
0
votes
1answer
150 views

What does $\Pi$ represents in cryptography?

I am doing a project in cryptography and while reading a tag generation algorithm for files, I got stuck with the meaning of $\Pi$. The screenshot of the algorithm is inserted below. Here KeyGen ...
0
votes
2answers
651 views

RSA PCKS1 v2.1 RSAES-OAEP algorithm

Using RSA public key (n,e) the encryption of a message is c= (m^e) mod n and the corresponding message is decrypted as ...
0
votes
3answers
796 views

Is AES really used for Top Secret stuff?

I've read almost everywhere that AES-256 can be used for Top Secret material (in the US). Is it really used or is it some kind of decoy to hide the more advanced algorithm they might use ?
0
votes
1answer
57 views

Is there any definition for “generic attack” in context of cryptography or more specific “hash functions”?

I'm searching a definition of "generic attack" in context of cryptography or more specific in context of "hash functions". I searched some books and the web but I did not found any definition for it ...
0
votes
1answer
109 views

Why is DDH not hard over $\mathbb{Z}^*_p$?

Why is Diffie-Hellman key exchange not hard over $\mathbb{Z}^{*}_p$?
0
votes
2answers
380 views

Can a salt for a password hash be public?

For my understanding salts in password hashes are used to prevent the precompuation of plaintext$\to$hashvalues (rainbow tables). I know from different threads, it is not necessary to keep the salt ...
0
votes
3answers
183 views

Alternative to NSA encryption algorithm

I am looking for a strong alternative to elliptic curve cryptography. It should be something that could face quantum computing attacks, but nothing created by the NSA. I heard about isogeny key ...
0
votes
3answers
633 views

AES256-CBC vs AES256-CTR in SSH [duplicate]

I used AES256-CBC to SSH to a remote server. Recently, it stopped working with the following message: ...
0
votes
1answer
363 views

Random Number Generator based on AES CTR

I've just about done tinkering with an open source DRBG, and I sure would appreciate a bit of advice from this community. Here's the link to the project, hosted at codeproject.com. It is written in ...
0
votes
2answers
142 views

Pi Message Encryption [duplicate]

I created a simple yet efficient message encrypting page that will encrypt messages using Pi. Though not being an expert in this area, I am nowhere near sure how secure this is and how easy it would ...
0
votes
3answers
179 views

Are hash functions chaotic?

I'm looking into "bitcoin like" mining processes. Say a security process uses a hash of data as proof that the data was known at some point in time. From what I understand, hash functions are ...
0
votes
2answers
130 views

Why is ElGamalEngine in bouncy castle restricting input data to be less than the length of the group parameter p?

I am currently using the ElGamalEngine of bouncy castle to implement exponential ElGamal for the purpose of making ElGamal additively homomorphic. To do this i raise the message to be encrypted to the ...
0
votes
2answers
120 views

Is RSA encryption the same as signature generation?

Is performing RSA encryption with the private key identical to performing RSA signature generation (signing)?
0
votes
3answers
283 views

Generating a number using SHA512 that users can later verify (once I publish secret seed)

I've wrote following C# method that basically takes 3 seeds and gives you number in 0-100 range. I then use that number for variety of purposes but for this question the most important one is the ...
0
votes
2answers
151 views

Encryption of a number with RSA bigger than $n$

I'm having trouble understanding why encrypting a number $m$, which is larger than $n=p\cdot q$. I've looked into the following threads: Why RSA can't handle numbers above 76? Why does plain RSA ...
0
votes
2answers
116 views

Why use two affine transformations in Multivariate Cryptography?

I'm reading Multivariate Cryptography and would like to know why we use two affine transformations to scramble the central map? Why not use only one?
0
votes
2answers
228 views

What block cipher is used for CBC-MAC?

What block cipher is used for CBC-MAC? DES, AES, 3DES? Or it doesn't matter?
0
votes
2answers
344 views

One Time Pad Question

I have a ciphertext encoded with One Time Pad. I do not know the key. How can I find the possible keys which when decoded, will result in a meaningful plain text?
0
votes
2answers
97 views

A substitution based on a matrix vector product

I choose at random an invertible square matrix A of size 128 in GF(2). I want to use this matrix as a substitution box. Is this a non linear transformation ? I've seen that substitution boxes are ...
0
votes
2answers
270 views

Can you help me with this Random Number Generator function?

By someone's suggestion, I am posting this question from math.stackexchange.com. I want to find out a suitable function or algorithm, which can provide a random sequence like this… Input: $3$ ...
0
votes
2answers
155 views

Strategy to crack a presumed substitution cipher

The ciphertext given is: ejitp spawa qleji taiul rtwll rflrl laoat wsqqj atgac kthls iraoa twlpl qjatw jufrh lhuts qataq itats aittk stqfj cae I've done ...
0
votes
1answer
155 views

How should I treat a new cipher release like Spritz?

I have been looking at both the paper as well as the sourcecode of Spritz — a spongy RC4-like stream cipher and hash function by Ronald L. Rivest and Jacob Schuldt. The paper states We have also ...
0
votes
2answers
160 views

Why are Fortuna entropy pools reset after a reseed?

I've implemented LibTomCrypt's version of fortuna and am wondering about the pool resetting after a reseed. In fortuna.c in libtomcrypt we have the following (which is that part that adds the entropy ...

15 30 50 per page