Skip to main content
Cryptography

Return to Question

Post Merged (destination) from crypto.stackexchange.com/questions/89956/…
Tweeted twitter.com/#!/StackCrypto/status/330183994027167744
mark the quote as such
Source Link
Paŭlo Ebermann
Paŭlo Ebermann
  • 22.8k
  • 7
  • 81
  • 118

In my lecture, the lecturer said:

Let $K$ be the key generation algorithm. Given a security parameter represented in unary, $1^k$, $K(1^k)$ will output a keypair $(pk; sk)$, known as the public key and the private (or secret) key, respectively.

Let $K$ be the key generation algorithm. Given a security parameter represented in unary, $1^k$, $K(1^k)$ will output a keypair $(pk; sk)$, known as the public key and the private (or secret) key, respectively.

My question is: When I want to implement the cryptosystem, how should I represent this $1^k$? When I implement the key generation procedure, do I literally require callers to pass me a string of $k$ one-bits that the procedure will never use? And, if so, why is it there in the first place?

In my lecture, the lecturer said:

Let $K$ be the key generation algorithm. Given a security parameter represented in unary, $1^k$, $K(1^k)$ will output a keypair $(pk; sk)$, known as the public key and the private (or secret) key, respectively.

My question is: When I want to implement the cryptosystem, how should I represent this $1^k$? When I implement the key generation procedure, do I literally require callers to pass me a string of $k$ one-bits that the procedure will never use? And, if so, why is it there in the first place?

In my lecture, the lecturer said:

Let $K$ be the key generation algorithm. Given a security parameter represented in unary, $1^k$, $K(1^k)$ will output a keypair $(pk; sk)$, known as the public key and the private (or secret) key, respectively.

My question is: When I want to implement the cryptosystem, how should I represent this $1^k$? When I implement the key generation procedure, do I literally require callers to pass me a string of $k$ one-bits that the procedure will never use? And, if so, why is it there in the first place?

added 179 characters in body; edited tags; edited title
Source Link
D.W.
D.W.
  • 36.7k
  • 13
  • 105
  • 193

Unary Parameter Key Why does key generation take an input $1^k$, and how do I represent it in practice?

In my lecture say, the lecturer said:

Let be $K$ abe the key generation algorithm. Given a security parameter repre- sentedrepresented in unary, $1^k$, $K(1^k)$ will output a keypair $(pk; sk)$, known as the public key and the private (or secret) key, respectively.

My question is: In the McEliece Cryptosystem HowWhen I will be ablewant to implement the cryptosystem, how should I represent this $1^k$. Is? When I implement the key generation procedure, do I literally require callers to pass me a string of $k$ one-bits that the procedure will never use? And, dimension capable correctif so, why is it there in the first place?

Unary Parameter Key

In my lecture say:

Let be $K$ a the key generation algorithm. Given a security parameter repre- sented in unary, $1^k$, $K(1^k)$ will output a keypair $(pk; sk)$, known as the public key and the private (or secret) key, respectively.

My question is: In the McEliece Cryptosystem How I will be able to represent this $1^k$. Is $k$, dimension capable correct?

Why does key generation take an input $1^k$, and how do I represent it in practice?

In my lecture, the lecturer said:

Let $K$ be the key generation algorithm. Given a security parameter represented in unary, $1^k$, $K(1^k)$ will output a keypair $(pk; sk)$, known as the public key and the private (or secret) key, respectively.

My question is: When I want to implement the cryptosystem, how should I represent this $1^k$? When I implement the key generation procedure, do I literally require callers to pass me a string of $k$ one-bits that the procedure will never use? And, if so, why is it there in the first place?

added 35 characters in body
Source Link
juaninf
juaninf
  • 2.8k
  • 3
  • 19
  • 28

In my lecture say:

Let be $K$ a the key generation algorithm. Given a security parameter repre- sented in unary, $1^k$, $K(1^k)$ will output a keypair $(pk; sk)$, known as the public key and the private (or secret) key, respectively.

My question is: In the McEliece Cryptosystem How I will be able to represent this $1^k$. Is $k$, dimension capable correct?

In my lecture say:

Let be $K$ a the key generation algorithm. Given a security parameter repre- sented in unary, $1^k$, $K(1^k)$ will output a keypair $(pk; sk)$, known as the public key and the private (or secret) key, respectively.

My question is: In the McEliece Cryptosystem How I will be able to represent this $1^k$?

In my lecture say:

Let be $K$ a the key generation algorithm. Given a security parameter repre- sented in unary, $1^k$, $K(1^k)$ will output a keypair $(pk; sk)$, known as the public key and the private (or secret) key, respectively.

My question is: In the McEliece Cryptosystem How I will be able to represent this $1^k$. Is $k$, dimension capable correct?

Source Link
juaninf
juaninf
  • 2.8k
  • 3
  • 19
  • 28