4
votes
1answer
85 views

Authenticating Very Short (Sub-Block) Data

If I'm encrypting very short/small data - like an int or a long (32 or 64 bits), does it make any sense to authenticate the ciphertext, when using an "online" mode of operation (like EAX)? ...
5
votes
3answers
518 views

Security proofs for CBC mode

I'm looking for different approaches to proofs for the security of CBC mode encryption. What are the best sources of information about this subject?
6
votes
1answer
204 views

Point addition equation in projective co ordinates

How can I get point addition equation for elliptic curves in projective co ordinate system? Can I get it by changing $$ x = X/Z $$ and $$ y =Y/Z $$ in the equation for affine co ordinates' group law? ...
-2
votes
1answer
108 views

Question about the security of Substitution-Permutation Network

In general, we execute key-mixing, substitution and permutation sequentially in a single round in a n-round SPN, but if we execute n-round key-mixing firstly, n-round substitution secondly and n-round ...
4
votes
3answers
3k views

What is the length of an RSA signature?

Is it the same as the bits of the key (So a 2048 bit system will yield a 2048 bit signature)? At most as the key? Or something else entirely?
3
votes
0answers
102 views

Finding algorithm: desire RSA's uniqueness and ECDSA's space efficiency

I am asking for help in finding a signature algorithm with the following property: Given a message m and a private key prikey, ...
3
votes
1answer
129 views

What is the technical name for a public key container in DER format?

I have a public key in the following (format-neutral; the type is specified by the DER bytes) format: ...
4
votes
1answer
149 views

GCM: Math behind update of AAD after ciphertext has been processed

In the Bouncy Castle libraries, the GCM cipher implementation has an interesting property that does not seem described in the GCM papers (neither the NIST or the original paper): Some AAD was sent ...
1
vote
0answers
66 views

Encryption with data loss protection [closed]

Is there an existing format out there that not only encrypts data but also protects against loss of data much like the QR codes can lose up to 33% of it's bits and the message is still recoverable. I ...
1
vote
1answer
135 views

On the privacy of perfect hash functions

I'm digging into the several algorithms for building (Minimal) Perfect Hash Functions. It seems that the recent works provide quite a few very efficient algorithms. However, I'm wondering how a ...
0
votes
1answer
122 views

Pollard's Rho - Constructing the random function

Suppose we are aiming to solve the discrete logarithm problem $\alpha^x=\beta$ in some cyclic group $G=<\alpha>$. Then we are looking for a (uniformly) random sequence of elements of the form ...
3
votes
1answer
450 views

Efficient AES - Use of T-tables

I'm really in trouble! I'm trying to understand how the T-tables in AES encryption work. But I don't know if I get the point. What I understood is that they are used to reduce the whole computation of ...
0
votes
0answers
72 views

Scalar multiplication of elliptic curve point by a fraction

I'm implementing an algorithm that works on a generic finite cyclic group written in the classic multiplicative notation: (G,*) = < g > , n = |g| At a ...
4
votes
1answer
196 views

Why does a perfect secrecy can be achieved when decryption correctness is not totally required?

By Shanon theorem, a perfect secrecy encryption scheme must use a key space of equal size as the message space. But when the correctness requirement is weakened such that $Pr[Dec_k(Enc_k(m))=m]=1/2$ ...
4
votes
3answers
1k views

The difference between being not strongly collision resistant, and not weakly collision resistant?

So I understand the two concepts: (Strong) collision resistance: it is infeasible to find a pair $x \neq x'$ such that $h(x) = h(x')$ Weak collision resistance / 2nd-preimage resistance: for all $x ...
2
votes
2answers
372 views

salsa20 is invertible, useless in CTR mode?

I'm reading the salsa20 spec (sorry for the newbie question, i'm really a newbie here). Every paragraph ends with : "this operation is invertible", I suppose the whole salsa20 algorithm is. If I use ...
1
vote
1answer
196 views

Is Rabin's cryptosystem secure against known-plaintext attacks?

