0
votes
1answer
32 views

MD5 update functions

In the hashlib module in python is a function called m.update() where m is a ...
0
votes
0answers
26 views

Arranging Vigenere Cipher into columns [migrated]

As I understand if you arrange a Vigenere cipher into columns you can use the Index Of Coincidence to find out the key length. I'm struggling to write an Algorithm that would take a piece of text and ...
0
votes
0answers
60 views

How can I break this cipher? [closed]

I am currently trying to break: +VZ7ZVcKPavGh4iGArNy and +VZyY1sBOazFh4COBrB2 I have a known plaintext that is: 378734493671000 which encrypts to: +VZyZlAHP6HAgoaPBrBz Is anyone able to explain how ...
0
votes
0answers
53 views

initiate the elliptic curve

when we consider a curve in a prime field for example Weierstrass form and want to initiate it in Miracl,we should give these inputs for initiate curve: ebrick_init(&binst,x,y,a,b,n,window,nb) ...
0
votes
0answers
54 views

Existential Unforgeability of signature scheme against Adaptive Chosen Message Attack

While reading a literature on signature schemes, I came across the concept of Existential Unforgeability of signature scheme against Adaptive Chosen Message Attack. Can anyone point me to the paper ...
0
votes
1answer
31 views

blowfish ecb with openssl doesn't give the expected result

I do the following via the Linux CLI: ...
0
votes
1answer
38 views

HMAC_DRBG Generate Process: requesting N bytes at once different from requesting N bytes in total?

Am I correct in assuming that HMAC_DRBG would return different results if I, e.g. first request 4 bytes followed by a request of another 4 bytes instead of asking for 8 bytes at once? It seems that ...
-1
votes
1answer
48 views

Prove that the affine cipher over Z26 has perfect secrecy if every key is used with equal probability of 1/312

Prove that the affine cipher over Z26 has perfect secrecy if every key is used with equal probability of 1/312. Just some guidance/help with this problem would be greatly appreciated not sure how to ...
1
vote
1answer
46 views

Chess Grandmaster Problem and “Valid” Attacks on Zero-Knowledge Proofs of Identity

A long question here, but I really want to motivate why I'm confused. Consider the following attack on the Schnorr Identification Scheme. Alice chooses a random $k$, computes $\gamma = \alpha^k ...
0
votes
1answer
103 views

Encrypting twice with different modes?

I was using a SOCKS5 proxy today (tunneled through SSH) and I began to wonder what the effect of encrypting twice (TLS over encrypted SOCKS5 in this case) would have on the security of the transmitted ...
0
votes
1answer
57 views

I need to know number of encryption/decryption operations?

If i want to break quadruple DES (say EDED), what is complexity? Like for EDE, it is O(2^112).
4
votes
2answers
150 views

How do you test randomness?

Suppose I receive a list of 1 million coinflips, and I want to know how likely it is that the list was randomly generated. My first thought would be to count the number of heads and tails, which ...
1
vote
1answer
1k views

How does TLS_FALLBACK_SCSV help?

After reading through https://tools.ietf.org/html/draft-ietf-tls-downgrade-scsv-0, I could understand that this option is recommened for use when one has legacy SSL Servers which only support SSLv3. ...
1
vote
1answer
140 views

Compare two approaches for cracking RSA key

I came across these questions while studying for a crypto course, does anyone have any ideas on how to answer these? (a) Random prime numbers of size 1536 bits are chosen to generate an RSA modulus ...
0
votes
1answer
77 views

Cryptography system that limits the length of the encypted message

I have two devices which communicate via sms. This communication should now be encrypted. The devices can only send messages with the lenght of 160 characters. So i am looking for an encryption ...
1
vote
2answers
90 views

Is it just as difficult to find a desired output in a hash digest, for MSB vs LSB?

This question comes to mind after seeing "custom" Bitcoin addresses with some special string at the beginning of the address. They are generated in the same way Bitcoins are "mined", continually ...
-1
votes
0answers
31 views

Side channel vulnerabilities in SW RSA implementations? [closed]

I would like to know a list of practical side channel attacks with references. These attacks should work on SW implementations and I do not consider attacks that require physical access such as power ...
1
vote
2answers
87 views

Comparing Files: Is it better to use multiple hash algorithms or just one?

