0
votes
0answers
40 views

Is there a malleable pubkey digital signature scheme?

I'm trying to find a special kind of Digital Signature Scheme. The scheme should allow me to transform a signature s=sign(sk,m) (for a private key sk and a message m) into a signature s'=sign(x,m) ...
0
votes
0answers
44 views

Is timestamping possible without publishing?

The Wikipedia article Trusted Timestamping states that we can timestamp data by publishing it's hash. Publishing can be done either independently or via a third-party publisher, as explained by ...
0
votes
0answers
47 views

Re-encryption mixnet

Can an Elgamal-based re-encryption mechanism be used in a free route mixnet topology? Until 2006 it was not possible, but I couldn't find the later research results or achievements. Can anyone suggest ...
0
votes
0answers
62 views

Is Encryption without knowing the input directly possible at all?

I know the question is rather unusual, but let me clarify what I'm searching for: There is one person, lets call her $Alice$. $Alice$ has $n$ plaintexts $t_1..t_n$ and $n$ public keys $pk_1..pk_n$ of ...
0
votes
0answers
55 views

How to make a crypto-currency robust to 51% attacks?

For Example: In Bitcoin it is theoretically possible to double spend if you control > 50% of the computational power in the network. Also it is possible to apply "selfish mining" with far less than ...
0
votes
0answers
72 views

Any field in a PKI certificate where some text info can be stored?

I want to store 5-10 lines of Text Info in a PKI Certificate. All I want is that when using common tools like openssl command line or certutil from Microsoft, this text info should be displayed as is. ...
0
votes
0answers
73 views

m ∈ Zn \Z*n, RSA works but not secure

If you happen happen to have a message m ∈ Zn \ Z*n, RSA works but not secure. How likely is it going to happen? |n|=1024 bits |p| = 512 bits |q| = 512 bits. Thanks!
0
votes
0answers
30 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 ...
0
votes
0answers
76 views

Defending hybrid encryption schemes against padding oracle attacks

I intend to use a generic integrated/hybrid encryption scheme for transmitting information between a client and a server. Key encapsulation: a 128-bit symmetric key is generated and asymmetrically ...
0
votes
0answers
93 views

Challenge–response authentication which can be done in head?

Say we have door where you have to say a password to pass. If theres someone standing nearby he would hear the password and could also use it. So therefore the doorman gives you a different number ...
0
votes
0answers
61 views

Current standard security level for a hash function?

What is the current level of security needed for a hash function? Until not long ago this was 80 bits. What about now?
0
votes
0answers
47 views

Probability of an ed25519 selective forgery?

What is the expected number of trials required to selectively forge ed25519? Please include how it is calculated.
0
votes
0answers
83 views

Is this a secure (and correct) sign-then-encrypt technique for transferring messages?

After reading some information on the way iMessage works I have been working on writing some code to try my hand at securely transferring messages in a similar manner and I wanted to confirm that the ...
0
votes
0answers
33 views

Problem implementing MixBytes functionality in Groestl

Disclaimer: School work. I am trying to implement Groestl through Java, and have got stuck on the MixBytes section which can be found here section 3.4.5 page 11. As per the description of matrix ...
0
votes
0answers
41 views

Retrieving password from a secret key?

I recently posted this question here: http://stackoverflow.com/questions/22371966/retrieving-the-password-from-a-secret-key asking about retrieving the password encrypted by "PBKDF2WithHmacSHA512" ...
0
votes
0answers
61 views

Sane implementations of Bitcoin cryptography routines w.r.t. side-channel attacks

Bitcoin uses SHA-256, Base58Check, ECDSA (Sep256k1) and RIPEMD-160 as the basis of its encryption (see this article for a short guide on how addresses are created). I would like to create an ...
0
votes
0answers
54 views

Where can I download a database of RSA keys?

I'm looking to do some research into how RSA is used in the wild. I've read through a few papers and it seems other researchers have had no trouble collecting millions of keys to perform analysis on. ...
0
votes
0answers
54 views

