1
vote
1answer
1k views

Reduction of Integer factorization to Discrete logarithm problem

I was reading Eric Bach paper entitles "Discrete logarithms and factoring", in which he states the following reductions: solving the integer factorization problem suffices to solve the discrete ...
1
vote
1answer
350 views

What operations are used in symmetric cryptography and why?

In continuation to Why are bitwise rotations used in cryptography?: what other operations are commonly used in symmetric cryptography? Are there particular operations on numbers that are good for ...
1
vote
1answer
3k views

How long to bruteforce a RSA key [duplicate]

Suppose I have a 2048 bit RSA public key, and want to brute force the corresponding private key. I guess there are 2048^16 possible combinations? How long would this take me to brute force with an ...
1
vote
2answers
108 views

Prepend information about encryption implementation to the stored data

I want to preface this by saying i will not be using any of this code/information in a live project, this is only for learning/fun (so I welcome some speculation) I was looking at how the PHP crypt() ...
1
vote
1answer
922 views

How is text converted to a number for RSA? [duplicate]

According to http://en.wikipedia.org/wiki/RSA_%28algorithm%29#Key_generation the key length is the number of bits in n. So how can a message of many megabytes (millions of bits) be modded by a 1024 ...
1
vote
1answer
344 views

ECC Point Multiplication of Product

I can calculate $Q = a\,b\,G$ in several ways: $Q = a \, (b \, G)$ or $Q = b \, (a \, G)$. These give the same result, as expected. But if I do $c = (a \, b) \bmod n$ where $a \, b$ is much greater ...
1
vote
1answer
176 views

Which keys are necessary to decrypt Application data in a SSL connection?

I'm debugging an application which communicates between client and server using a SSL/TLS connection, and want to capture and analyze the sent data. Are the client write keys and server write keys ...
1
vote
2answers
403 views

Are there any hand ciphers not obsoleted by computer cryptanalysis? [duplicate]

Computerized cryptanalysis has obviously made formerly "secure" hand ciphers like Playfair, Four Square, and the Hill Cipher obsolete because they can be defeated in seconds. But is there a hand ...
1
vote
1answer
165 views

Is this a sensible cryptographic protocol intending to reduce the impact of compromised security?

I'm in the process of designing a cryptographic protocol which will reduce the impact an attacker will have if they gained root access to a server storing data. The basic crux of it is that keys ...
1
vote
1answer
415 views

Designing a security system from scratch with a custom protocol, suggestions needed