I'm looking to compare (for byte-for-byte equality) two binary files. I already have the process down: Check for existence etc. Compare file lengths Use a hash or CRC of a sort (right now I use ...
2
votes
1answer
43 views

Use of ElGamal encryption for signature generation

If RSA (textbook RSA that is) generates a digital signature by using the sender's private key, couldn't any cryptosystem (the only two that come to mind are RSA and ElGamal) capable of asymmetric ...
0
votes
0answers
50 views

How would I write my own asymmetric encryption algorithm (not RSA, DES etc)? [closed]

I am looking for some advise on how to go about writing my own asymmetric encryption algorithm. It does not by any means need to be as secure as the commercially available algorithms (RSA etc), it is ...
7
votes
1answer
284 views

What is the history of recommended RSA key sizes?

One can find up to date recommended key sizes for RSA at http://csrc.nist.gov/publications/nistpubs/800-131A/sp800-131A.pdf for example. In short it suggests a key size of at least 2048 bits. Is it ...
0
votes
1answer
38 views

Does the following linear equation hold in bilinear pairings:

Does the following hold in bilinear pairings: $$e(g^{a_1x_1}g^{a_2x_2},g^{c_1}g^{c_2})=e(g^{x_1+x_2},g^{a_1a_2(c_1+c_2)})$$
0
votes
2answers
96 views

AES: Guess Password using the unencrypted text?

I am using the same password for some encrypted files currently (I know this is bad practice, though), and I wonder whether an attacker could decrypt if one decrypted file fell into his hands.
0
votes
3answers
109 views

Elliptic curve parameters

What's the meaning of 160 bit Curve in Elliptic curve ? or 192 or 224 or 256 and etc. And What is the standard for selecting this number of bit ? why they don't say 100 bit curve?
2
votes
1answer
67 views

Encrypted read-only message queue

I'm creating a prototype for a messaging queue with some custom logic (can't re-use any existing solution). One requirement is to have all messages encrypted. There are three classes of nodes ...
-1
votes
2answers
53 views

Output of a Feistel network with all “0” round function

What is the output of an r-round Feistel network when the input is $(L_0, R_0)$ and each round function outputs all 0s, regardless of the input?
1
vote
0answers
74 views

Is there any existing cipher capable of scaling from a 1 bit key up to a one-time-pad?

We have ciphers that handle small amounts of entropy, such as a 256 bit key for AES; and we have one time pads for enciphering 1:1 entropy, such as a 1GB key for a 1GB file if you could ever harvest ...
1
vote
0answers
35 views

How to encrypt letters less than block n using Hill Cipher

I am learning about Hill Cipher and know that it is a block cipher where each block of n letters (considered as an n-component vector) is multiplied by an invertible n × n matrix, again modulus 26. ...
0
votes
0answers
42 views

Need help solving a shift cipher problem?

A three letter alphabet {a, b, c} has probabilities p(a) = .5 and p(b) = p(c) = .25. A shift cipher is applied to pairs of letters. More precisely: plaintexts consist of two-letter sequences of ...
-1
votes
0answers
46 views

Create collision examples with MD5 hash with salt

I'm using the following lines to create a hashed string String source = String.format(%s %s %s", salt, firstPart, secondPart); byte[] bytes = md5(source); ...
2
votes
3answers
95 views

Is it true the longer the key length is the more secure the encryption?

Then why don't we use xxxxxxx bits encryption? what stopping us from using a very lengthy key? I am referring to the encryption we use with SSL
1
vote
0answers
58 views

Is it safe to derive a password from a signature provided by ssh-agent?

I'd like to use a password-based system on a remote host (accessed via SSH) without having to copy-and-paste the password and without storing it on disk. Using the system with some other form of ...
0
votes
1answer
48 views

Key management protocol for end-to-end security on Advanced Metering Infrastructure

I am currently working on a research on end-to-end security implementation for Advanced Metering Infrastructure (AMI). Pardon me if I a bit off topic or not asking the right question as I am ...
1
vote
1answer
58 views

Can Diffie-Hellman be scaled up or force-multiplied?

I'm not too familiar with the math involved with the exchange of keys, I've read it over several times, but math isn't my strong point. My understanding is that smart people are hard at work to ...
1
vote
2answers
107 views

Are LFSRs enough for this?

