2
votes
3answers
152 views

How much processing power should you assume an attacker has?

The answer to this question says that you should assume an attacker can do one billion operations per second: Key Size for Symmetric Homomorphic Encryption Over the Integers Is that a single attacker ...
1
vote
1answer
35 views

TLS Cipher Suite definitions

Based off the various cipher suites available for TLS (which I am looking at here:https://www.thesprawl.org/research/tls-and-ssl-cipher-suites/), can anyone clarify if when the suite contains 'SHA', ...
10
votes
2answers
355 views

How to determine the order of an elliptic curve group from its parameters?

Let $\quad E:\; y^2 = x^3 + ax + b \quad$ be an elliptic curve defined over a finite field $\mathbb F_q$ where $q = p^n$, $a,b \in \mathbb F_q$ and $p \neq 2, 3$. By Hasse's theorem we know that the ...
2
votes
0answers
74 views

Test vectors for TLS PRF function

Does anyone know where I might be able to find test vectors for the PRF function in TLS? (either 1.0 or newer). I'm trying to implement a client and I am getting the BAD Record MAC return after ...
0
votes
1answer
18 views

Fibonacci LFSR, recovering previous bits

Suppose somewhere is Fibonacci LFSR, we know that it has 7 cells and feedback taps are cell 2 and 7. We intercepted part of a stream, and part intercepted is 1010101. Is it possible to recover ...
1
vote
1answer
84 views

Could eVoting on the bitcoin blockchain be done?

I'm basically a crypto noob (and not an english native), so please be indulgent :) I thought about if you could realize an eVoting system with bitcoin. I see 2 major requirements: each citizen ...
0
votes
1answer
92 views

pairing parameters in PBC library

I would like to know what are the pairing parameters of PBC library and what are they used for? Here an example where they are used. I noticed that we can give any file in the param subdirectory. Is ...
2
votes
1answer
119 views

Verify a RSA signature using only RSA encryption

I'm trying to verify a RSA signed message, however, the API that I have access to in that environment only has encrypt and decrypt. I think I understand that verification and encryption with public ...
1
vote
2answers
101 views

qkd - Does BB84 rely on a prearranged code?

First of all, sorry if the title is not that clear, I'll provide an in-depth explanation behind my question. So, basically I was reading about quantum cryptography and came across BB84. The protocol ...
0
votes
1answer
60 views

What are coding schemes for timing channels

I know we can hide information in the inter-packet delays, e.g. we can generate a code-book that each code-word corresponds to a message and is generated by realization of a specific random process. ...
2
votes
1answer
155 views

OpenSSL ECDH key exchange mechanism

I am using FIPS based OpenSSL module for encryption of sensitive data for my desktop socket server and client applications. I am using ECDH for key agreement.The keys public and private pair is ...
0
votes
1answer
40 views

Confusion regarding computing Multiplicative Inverse Modulo P?

May be a silly doubt, please rectify my confusion regarding below problem: For concreteness assume $g=2, p=11, a=6$ and $x=9$ $$A = g^a \bmod p = 2^6 \bmod 11 = 9$$ $$X = g^x \bmod p = 2^9 \bmod 11 ...
0
votes
0answers
25 views

Deriving message from signature (RSA) [duplicate]

Usually signatures are used for verification, and this requires that you pass both the message and the signature. I was wondering; if the message holds to a certain format (for example, valid json ...
5
votes
5answers
1k views

AES decryption vs encryption speed

Let's consider the CTR mode. For a faster encryption/decryption, is it preferable to use the decryption operation of AES, or its encryption ?
0
votes
0answers
54 views

Anonymous messaging using blind signatures

I want to implement a message relay server that knows nothing about who has sent a message but at the same time maintains a message quota per user. While searching for ways to do that on the internet ...
8
votes
3answers
418 views

What is the state of cryptographic obfuscation in 2015?

Cryptographic Obfuscation is a technique that allows one to obfuscate source code in a secure way (as opposed to insecurely mangling it into spaghetti code.) For example, here is a way to protect a ...
6
votes
1answer
242 views

Why Curve25519 for encryption but Ed25519 for signatures?

NaCl and libsodium libraries use Curve25519 for authenticated encryption (actually for sharing a key which is used for encryption) and Ed25519 for signatures. What is the purpose of using different ...
3
votes
1answer
163 views

What is the impact of a server not fully verifying the data in the Client Finished packet of a TLS connection?

F5 BIG-IP devices suffer from a vulnerability in which not all bytes of the Finished packet in a TLS connection are validated. The sort-of technical description can be found here. F5 don't consider it ...
4
votes
1answer
259 views

Using a hash (like SHA-256) vs AES as the source for pseudo-random values in Feistel network?

This question is in relation to Wikipedia article on Format Preserving Encryption It says the following It is also possible to make a FPE algorithm using a Feistel network. A Feistel network ...
1
vote
0answers
44 views

Attribute Based Encryption [duplicate]

Could someone explain the main differences between Key Policy Attribute Based Encryption (KP-ABE) and Ciphertext Policy Attribute Based Encryption using an example? I know that KP-ABE depends on the ...
4
votes
1answer
463 views

POODLE attack on TLS 1.2

The POODLE attack uses the way block ciphers in CBC mode are decrypted in combination with the packet's padding to determine some byte's value. From what I understand, even TLS 1.1 can be vulnerable ...
2
votes
0answers
36 views

Hash-values's length in identification schemes

I am trying to understand the impact of applying a hash function in an identification scheme. It makes reference to the publication "On the length of cryptographic hash-values used in identification ...
2
votes
1answer
216 views

What are the differences between curve NIST P-521 and Edwards E-521 for signature?

I implemented and used the P-521 curve for ECDSA. Signatures are 132 bytes long. It seems that Edwards E-521 is safer but I did not investigated very deeper. What is its signature length ? How is it ...
1
vote
0answers
209 views

How do I create a PKCS#7 or CMS SignedData in python? [closed]

There doesn't appear to be PKCS#7 or CMS support in pyCrypto. I'd appreciate a recommendation on a Python library wth CMS / PKCS#7 support. Ideally, there will be a call that will create return ...
17
votes
1answer
191 views

What are the roles of the simulator in simulation based proofs

I'm trying to better understand simulation based proofs in the UC model - but the guidelines to construct a simulator confuse me. To my understanding, the simulator is activated in two ways: ...
12
votes
1answer
216 views

Edwards / Montgomery ECC with Weierstrass Implementation?

So let's assume I want to perform Ed448 or Ed25519 digital signatures or want to perform a DH key-exchange. Assume further that those curves (Curve448 or Curve25519) are required. But the problem is, ...
1
vote
0answers
33 views

Open source code about the basic Quisquater-Piret DFA of AES-128 [closed]

Where can i find open source code about the basic Quisquater-Piret DFA of AES-128? Are there any websites sharing the code about such physical attacks?
0
votes
0answers
67 views

Can a block cipher encrypt the message to itself (plaintext equal to ciphertext) [duplicate]

The result of the cipher should be indistinguishable from random, but can it happen that cipher produces the ciphertext that is equal to the plaintext as it also lies in the corresponding space? I ...
0
votes
0answers
29 views

In HMAC-MD5 Implementation, why “i_key_pad” and “o_key_pad” if They Are Public and Constant? [duplicate]

Please Consider: English is My Second Language This Wikipedia article on HMACs shows a part of a HMAC-MD5 implementation making use of i_key_pad and ...
2
votes
1answer
87 views

Is there really any way to nullify or avoid MITM attacks?

The question pretty much sums it up. Is there any way to make an attacker who is successfully performing an MITM attack to actually not be able to read or change the messages? Assuming there is no ...
2
votes
0answers
117 views

How to break this PRNG encryption scheme? [closed]

Suppose we have the following symmetric algorithm: key = random bits G = PRNG(seed: key) input = [0,1,1,0,1,0,0,0, 0,1,1,0,1,0,0,1] // "hi" in ascii The key can ...
4
votes
2answers
98 views

Chosen plain text and chosen ciphertext definitions clarification

I am trying to understand a concept of CPA and CCA attack and I cannot get one thing from the definition. If an attacker can execute a CPA attack for something like Send 100 dollars to attacker that ...
5
votes
1answer
257 views

Using same modulus for RSA

I know that there exist some attack when using same modulus. Can two different pairs of RSA key have the same modulus? RSA cracking: The same message is sent to two different people problem But ...
1
vote
2answers
164 views

What are the required security properties for salts?

I was recently thinking about password hashing (maybe caused by the PHC progression). I started to think a little more about it and got stuck at this question: What security properties do ...
2
votes
2answers
178 views

Is it okay to include relative time for true random number generation?

Similar questions have been asked regarding use of time in true random number generation, but I'd like to consider using time as just one source of entropy, complementing others. True random number ...
4
votes
1answer
40 views

Given occasional LFSR samples can the next sample be computed?

Suppose I have access to an LFSR generator output used in a radio communications system, with the LFSR being used to authenticate devices. The system cycles an internal unknown length LFSR (greater ...
3
votes
2answers
84 views

How strong can multiple encryption be?

Suppose I encrypted a homophonic substitution cipher at the level of syllables, trigrams, digraphs, and individual letter with a Vigenere cipher using the keyword cryptography. I would then encrypt ...
2
votes
1answer
60 views

TLS Handshake : Server authentication or only Server ‘s Certificate authentication?

I have some difficulty understanding the way in which the Server is really authenticated by Client in TLS handshake (in case of using RSA key exchange). When Client receives Server ‘s Certificate and ...
1
vote
1answer
44 views

Authenticating with a document

Hope you're having a nice day. I need to implement an authentication system between a "document" (it's not exactly a document, but an object without any computing capacity, only able to store ...
3
votes
2answers
86 views

Is there a practical security difference between OTP with letters and OTP with numbers?

Is there a practical security difference between “OTP with letters” and “OTP with numbers”? If, for example, I encrypt a letter message using Tabula Recta with a random letter key, I would get: ...
1
vote
0answers
49 views

Concepts for realization in applied cryptography [closed]

I'm a computer science student (not a mathematican) and I'm gonna to write a master degree diploma on applied cryptography. Specifically, I'd like to create a realization of some cryptographic stuff ...
7
votes
1answer
236 views

Where is CFB-MAC defined?

I can find descriptions of using CFB mode to create a MAC and even implementations, but cannot find any standard or papers analyzing its security bounds. Is there a standard for CFB-MAC? Where can I ...
0
votes
1answer
97 views

How secure is this modified Bazeries Cylinder?

This device is a modification of the Bazeries cylinder, it has two stacks of 5 rotors which each bear two alphabets plus numbers 0-9, one in correct order and one in random order ( 36 characters in ...
5
votes
2answers
408 views

Is Curve25519 vulnerable to private key exposure in the case of a bad RNG?

I'm really excited by what I've learned of advancements in elliptic-curve cryptography. Curve25519 seems to be a great choice at this point in time, but if I recall correctly, some elliptic curve ...
2
votes
1answer
66 views

Can we use the authentication tag as Nonce / IV for the next message?

Let's assume we're in some scenario requiring transfer of large amounts of data. This means we can only use AES-GCM chunk-for-chunk as its maximal size is restricted to a few GiBs. This means we have ...
3
votes
2answers
1k views

Generate RSA-2048 private key for a VERY fast decryption (don't care if it will be unsecure)

Given public standard RSA exponent e = 65537, is there any (d, n) pairs so that RSA decryption becomes a trivial operation? The modulus n must be no less than 2048-bit. The goal is to get a real ...
7
votes
2answers
275 views

Key Size for Symmetric Homomorphic Encryption Over the Integers

In the paper Fully Homomorphic Encryption over the Integers, it mentions a symmetric key scheme on page 1 and 2. Key Generation: Pick a random odd number $p \epsilon [2^{N-1},2^N)$ Encrypt A Bit m: ...
1
vote
1answer
139 views

Proving an encrypted message contains (but does not 100% consist of) a plain-text message?

I have keypair (u,r), and two pieces of data, X and Y. I reveal X publicly but keep Y secret. Y has high entropy. I then concatenate X and Y, into Z. I encrypt Z, into "encrypt(Z,u) = Q". r is ...
0
votes
0answers
20 views

Proving an encrypted message contains (but does not 100% consist of) a plain-text message? [duplicate]

I have keypair (u,r), and two pieces of data, X and Y. I reveal X publicly but keep Y secret. Y has high entropy. I then combine X and Y, into c(X,Y) = Z. I encrypt Z, into "encrypt(Z,u) = Q". r ...
1
vote
0answers
16 views

Is there any equivalent to the apache xml security library for JSON? [closed]

I'm talking about org.apache.xml.security(santurio) Is there any equivalent library that works with JSON and provides the same set of features? (mostly AES-128 with KEK support)

15 30 50 per page