For the reasons I cannot go into details, I need to design my own protocol and overall security system which will be used to establish secure data exchange between various devices (most notably ...
1
vote
1answer
389 views

What does $(\mathbb{Z}_n^*)^2$ mean?

In a paper they write once, $(\mathbb{Z}_n^*)^2$. Is this the group of quadratic residues or is it something else? Here the theorem: Under the strong RSA assumption, given a modulus $n$, along with ...
1
vote
1answer
130 views

How to learn the first bit of m in padded RSA

Consider the following version of padded RSA encryption, where encryption of $m$ is done by setting $m′ = (0^k~||~r~||~00000000~||~m)$ for a random $r$ (of length 8 btyes = 64 bits) and then computing ...
1
vote
2answers
283 views

How secure is passing a MAC to Python's random.seed before using random.choice to generate a MAC?

I'd like to use Python's random.choice seeded with a HMAC-SHA1 tag to generate a MAC encoded in a variable set of chars. ...
1
vote
1answer
753 views

Proper uses for CTR and CBC AES block cipher modes

Assuming the following: Key is randomly generated is being used (32 bytes+) IV is also randomly generated Crypto random key generator is used Data being encrypted contains common bytes like ...
1
vote
1answer
269 views

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

I have found an encryption algorithm named ECKS-PS (published in the paper Efficient conjunctive keyword search on encrypted data storage system) that allows an user to search in encrypted data. All ...
1
vote
1answer
105 views

PBKDF2 when dkLen and hLen have the same size

I was reading RFC 2898 and something is not clear to me. When I use PBKDF2 with SHA-256 and I want a derived key with length 32 bytes (the same length as my hash function output), your derived key ...
1
vote
1answer
217 views

Sensible usecase for restricting special characters in passwords? [closed]

Please See Why Not Allow Special Characters In a Password on Security. Several websites I've come across limit the allowed special characters for a password. My thought was, it should all be ...
1
vote
1answer
231 views

Exponentiation In PBC library

I need to compute a function $h^l$, where h is an element of G2 and l is a rational number. How can this be done using the PBC library? I have converted the h to ...
1
vote
1answer
5k views

Simple example for CP-ABE (Ciphertext policy attribute-based encryption)

I'm currently working on Ciphertext Policy Attribute-Based Encryption (CP-ABE). So far I'm only using it with a basic understanding how it actually works. Now I want to understand it a bit better, but ...
1
vote
1answer
218 views

Why is Blum-Goldwasser not IND-CCA-2 secure?

Consider the Blum-Goldwasser encryption scheme as described on Wikipedia. I was told that it was not IND-CCA-2 secure. I heard there was malleabilty, probably it has to do with XOR-ing. But I do not ...
1
vote
1answer
90 views

Could use an explanation of the notation for an oracle adversary

In the definition below, what exactly does it mean for the adversary (not even sure that's the correct term?) to equal one? $$ \underset{K}{Pr} \left [A^{F_k(\cdot)} = 1 \right ] $$ Source (Page ...
1
vote
1answer
2k views

AES key/ciphertext space sizes

This is giving me a brain ache now... If I have AES-128, block is 128 bit, then every plaintext (128-bit) can be encrypted to some ciphertext that is also 128-bit. This is the block size. But: 128-bit ...
1
vote
1answer
178 views

What are unified addition and differential addition in elliptic curve point arithmetic?

A lot of papers use these terms but I do not find a proper explanation of them. Can somebody tell the meaning / difference / intuition / application and if possible with an example.
1
vote
1answer
117 views

Tell me about non-MD5/SHA1 key fingerprints

I understand there are specifications for public-key fingerprints that use modern hash algorithms like SHA2. What are they?
1
vote
2answers
175 views

Is such a crypto-system available?

$E(k_1, pt) = c_1, E(k_2, c_1) = c_2, D(k_{new}, c_2) = pt$, where $k_{new} = f(k_1, k_2).$ Sharing $k_{new}$ and $k_2$ should reveal no information about $k_1$. Clarifications: Being able to ...
1
vote
1answer
193 views

Entropy in natural language texts

I have a couple of related questions: I read about an estimate, ascribed to Turing, of the entropy of English text to be between 0.6 and 1.3 bits per letter. The modern day corpus, including the huge ...
1
vote
1answer
385 views

What are some different cryptography methods?

Some of the most effective cryptography methods and algorithms are based of factoring large prime numbers (e.g. RSA). I'm curious whether there are some other cryptography methods. Somethings that is ...
1
vote
1answer
132 views

Trapdoor implementation

Please refer to this secure index paper. On page#6, a trapdoor is defined as ...
1
vote
2answers
344 views

Store hashed email and compare hash values

I have a number of different systems sending me email addresses, but I don't actually need the underlying email, just a hash of the email address. I know I can compare hash values to find matches ...
1
vote
3answers
1k views

Kryptos : K1. What is the origin of the “palimpsest” keyword?

I'm studying the Kryptos sculpture with its cryptographic puzzles K1 to K4. I understand that the keyword "palimpsest" was reverse-engineered using the tableau (and brute-force computer processing), ...
1
vote
2answers
1k views

What are monotonic and non monotonic access structures in ABE ?

While reading Attribute Based Encryption Schemes, I did not quite understand what a monotonic access structure or non monotonic access structures are. Is there a popular explanation of those terms ? ...
1
vote
1answer
188 views

What would the Internet be like without public-key cryptography?

The functioning of the Internet as we know it nowadays depends very heavily on public-key cryptography, including several key root systems that depend on its asymmetric properties. But what would it ...
1
vote
1answer
98 views

tower of extension field

while working on tate pairing, i have to implement towering technique. like i have point p on F(q) and point Q(F(q^k)) (here embedding degree k=12 for BN curve). instead of taking a point Q on ...
1
vote
1answer
544 views

AES Secure key generation and storage

I have a client-server application, which is transferring data between its components in a secure way. I currently use AES algorithm with CBC mode to transfer data and file. This is the scenario: ...
1
vote
2answers
175 views

Bent Combining Functions

Bent functions are boolean functions with maximum nonlinearity and are widely studied for their potential applications in cryptography. Lets say you wanted to use a simple two input AND gate as a ...
1
vote
1answer
159 views

Ensuring integrity of a client side script

I want a script that is running on the client to compute a collision resistant hash and send it to a server. I need to ensure that the script which performs this hash is not altered in any malicious ...
1
vote
1answer
74 views

Secure MAC implies that probability of same tags on different messages is negligible

So let any secure MAC (message authentication code) be given. Intuitively, I think it is clear that the probability of getting the same tag on two different messages is very small, i.e. negligible. I ...
1
vote
1answer
558 views

How do unkeyed hash functions (for MDCs) provide security?

Unkeyed hash functions are, by definition, hash functions computed without a key. SHA-1 is an example. MDCs (message digest codes) are a subclass of unkeyed hash functions. How are unkeyed hash ...
1
vote
1answer
470 views

Montgomery Exponentiation - selecting input value R for a given BigInteger

I have Montgomery exponentiation working, but it's working quite slow. I suspect there are two reasons for this - I implemented it bit size instead of word size (I didn't realize at the time that ...
1
vote
1answer
281 views

Ways to protect flash player against MITM diffie hellman

We have a server, which sends content encrypted with AES128 or RC4 to a flash client over an insecure HTTP channel. The encryption key is negotiated using Diffie Hellman. The problem: Diffie ...
1
vote
1answer
370 views

password entropy calculation

I have the following password with a prescribed format: it starts with a fixed value of 111, followed by 2 random lower case letters and then lastly a random digit: "111""2 Random lowercase ...
1
vote
1answer
121 views

Using pairings to verify an extended euclidean relation without leaking the values?

Let $P_i(x)$ be polynomials $i=1,...,n$, $s$ some value, and $g$ a generator of a group $G$ where the discrete logarithm is hard. Assume a prover wants to convince a verifier having access to the ...
1
vote
1answer
236 views

Tree hash and multithreading for parallelism

I am using tree hash mode of Skein on a 16 core processor. Will it automatically employ parallelism using more than one cores or do I have to use multi-threading within the tree hash for parallel ...
1
vote
3answers
186 views

verify contents, but not order

Is there an algorithm that can be used to verify the contents of a cyphertext, but not the order of the elements? I am thinking that a deck of cards could be shuffled, and it must be verifiable that ...
1
vote
1answer
349 views

Blowfish Encryptions in Bcrypt hashing algorithm

I am trying to understand the ExpandKey function used in the bcrypt hashing algorithm. As per the documentation of bcrypt hashing algorithm on USENIX here: ...
1
vote
1answer
552 views

Recommended Books for Cryptography : Theory and Implementation [closed]

It is a great idea if experts in Cryptography from mathematicians to security engineers introduce books and textbooks which they think is helpful or instructive for all people interested in the ...
1
vote
1answer
339 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 ...
1
vote
1answer
63 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 ...
1
vote
1answer
668 views

Deniability of OTR messaging

I've been looking at the off-the-record messaging protocol, and there is something about its deniability property that seems strange to me. Consider the following scenario: In the course of an ...
1
vote
1answer
202 views

Do Quantum Key Distribution and Physical Unclonable Functions combine, and how?

I see there's a project to combine Quantum Key Distribution, Physical Unclonable Functions, and classical crypto, in order to secure a high speed (100Gb/s) optical link. While there does not seem to ...

15 30 50 per page