Consider the following experiment: Let there be a machine which runs (ie. continually clocks) an LFSR of size (ie. number of bits) $b$, having a button that, when pressed, extracts the next $t$ ...
0
votes
2answers
79 views

Database row level encryption scheme

I am wanting to secure some highly sensitive data in a database. This would mean that the data needs to be encrypted and remain secure for 100 years if it were to fall into adversary hands. I also ...
4
votes
1answer
95 views

Generic group model: use of polynomials in the proof of the master theorem

I've been looking at the paper of Boneh, Boyen, Goh Hierarchical Identity Based Encryption with Constant Size Ciphertext which contains a general theorem (Theorem A.2) about the advantage of an ...
1
vote
0answers
44 views

Does NSS fully implement PKCS 11?

I am looking towards using NSS in a Linux application that makes use of a TPM (HSM). So, I am checking the support of PKCS 11 in NSS, at least for the management of Elliptic Curve keys, signature with ...
0
votes
1answer
46 views

How to calculate the entropy of passwords? [duplicate]

Here is a cartoon about password entropy. http://xkcd.com/936/ I dont quite understand how the entropy is calculated in the cartoon assuming they are calculate correctly. But in general, I dont have ...
-1
votes
1answer
44 views

How to use the key from a Diffie Hellman exchange? [closed]

I watched a YouTube video about Diffie-Hellman called "Diffie-Hellman Key Exchange", and it said after doing some modulo operations with the public modulus and generator and the random private ...
4
votes
0answers
116 views

Adding tweak to a block cipher

I know there are XEX, XTS and other ways to add tweak to block cipher without modifying cipher itself. However they are quite slow and/or complex. If we assume we have a secure block cipher round ...
-1
votes
1answer
64 views

Bouncy Castle and Salsa 20

I want to use Salsa 20 in Java, so I downloaded Bouncy Castle, and... it makes no sense to me. I've got it working, but most of my choices were essentially random. But I can't see there anything ...
0
votes
0answers
43 views

Forward Secrecy with pseudorandom functions

Let $H_1$, $H_2$ be keyed hash functions (e.g. $H_i(x) = SHA_{256}(s_i||x)$ for pseudorandom $s_1$, $s_2$). Let $s_n = H_1^k(s_0)$, $k_n = H_2(s_n)$, where $s_0$ is a secret (pseudorandomly chosen ...
2
votes
0answers
40 views

online Vickrey auction using remote coin flip

Is there any published work on implementing a online auction, which uses "remote coin flip" to prevent auctioneer cheating when choosing winner and bid value? Is there any possible way to use remote ...
2
votes
0answers
46 views

How to compute the decompositions used in fast FHE bootstrapping?

Leo Ducas and Daniele Micciancio's recent paper "FHE Bootstrapping in less than a second" gave an exciting result that one can compute the `atom operation' of Fully Homomorphic Encryption (i.e. ...
1
vote
1answer
60 views

Is it possible to 'fake' time for TOTP? (Time-based One-time Password)

TOTP (Time-based One-Time Password) Algorithm is used in Two factor authentication. I understand the algorithm and that current time is used as a variable to generate a token. Wiki page for reference: ...
0
votes
0answers
15 views

Isn't 'exponent' only present in MSME equations in Groth-Sahai framework?

Below are different types of equations in Groth-Sahai framework. All three instantiations, viz. Subgroup Decision, SXDH and DLIN allow to commit to exponent. But, isn't the concept of exponent only ...
0
votes
1answer
55 views

Encrypt a Zip File with Caesar Cipher

I'm trying to understand, why the Filesize of a Caesar Cipher encrypted foo.txt.zip File is smaller than a Caesar cipher encrypted foo.txt File. For example: Foo.txt size: 90bytes foo.txt.Caesar.enc ...
1
vote
1answer
58 views

How can convert affine to Jacobian coordinates?

I have a point in affine coordinates: $(x,y)$. What should I do when I want to convert to $(X,Y,Z)$ in Jacobian coordinates? I need it for calculating ECC in a prime field.
3
votes
1answer
70 views

Where did the SHAKEs come from in SHA3?

Where did SHAKE128 and SHAKE256 originate from? I am trying to find them in the original Keccak documentation but can't find them. Is it some special mode of Keccak referenced in the documentation? ...

15 30 50 per page