I've bee learning about Rabin's cryptosystem, and I already know that Rabin's cryptosystem is vulnerable to a chosen-ciphertext attack, but I was wondering, is it also vulnerable against ...
0
votes
2answers
275 views

Why would an RSA library tell me that the public key must be at least 512 bits in size?

I'm trying to interoperate with a web service by reverse-engineering it. Currently, when sending a POST request, it encrypts the form data one-by-one with a 'RSA' function. But it's rather weird as ...
0
votes
1answer
78 views

How to calculate kinv from the given k value

I am implementing an ECDSA NIST test vectors verification application. The test vectors are taken from http://csrc.nist.gov/groups/STM/cavp/#09. One of the test vectors is given below: ...
1
vote
1answer
108 views

Does OpenTSA support PKCS11 to talk to HSMs?

We are planning to implement the time-stamping service (RFC 3161) using OpenTSA wanted to know: Does OpenTSA support PKCS-11 (Cryptoki) to talk to HSMs? BTW: I did not find documentation or much ...
19
votes
4answers
11k views

Recommended skills for a job in cryptology [closed]

First let me apologize if this is an ill posed question. Let me also note that I do not in any way seek a comprehensive answer, simply your thoughts on what makes for a valuable asset to a company ...
0
votes
0answers
34 views

Using the same IV instead of random for CTR mode? [duplicate]

Why is it a bad idea to use the same IV instead of random one for CTR mode?
2
votes
3answers
144 views

Feasibility of finding public key when private key is known

We all know that in a public key cryptosystem, given a public key it is extremely hard to compute private key from it. Is it the same case in reverse? Given a private key, how easy is it to compute ...
0
votes
0answers
27 views

Calculating cost of variables and equation in Groth-Sahai (DLIN) proof system

In Groth-Sahai proof system under DLIN assumption [Page 29], they have provided a few number denoting the cost of each variable and equation. Can anyone please explain how did they calculated the ...
0
votes
1answer
99 views

Definition of perfect secrecy using ciphertext

This week my professor in class taught us the definition of perfect secrecy. He said that for any ciphertext the probability that it might have come from any message in the message space should be ...
2
votes
1answer
173 views

Hashing passwords

The common way to store passwords in web applications is this form: $$hash(password||salt)$$ Does it make sense to store them in the following form instead:? ...
1
vote
1answer
138 views

How hard to break a cipher if it has a different key for each word?

Recently I watched the movie 'The Prestige' again but this time the cipher diary impressed me very well. I like to create my own cipher for my diary because I have some time to kill everyday after ...
3
votes
3answers
393 views

Regarding Key Strength with DES and Blowfish

I had a small discussion with my friend on combining two encryption algorithms based on 64-bit keys. Say I have a plain text of 64 bits which I want to encrypt. My Key size is 128 bits. I will use ...
2
votes
1answer
351 views

Will I be able to (ab)use a FIDO U2F compliant hardware token to decrypt data?

I have heard good things about the emerging "FIDO U2F" standard. I am especially interested in having a JavaScript API for cryptographic functions that I can access through a plug-in in a browser. ...
1
vote
0answers
141 views

Engima machine decoding with PC and GPU

I saw this answer at this site about decoding a 3-rotor Engima machine's settings: How cryptographically secure was the original WW2 Enigma machine, from a modern viewpoint? And did some math for ...
2
votes
1answer
115 views

Help to understand the chameleon hash function?

Recently, I'm reading Non-Interactive Key Exchange, in the section 4.2(Towards a factoring-based scheme in the standard model,Page 10), the authors uses $$t\gets ChamH_{hk}(Z||ID;r);\\ Y\gets ...
2
votes
1answer
407 views

Strong key generation using PBKDF

I know that PBKDF2 is very useful for generating strong keys. I'm trying to know is there any additional contribution of the given password to produce even stronger keys. Which key is more secure: ...
3
votes
1answer
150 views

Last Round in DES