Weil pairing implementation - low level programming language

I'm just started to studying elliptic curve cryptosystems. My one month-goal is to write a simple signature system based on the Weil-pairing. Some parts of it can be written without deeper ...
0
votes
0answers
61 views

Authenticated encryption without padding

I want to encrypt data and protect its integrity and confidentiality. However, I cannot increase the length of the data. Are there any cipher modes of operation which provide confidentiality and ...
0
votes
0answers
59 views

encrypted file sharing protocol

I am trying to design a file exchange protocol for learning purposes, inspired by PGP, but fixing some of its shortcomings. Assuming the machine where the creation and decryption of the file happens ...
0
votes
0answers
48 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 ...
0
votes
0answers
21 views

Determine the iteration times using Pollard's rho Method for factoring

Let's say, we have a large number $n=181937053$ and $f(x)=x^2+1$. And also we know that $n=12391 \times 14683$. The problem is that ,using Pollard rho method, can we find the algorithm iteration ...
0
votes
0answers
239 views

Question on mono-alphabetic substitution cipher and poly-alphabetic substitution cipher

You know that a meaningful plaintext in a language with a 26-letter alphabet, like English, is encrypted using either the mono-alphabetic substitution cipher or the poly-alphabetic substitution cipher ...
0
votes
0answers
45 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 ...
0
votes
0answers
57 views

Decryption returns different data

I am new to cryptography so forgive me if I am doing anything stupid. I am following the Cryptography in JAVA book. I am creating my own kerberos. I am stuck at a point. I have Message class which ...
0
votes
0answers
48 views

How can PBKDF2 be used to hash passphrases for ed25519 signing keys?

In trying to find a javascript implementation of ed25519, I came across this which says: The input must be 32 bytes long. As Brian Warner puts it, "Ed25519 keys start life as a 32-byte (256-bit) ...
0
votes
0answers
60 views

How does converting character set affect hash entropy?

Does mapping a large character-set hash onto a small character-set hash lower entropy for a fixed size substring? I'm writing a python app that involves generating passwords for websites. During the ...
0
votes
0answers
49 views

Known vulnerabilities in (EC-)KCDSA

Does anybody know if there's known vulnerabilities in KCDSA/EC-KCDSA? I have been researching for the past few hours and I haven't found anything. Wikipedia has very limited amount of information and ...
0
votes
0answers
49 views

Plaintext patterns leaked based on single bit

Assuming that Elgamal is used as an encryption cipher, where lets say $p$ is 2048bit prime. Is it possible for an attacker to figure out $x$, a secret key, if any part of 2048 bits ciphertext and ...
0
votes
0answers
58 views

What is the best way to verify a curve25519 identity?

A client identifies itself as a curve25519 public key. The server wants to verify the client owns the associated private key. What is the safest −and computationally efficient− way of doing so ? The ...
0
votes
0answers
72 views

how to calculate power $n$ over Gaussian integers?

In the paper Extended RSA cryptosystem and digital signature schemes in the domain of Gaussian integers the authors calculate $(4007621+145835\cdot i)^{7848211742013} \mod (x)$, please explain to me ...
0
votes
0answers
44 views

Key change and key derivation

there are two ways for key change: Key update and re-keying. Which of this methods use KDF (Key Derivation Function) for getting new keys.
0
votes
0answers
66 views

Why do authors execute a leakage resilient election protocol inside a leak-free phase?

