1
vote
1answer
162 views

Non-commutitive and nonassociative algebraic structures in cryptography

Are there any cryptographic algorithms or primitives that have been developed and studied that make use of non-commutative or non-associative algebraic structures such as quaternion integers or ...
1
vote
2answers
917 views

RSA decrypting of a huge file by parts [closed]

I need to decrypt a huge file that I own previously encoded by myself with a RSA public key (it's possible for this step using a symmetric algorithm key). Problem is that I can't load it in my ...
1
vote
2answers
144 views

Sender and receiver having different moduli conflicts with encryption and signing in RSA

I should implement a security protocol as a part of which I need to: Encrypt the message with receiver public key. Sign it with my private key. Send it to receiver. Suppose that the system uses a ...
1
vote
1answer
87 views

Must the ciphertext be longer than the key for symmetric encryption?

I am planning to encrypt the different fields of a database independently, using a symmetric encryption scheme (probably 3DES). Since some of the fields are as small as an integer, may that be ...
1
vote
1answer
633 views

How (in)secure is a signature based on DSA with DSS1 (SHA1) in reality?

As I found out the OpenSSL implementation provided by PHP (openssl_sign) only allows DSS1 as the hashing algorithm for DSA signatures (see also my related question). I’d prefer DSA over RSA in my ...
1
vote
1answer
65 views

server aid secure equality test

The scenario is like this: $P_1$ has $m_1$, $P_2$ has $m_2$, they want to compare whether $m_1=m_2$ via the server $S$. After the protocol, only $S$ knows the result, and there is no interaction ...
1
vote
1answer
93 views

order of elliptic curve divisible by prime

Why order "u" of an elliptic curve "E" defined over a finite field "GF (q)" (u = | E / GF (q) |) must be divisible by a large prime number r to be appropriate for cryptographic purposes?
1
vote
1answer
70 views

Problem with anonymously merging information from distributed sources

Some Background: There is an entity with an identifier and some information. The identifier of this entity is a string with a known scheme/pattern(Which means the total number of such possible ...
1
vote
2answers
346 views

weaknesses in ElGamal with public key of small order

Suppose $p=29$, $\alpha = 2 \in F_p^*$ is a generator of $F_p^*$. Bob picks $d \in \{2,...,27\}$ such that $\beta = \alpha ^d=28 \pmod{29}$. He then sends his $(p,\alpha ,\beta)$ to Alice who herself ...
1
vote
1answer
136 views

Common password derivation function for different encryption methods

I'm writing a simple encryption/decryption library which has the following requirements: For key derivation functions, support: $SHA256 \rightarrow bcrypt$ (since $bcrypt$ limits input passphrase ...
1
vote
1answer
158 views

Prefix property for variable length pseudo-random generators

I'm currently working through Katz & Lindell's Introduction to Modern Cryptography. In section 3.4.2, they introduce the definition of a variable output-length pseudorandom generator $G$. The ...
1
vote
1answer
77 views

Knapsack Public to Private (Superincreasing knapsack)

I need to convert a hard knapsack to a superincreasing knapsack. I have these superincreasing values (3,6,11,22,43,87). I also have w = 7 and n = 173. I converted the superincreasing values to hard ...
1
vote
1answer
129 views

Ed25519 with R replaced by H(RAM)?

Ed25519 signatures consist of $(R, s)$, where $s = r + H(RAM)a$ $mod$ $l$, and $R = rB$. This differs from the Schnorr signature where instead of $R$, the signature contains the hash $h=H(RAM)$. ...
1
vote
1answer
82 views

Is the private key static or variable key in the elgamal algorithm?

I read about elgamal algorithm it work like the follow steps Bashir chooses a large random prime p and a primitive root α modulo p. Bashir then chooses a random integer a with 2 ≤ a < p - 1 and ...
1
vote
1answer
71 views

Send a symmetric key generated by one user to other users (more than two) using a server

I am developing a software in which I am using AES for encrypting messages shared in a group. The key is generated by one user, the admin of the group and needs to be shared with other members. How ...
1
vote
1answer
1k views

Value of “counter” when decrypting AES in CTR mode?

If – when using AES in CTR mode – you decide to use the setup where you combine the IV and the block count value into a single value, as suggested here, the first 12 bytes are your IV and the last 4 ...
1
vote
1answer
154 views

Low level explanation of how a message is sent via RSA

I understand that RSA encryption uses this formula: C = M^e (mod N) public key is e and N N is pq - p and q are private key. mod N makes above function one-way ...
1
vote
1answer
91 views

Key exchange if forward secrecy is not an issue

Let's say that we have a cryptosystem where Forward Secrecy and Man-In-The-Middle attacks are not an issue, purely hypothetically. Would it be correct for a key exchange with any given public-key ...
1
vote
1answer
164 views

Encrypt HDD with keyfile and password and allow backing up the keyfile with secret sharing

I want to: Encrypt my whole HDD with a keyfile and a password (meaning that both are required to decrypt it), Be able to back up pieces of the keyfile in several distant locations using Secret ...
1
vote
1answer
86 views

Symmetry between a public and a private key

I know that the private and public key in assymetric cryptography are different and the public is used for encryption while the private for decryption. My question is if they are symmetrical to each ...
1
vote
1answer
84 views

Is there an anonymous non-interactive authorisation scheme with peer-side auth. signature generation?

I implemented a pseudonymous PKI scheme (by K. Zeng @Springer Link), where all peers can change their public keys including its signature on their own. I am looking for a way to extend it with some ...
1
vote
1answer
181 views

Block cipher encryption of decryption with the same key

With block chipers can I assume that Enc(k,Dec(k,m))=m Meaning if I decrypt something with a key k and then encrypt the result with the same key k, do I get what ...
1
vote
1answer
139 views

Generating the keys for the RSA cryptosystem in probabilistic polynomial time

In general every public key cryptosystem ``has'' a probabilistic polynomial time algorithm $G$ such that $G(1^k)=(\textrm{public key}, \textrm{private key=trapdoor})$; $G$ is called the key generator. ...
1
vote
1answer
43 views

Why Distance-128 relation in Plain texts is reflected in Cipher texts

The two text having relation as "\x10\x11" → "\x90\x91" (80+10) will have relation after encryption/decryption also in RC4. Following code clearly describes the problem I am mentioning. ...
1
vote
1answer
175 views

Does AES 256 really make sense in hybrid crypto systems when the PKI is the bottleneck?

AES 256 is used widely in hybrid crypto systems (e.g. SSL/TLS). According to keylength.com a 2048 bit public key corresponds to 112 bits of security. Does it make sense to use AES 256 in this ...
1
vote
1answer
330 views

AES and One Time Passwords

I have used AES to secure my short term wireless network(1 day lifetime). The same symmetric key is used for securing entire network traffic. is it possible to improve security with onetime password ...
1
vote
1answer
441 views

Do I need two keys for AES CBC and HMAC or can I use the same key for both operations?

I am setting up a Python program to encipher messages on the following basis: -from my password, generate 32-byte key from SHA256(password) -generate a 16-byte IV from a PRNG -measure the length of ...
1
vote
1answer
304 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
103 views

Is it possible to deduce the IV from CBC ciphered data, without knowing the key?

The question came up here, which left me thinking: Is it possible to deduce the IV from CBC ciphered data, without knowing the key? And if not, why is it considered a bad idea to create an IV by, for ...
1
vote
1answer
258 views

Demonstrating Diffie-Hellman key exchange using only p, A, B;

I'm trying to figure out how to demonstrate DH key exchange using what is given to me. I'm unsure of how to tackle the problem. Question: Demonstrate Diffie-Hellman key exchange. Given p=104933, ...
1
vote
1answer
135 views

Perl DES PCBC as protection against decryption/crypt analysis

Is error propagation in DES PCBC a good method to prevent decryption/crypt analysis by third parties? If I had a very large file encrypted with Perl's DES with the PCBC option, and then removed the ...
1
vote
1answer
58 views

Can CBC encryption have separate keys for separate blocks of plain text?

Can we have separate key for separate blocks which we get while operating a plain text message using CBC encryption model? If yes, what are it's advantage? Please enlighten me.
1
vote
1answer
296 views

Why does Fortuna RNG use double SHA-256?

In the paper for Fortuna the authors say that you can use any good digest algorithm (obviously as long as its output is 256 bit) and then they recommend double SHA-256. Why? What's the benefit? What ...
1
vote
1answer
87 views

Near preimages, applicable to Bitcoin?

Bitcoin mining relies on generating a smaller hash than the so-called target (a function of the so-called difficultly), thus is vulnerable to a truncated preimage attack (you just need to obtain a ...
1
vote
1answer
203 views

Encryption of numeric value using playfair

I am studying in CSE and in my recent exam paper, A question was asked as: Construct a playfair cipher for Plaintext: semester5 and key:technology. Generally as we are taught yet, there is no ...
1
vote
1answer
138 views

how to use salt to sign a message and how is it effective? [duplicate]

I've had an assignment to sign a file using hash and salt, so I read about salt and I got why it's important when it comes to password, but not to sign messages. How do I sign something using salt? ...
1
vote
1answer
2k views

Difference between known-plaintext attack and forward search attack

I am looking at the different attacks on RSA. I came across known-plaintext attack where the public key can be used to encrypt all possible messages until it finds a match on the sent encrypted ...
1
vote
1answer
586 views

What is the best way to share a shared secret key over HTTPS to be used for HMAC authentication?

I am writing an application in Java that will be using SHA-1 HMAC message authentication. From what I understand, a connection over HTTPS is considered secure enough to share a secret key in plain ...
1
vote
1answer
95 views

Secure Broadcast Channel

I've read a paper that says that one of the "assumptions" that it makes is secure broadcast. Why is this an assumption? Can't a broadcast channel be built with simple primitives--i.e. encrypt and sign ...
1
vote
1answer
224 views

IND-CPA Security

Given a key $K$ (the key is fixed) and a nonce $N$ (changes from one message to another) Using a secure Key derivation function (KDF) such as the ANSI-X9.63-KDF with SHA-1 option to derive a key for ...
1
vote
1answer
509 views

What is the forward cipher function of AES-XTS?

We're using OpenSSLs EVP_aes_265_xts encryption on data (with unique, random, IVs for every new message encrypted) - which is working well. But, I've been asked; what is the forward cipher function ...
1
vote
1answer
171 views

Attacking hashed password by timing attack and other means

This question is inspired by this recent one, which raises a point that need to be made quantitative to be meaningfully discussed. I chose an unusual approach: a new question worded as homework that ...
1
vote
1answer
3k views

AES CBC Security

I am building an Apache webserver with TLS 1.2 and OpenSSL 1.0.1. So far, I have enabled 2 encryption algorithms - ECDHE AES256 GCM and ECHDE AES128 GCM. Firefox and Chrome(ium) use NSS which ...
1
vote
1answer
146 views

Is script execution time a decent source of pseudorandom number generation?

This is for a PHP script for password generation. Naturally there are other things being calculated before the password is generated. But I figure the time it takes for the script to initialize and ...
1
vote
1answer
233 views

Compared to GCM or XTS modes, how secure is H xor R1, E (R2, R1, Message) for confidentiality and integrity?

Let R1 and R2 be (32 byte) random values, and let a H = Hash (R1, R2, Message) be of the same length as each R value. Provided E (R2, R1, Message) is operating in some chaining mode, are there any ...
1
vote
2answers
123 views

Shamir's ID based signatures - Notation issues

I am currently implementing Shamir's ID Based signature scheme as defined in the original paper (archive link). The sign and verify operation are defined as follows: Sign: $s = g * r^{f(t,m)} (\mod n)...
1
vote
1answer
155 views

OTP sequence uniqueness

Is it possible to use Time-based One Time Password (TOTP) algorithms to generate tokens from multiple channels (where a channel is defined as a "user" using a certain shared key $K_c$ for channel $c$),...
1
vote
1answer
114 views

How unsafe is to share parts of a password

The best way to ask this question and have a concrete answer is to set a very specific example. This is the example I would be interested in reading an answer to: Consider that my friend Alice has ...
1
vote
1answer
434 views

crypto design with AES256 MODE OFB

I have the following APP Design key store (contains 1:n user payload as 1:n key store entries) key store salt (is used to extend to key store password to 256 bits, stored in clear text) key store ...
1
vote
2answers
449 views

How can I simulate and measure brute force hacking using RSA?

I want to implement brute force hacking using RSA. How can I simulate and measure time duration? What software (or software-based simulator) would be needed?

15 30 50 per page