0
votes
1answer
410 views

Calculating the inverse modularity of the determinant for Hill cipher

I'm trying to decrypt a message encrypted with Hill Cipher, but I don't understand how to find the determinant so it solves the equation det * 1/det = 1 mod 26. The determinant for my key matrix is ...
0
votes
1answer
149 views

How can the Diffie-Hellman key exchange be extended to three parties? [duplicate]

Possible Duplicate: Can one generalize the Diffie-Hellman key exchange to three or more parties? How can Alice, Bob, and Charlie share a common secret key using an extended version of the ...
0
votes
1answer
153 views

RSA 1024bit decryption performance

i want to know how many RSA 1024 bit long key decryption can a regular pentium4 computer do per second ? how to calculate RSA performance and determine its remaining time ?
0
votes
1answer
313 views

Cryptanalysing Affine cipher

I am trying to cryptanalyse a cipher–text encrypted by Affine cipher. The encryption formula is: $c = f(x) = (ax+b)\bmod m$, where $a$ and $b$ are unknown constants; $x$ is a plain-text symbol, and ...
0
votes
1answer
94 views

Digital Certificate Chain Verification

Does a certificate contain the complete chain of all certificates up to the trusted root certificate, or does the program that verifies certificates have to fetch each parent certificate individually ...
0
votes
1answer
50 views

Design question for a service that signs messages on behalf of a user

I'm working on a messaging service that lets users author messages and have them signed with an RSA key. The key is used for identity purposes only and can be revoked, so compromising the private key ...
0
votes
1answer
162 views

Polynomial for secure communication

Can we use a polynomial $P(x)$ to securely communicate ? For example Alice & Bob agree on a degree of a polynomial. The value $x$ & the coeficients are generated from a seed using a hash ...
0
votes
1answer
70 views

Random decomposition of symmetric key

Considering a symmetric cipher (i.e : AES in counter mode), is it possible for any given key to be randomly decomposed into other keys without knowing the message or the ciphertext, such as : 100 = ...
0
votes
1answer
113 views

Are there any multiparty homomorphic encryption schemes?

Are there any multiparty homomorphic encryption schemes ? Most of the literature is about two party schemes . Is there any generalization made for n party ?
0
votes
1answer
317 views

How to hack the new save encryption on ipad for uplink? [closed]

The new iPad version of Uplink appears to be using some new saving mechanic than the PC/Mac Version. Macs and PCs use 'RedShirt' but the iPad appears to instead be using 'SAV62' at the start of saves, ...
0
votes
1answer
135 views

RC4 S-Box and Keystream

I'm studying the RC4 algorithm and I have the following questions: On all questions assume that an expanded (2048-bit) key is used, and that the first 4096 bytes of the KeystreamIm are discarded. ...
0
votes
1answer
116 views

RSA Signature - Multiple Use Weakness

I cite from Fundamentals of Computer Security (Chapter 7 on Digital Signature, Paragraph 7.3 on RSA Signatures, page 289): Multiple uses of the RSA Signature scheme tend to weaken it. The way out ...
0
votes
2answers
91 views

Distinguishing Encryption Methods from the Output

Suppose that you see all IP communication packets between two computers for a day, as they pass through a connecting router, and this amounts to 10MB. You additionally know that all data transmission ...
0
votes
1answer
104 views

Decimal to binary question [closed]

This is an easy question, but I can't explain it lol, how would you guys explain it? There is a procedure for converting a decimal number to binary in the following way: repeatedly divide the number ...
0
votes
1answer
176 views

Why does my implementation of CBC mode only decrypt the first block correctly? [closed]

I have the following code that uses a CBC mode to encrypt a text by dividing it to 3-elements block. But it only works correctly on the first block which is xored with the IV. ...
0
votes
1answer
118 views

ECDSA - point order criterion

i am creating some primitive demostration for ECDSA over small curve ( p < 229). But my implementation have some weird issues. Verify process return false even if the signature is correct. Because ...
0
votes
2answers
69 views

Encrypting documents through a proxy key

Suppose I'm developing an app to secure a lot of documents. These documents were encrypted (say, using AES) with a key X. This key X is basically the password that the user enters before wanting to ...
0
votes
1answer
110 views

amateur cryptosystem -> a very long boolean expression -> attempt to reduce it [closed]