In the paper "Multiparty Computation Secure Against Continual Memory Leakage", on page 1241 (that's page 7 of the PDF) under section 2.3, the authors discuss "The Election Protocol" that they use to ...
0
votes
0answers
105 views

Going Blind, Group or Ring?

I have several problems approaching the following problem: Let's assume that we have Alice, Bob and Cathy. Alice wants to present a message to Cathy, showing her that someone else has signed it (Bob), ...
0
votes
0answers
38 views

non-abelian group based cryptography

I've read a lot about non-abelian group based cryptography recently and I am wondering why they only use infinite groups as platform. Is there a special reason or is this an area open for research?
0
votes
0answers
88 views

DES encryption Algorithm

For DES, suppose that key k converts plaintext p into ciphertext c. If k’ represents the bitwise complement of the key k, p’ represents the bitwise complement of the plaintext p, and c’ represents ...
0
votes
0answers
70 views

Question Error Correcting Codes

Let $C$ be a code over the finite field $GF(2)$ with generator matrix $G$ and parity matrix $H$. Let $e+C=C'$ be a coset of code $C$. Let $S$ be a non-singular matrix and $H'=H\times S$. Finally, let ...
0
votes
0answers
95 views

inverse of scalar multiplier in ECC

I am learning to use ECC. i got into situation where i have $Q=abG$, where $G$ is the generator of the finite field formed on EC using a prime $p$ modulus and $a$ , $b$ are random numbers. now suppose ...
0
votes
0answers
36 views

How to select parameters based on some condition

I am implementing a protocol for authentication where parameters need to be selected with $gcd(\mu,\phi)=1$ where $\phi=(p−1)(q−1)$. What is the best way to select the parameters while implementing
0
votes
0answers
54 views

measurable proof of works

We generally use hash functions as prof of work, for example we ask client to compute $x$ where $h(y|x)$ produce a sum starting with 64 successive zero bit. In cryptographic algorithms we can ...
0
votes
0answers
24 views

Different between Shared Key and Common Key in DLP Application

What is the different between Shared Key and Common Key? Are they the same? Shared Key = Common Key?
0
votes
0answers
100 views

So what is quantum cryptography anyway?

I am having difficulty understanding quantum cryptography concepts. I've searched the internet and watched some videos on youtube explaining the topic, but it is still hard to understand how it works. ...
0
votes
0answers
32 views

Correlated or biased coin protocols?

There are a number of papers in the literature describing secure/fair coin flipping protocols. Unfortunately in my case, I am looking for coins that are epsilon-biased or epsilon-correlated. I am ...
0
votes
0answers
101 views

If H(m) = 0 for some m, how can a DSA signature be forged?

If we know for some message $m$ that $H(m) = 0$, how can we forge a DSA signature with only the public key? I got that $g^s*r = (g^x)^r$ where $x$ is the private key, but that's one equation with 2 ...
0
votes
0answers
171 views

Blum-Blum-Shub Cryptosystem

I am given $N$, which is Bob's encryption key. I was able to successfully factor $N$ into $N=p*q$. Alice encrypts a messages for bob and sends $a = [1,1,1,0,0,0,1,0,1,1,0,...]$ $b = 1545164156...$ ...
0
votes
0answers
43 views

Can you clarify the proof that secure LR-two party protocols do not exist?

In the paper “Multiparty Computation Secure Against Continual Memory Leakage” on pg. 1237, the footnote #1 discuss why it is not possible to construct a leakage resilient two-party protocol. But I'm ...
0
votes
0answers
29 views

Masking Parity Check Matrix Goppa

I like know: Is possible that any adversary PPT will be able to find the generator matrix $G$ of Goppa code $GC$, if given $SH$ matrix, where $H$ is a parity check matrix of $GC$ and $S$ is a random ...
0
votes
0answers
22 views

Why does a joint leakage MPC protocol not directly apply to a disjoint leakage requirement?

In the paper "Multiparty Computation Secure Against Continual Memory Leakage" on pg. 1239 the footnote at the bottom points out the difference between $joint$ leakage and $disjoint$ leakage. The ...
0
votes
0answers
72 views

Unblind a RSA blinded signature

I have blinded m = 16 with r= 13, e = 7 and n = 209. This resulted in m' = 464, which led to a s' = 8. Now, I want to unblind this s' by using s = s' * r$^{-1}$ but im stuck at filling in the ...
0
votes
0answers
42 views

Example of CL PKC

I am trying to solve the example of algorithms of Certificateless Signature by manually and solving the mathematics of Algorithms but not succeed while doing mathematical calculations. Please ...

15 30 50 per page