I am studying DES for my Cryptoexam .As far as I understood , the initial plaintext is permuted and then the left half is called L0 and Right half is called R0. After that for each round the process ...
-2
votes
1answer
159 views

Why are we advising PKI if we know that quantum computers will break them? [closed]

DNSSEC, ECDHE, RSA, even SSH and all other important specifications, protocols that we rely on and advise people to use them, they use Public key infrastructure. Question: Why do we still use, ...
2
votes
0answers
316 views

Understanding the FMS attack on WEP

I am trying to implement the Fluhrer, Mantin and Shamir attack, one of the ways to break WEP. I seem to have hit on a problem. I have no idea whether or not it is a programming error, or if I don't ...
2
votes
1answer
613 views

How can AES be considered secure when encrypting large files?

Why is AES considered to be secure when encrypting large files since the algorithm is a block cipher? I mean, if the file is larger than the block size, the file will be broken down to fit the ...
5
votes
2answers
222 views

Are there cryptographic hash functions with homomorphic properties? [duplicate]

Are there cryptographic hash functions that have homomorphism-like properties? E.g. satisfying following relation $h(a || b) = h(a) · h(b)$, where $h(x)$ is hash function itself, $x || y$ is ...
-1
votes
1answer
79 views

How Could the Music Industry Go About Implementing Crypto? [closed]

So I'm currently doing the Dan Boneh online Crypto course. In the last problem set there was a question on AACS for DVDs and wondered if a similar method could be used for music. Have the music ...
0
votes
0answers
68 views

Self-Convergent Hashing

What is the name of an algorithm that hashes its result as an embed of larger set of data that results back to the hash? For instance where f(x) is the hashed result and x is the dataset, and ...
1
vote
1answer
62 views

Verifying signature owner (without verifying the actual document)

Programming in Java. I have an RSA key-pair, a document, and a signature created with the Java Signature class, using SHA512WithRSA. In order to verify the signature, of course, I need to provide the ...
0
votes
1answer
78 views
3
votes
1answer
84 views

Can we use numbers as a pad in the Vernam cipher - why or why not?

I was playing with the Vernam cipher on some online converter. But when I tried to encrypt my message string with numbers, it remained unchanged. Moreover, it was ignoring numbers and was encrypting ...
1
vote
0answers
314 views

What does “G2” mean when used with X509 certficates and certificate authorities?

For example "Google Internet Authority G2"?. I thought it was another way of specifying Class 2 (for organizations, for which proof of identity is required) but then see certificates such as "VeriSign ...
1
vote
1answer
102 views

AES Affine Transformation Polynom Representation

I have been reading on the polynomial representation of the AES Sbox in the PDF “Essential Algebraic Structure Within the AES” by Murphy and Robshaw (www.isg.rhul.ac.uk/~sean/crypto.pdf) on page 7, ...
2
votes
2answers
437 views

SHA512withRSA - Looking for details about the Signature Algorithm

I am trying to find information about the Signature Algorithm SHA512withRSA and have been unsuccessful so far. In the current state, the signature is too long, so I would like to check the code for ...
3
votes
1answer
112 views

How can I know when a file was signed?

I have been thinking about digitally signed documents (Word files and PDF files) and can not get over the fact about - how can I securely know when the file was signed? Scenario: If the date of the ...
3
votes
2answers
851 views

breaking fully homomorphic encryption schemes

Fully homomorphic encryption schemes allow one to evaluate any arbitrary computation over encrypted data. Intuitively this seems to be too weak, irrespective of how we achieve this. An adversary who ...
4
votes
2answers
178 views

Quantum key exchange skepticism/confusion

I was hoping somebody could explain some issues I have with quantum key exchange that I don't quite understand. I've read bits and pieces about BB84 but I'm sure my questions probably apply to other ...
1
vote
1answer
64 views

Data I/O operations for encrypted files

I need to implement a simple approach on a Linux system to encrypt/decrypt data and I would appreciate any feedback from you. Basically, I need to change a bit the behavior of the functions ...

15 30 50 per page