(newbie here) I try to analyze amateur cryptosystem and wondering, if it's possible to reduce it as reduce a very long boolean expression? What tool can I try to use?
0
votes
1answer
79 views

Determine complexity of a SAT problem

Is there a standard way to determine a complexity of the specified SAT problem? I'm researching algebraic cryptanalysis and came to solving multivariate quadratic equation systems using CryptoMiniSat. ...
0
votes
1answer
135 views

How are the primes used to generate RSA keys?

I am confused about how keys in RSA asymmetric encryption are generated and what the implications for open communications are. Textbooks say the one-way function is merely two primes (with some ...
0
votes
1answer
199 views

Brute forcing Cardan grille

Having a "rotating" square Cardan Grill with sides long n cells, how could i determinate the cost of a brute-force attack? How many configurations should be considered to perform an exhaustive ...
0
votes
1answer
139 views

Block ordering and security in a MAC?

To authenticate a message $m = m_1 \,\|\, \dots \,\|\,m_n$ the tag $t := F_k(r) \oplus F_k(m_1) \oplus \dotsb \oplus F_k(m_n)$ is used, where r is uniform random number $(0,1)^n$ and $m=(0,1)^n$. Even ...
0
votes
1answer
373 views

What are open problems in cryptography? [closed]

I would be starting groundwork for my thesis in cryptography , I would like to know what are current open problems in cryptography, few I know of are Fully Homomorphic Encryption Functional ...
0
votes
1answer
389 views

iSeries (AS/400) Database File: password encryption

I am helping with a project in which an old software system on an iSeries is having a brand new .NET UI applied to it. It's going well... except... In order to allow users to login and maintain ...
0
votes
0answers
34 views

Physical Level Encryption

What types of algorithms that are capable of signing a message are out there that run on a physical level, e.g. lacking the infrastructure of a standard PC, no memory, processor or motherboard in the ...
0
votes
0answers
29 views

calculating beta for elgamal elliptic curves

Suppose we use elgamal elliptic curves for secure communication. Bob selects a prime $p$, an elliptic curve $E$, a point $\alpha$ on $E \pmod p$, and a secret integer $f$. Suppose that Bob has ...
0
votes
0answers
33 views

SHA-1: Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output? [duplicate]

Is there any mathematical result that gives us the minimum number of 1's in a 160-bit SHA-1 hash output? What is the probability that the 160 bit result contains at least 128 1's?
0
votes
1answer
26 views

PKCS#11: Which CKK_types are supported by CKM_PKCS5_PBKD2?

On Solaris there's a function pkcs11_PasswdToKey() which is a wrapper of C_GenerateKey(). I made a simple test and it turned out ...
0
votes
1answer
53 views

Does SRP reduce to DH key echange when shared password is not secret?

I can find JavaScript implementations of SRP (Secure Remote Password protocol), but nothing that inspires confidence for Diffie-Hellmen key exchange. I also have a separate need for SRP later. I ...
0
votes
0answers
27 views

Decrypting TLS in Wireshark when using DHE_RSA ciphersuites [migrated]

How can I decrypt TLS messages when an ephemeral Diffie-Hellman ciphersuite is used? I am able to expose the premaster secret and master secret from the SSL Client. Using that, how to decrypt the ...
0
votes
1answer
42 views

recommendation for steganography tool? [closed]

I am trying to find a good and referenced steganography tool to make some tests, it its freeware it would be great. Does anyone knows any recommended tool for this task? I have found some free ...
0
votes
0answers
54 views

Perfect secrecy Proof

A symmetric cryptosystem have perfect secrecy $\iff$ for all distribution over the messages space, $M$, and for all $m0$, $m1$ (messages) and any ciphertext $c$, $$P(c|m0) = P(c|m1).$$ I got ...
0
votes
0answers
35 views

Interesting game: decipher the following sequence [closed]

Decode the following sequence: KROWE MOHSI HTDEY OJNEI The original cipher is printed in such matrix format
0
votes
0answers
85 views

Adding and multiplication in jacobian coordinates

How can I derive formulas for adding and multiplication of 2 points in Jacobian coordinates $(x,y) = (\frac{X}{Z^2},\frac{Y}{Z^3})$ over an elliptic curve?
0
votes
0answers
16 views

LT codes with Homomorphic hashing [duplicate]

I have been working on a project implementing LT codes with Homomorphic hashing (inspired from http://blog.notdot.net/2012/08/Damn-Cool-Algorithms-Homomorphic-Hashing and ...
0
votes
0answers
125 views

How can I become familiar with the logic syntax used in Cryptography papers? [closed]

I'm having to write a 5000 word essay on Cryptography, and many (if not all) of the papers I've read on the topics have logic syntax I simply don't understand. How can I become familiar with the ...
0
votes
0answers
19 views

ECKS-PS algorithm: searching in encrypted data; bilinear maps [duplicate]

I have found an encryption algorithm named ECKS-PS (published in a paper named 'efficient conjunctive keyword search on encrypted data storage system', written by Jin Wook Byun, Dong Hoon Lee, and ...
0
votes
0answers
52 views

How do I generate decryption keys for the IDEA algorithm from the 128 bit key?

I am trying to implement IDEA algorithm in C#, just to learn how it works. I have taken a 128 bit binary key and generated the 52 encryption keys using the following code: ...
0
votes
0answers
71 views

How secure is this perl script to use an AES encryption on files? [closed]

I am not entierly sure if it is appropriate to ask such a question here, but then again, I don't know a better place. If it is the wrong place, let me know, and I will remove it. Could someone share ...
0
votes
0answers
54 views

How fast can a wrong decryption key be detected using ECC?

When can a decryption function detect that the ECC key I use for decryption is incorrect? Is it possible to do that during initialization, or does the complete message have to be decrypted to do that? ...
0
votes
0answers
76 views

How to choose between AES-CCM and AES-GCM for storage volume encryption

We are using the encryption built into Solaris 11 ZFS, which offers the choice between CCM (CBC counter mode) and GCM (Galois counter mode). What are the pros and cons of choosing each of these cipher ...
0
votes
0answers
80 views

Secure modulus length for Diffie-Hellman

What is secure modulus length for modular exponentiation so that finding discrete log is computationaly impossible?
0
votes
1answer
139 views

Anonymity in end to end encryption

Considering a scenario of anonymous data transfer between seller and buyer using proxies. If we consider that there are three proxies that are being selected by buyer to obtain data from different ...
0
votes
0answers
54 views

What is the significance of i^Q mod P = 1 and are there any special properties to be aware of?

I'm studying UProve, and one of the fundamental components of this technology is based upon the relationship between i^Q mod P = 1 Lacking a specific name I can call this mathematical ...
0
votes
0answers
57 views

Method and explanation for calculating difference in speed between DES and RSA

Our assignment asks us to convert an RSA speed in bytes per second to a DES speed in bytes per second. Our professor's treatment of this ("RSA is 100 times slower than DES") seems insufficient. Could ...
0
votes
0answers
74 views

computing inverses in truncated polynomial rings manually for NTRU encryption

Can someone explain how to find inverses in truncated polynomial rings manually (i.e. on pen and paper)? As an example from the tutorial: Example. Take $N=7$, $q=11$, $a=3+2X^2-3X^4+X^6$. The ...
0
votes
0answers
36 views

Is it possible to determine the group order by knowing the “public” and “private” key exponents in an RSA group?

I have an RSA group with modulus $n = p \cdot q$, two safe primes $p=2p'+1$ and $q=2q'+1$ and the "public" and "private" key exponents $d$ and $e$. $\phi(n) = 4p'q'$ is the order of the RSA group. If ...
0
votes
0answers
54 views

Strength of Combining Hash functions [duplicate]

If I combine two hash functions, what will the impact on the strength of the resulting function. If I combine in following way: H1*H2 (multiply) H1 + H2 (concat) H1 Xor H2 H1 (H2) EDIT: Lets say H1 ...
0
votes
0answers
63 views

Use curve25519 for ElGamal crypto

DJB described curve25519 in his paper which can be found here: http://cr.yp.to/ecdh/curve25519-20060209.pdf. It seems that the main purpose was for Diffie-Hellman key exchange. I think this means that ...
0
votes
0answers
44 views

“Free” key exchange in a Ed25519 PKI? [duplicate]

Assuming a PKI where everyone has a public/private Ed25519 keypair, can a secure shared secret be computed by calculating abB when Alice has keypair ...

15 30 50 per page
1 36 37 38 39 40 42