Questions tagged [present]

PRESENT is a lightweight block cipher with a 64-bit block size and an 80 or 128 bit key.

PRESENT is an "ultra-lightweight block cipher" developed in 2007. It has a 64-bit block size and an 80 or 128 bit key, and internally uses 31 rounds of a substitution-permutation network based on a single 4-bit S-box. It is included (together with CLEFIA) in the ISO/IEC 29192-2:2012 standard for lightweight block ciphers.

See also:

18 questions
4
votes
3 answers

In what cases might PRESENT be implemented as encryption-only?

In the paper, under section 4.1 Goals and environment of use we read: In applications that demand the most efficient use of space, the block cipher will often only be implemented as encryption-only. I presume this is NOT the same as one-way…
Red Book 1
  • 1,025
  • 10
  • 26
4
votes
1 answer

What is the reasoning behind the PRESENT key schedule?

It seems there are few books on PRESENT and even fewer that give any reasoning behind the mechanics of the key schedule. I understand how it works to the extent that I made a simple Excel program of it. I can clearly see all the steps and I assume…
Red Book 1
  • 1,025
  • 10
  • 26
4
votes
1 answer

If PRESENT had different permutations, would that protect it against Statistical Saturation Attack?

The block cipher PRESENT is vulnerable to the Statistical Saturation Attack for up to 15 rounds (PDF) and a simple example is here. My questions are if some (or all) of the permutations were changed: would this protect it against the Statistical…
Red Book 1
  • 1,025
  • 10
  • 26
3
votes
1 answer

Construction of S-Box in PRESENT

I'm currently working on an hardware implementation (with verilog) of PRESENT-80 for research purposes. Due to our goal to strengthen the security of PRESENT-80 with Masking and Error Detection I need to understand how the S-Box is designed. In…
pushd0wn
  • 86
  • 4
3
votes
1 answer

Are there recommended modes of operation for lightweight ciphers?

There are many recommended modes of operation for block ciphers as described by NIST here, e.g. for DES and AES. However, I am struggling to find any for lightweight ciphers. I am particularly interested in modes of operation for PRESENT, Clefia…
Red Book 1
  • 1,025
  • 10
  • 26
3
votes
3 answers

Test vectors for PRESENT algorithm?

I'm looking for Test Vectors to test my implementation of PRESENT. I would like to test a different input from the usual where the key and the plaintext are either 000..000 or FFF...FFF.
Henrique
  • 31
  • 1
  • 2
2
votes
1 answer

How are the four 8-bit permutation tables of Present cipher calculated?

the fast implementation of present cipher for 8-bit register uses four 8-bit lookups tables for permutation. Table 3 & 2 are : static const uint8_t sbox_pmt_3[256] = { 0xF0, 0xB1, 0xB4, 0xE5, 0xE1, 0xA0, 0xE4, 0xF1, 0xA5, 0xF4, 0xF5, 0xE0,…
hardyrama
  • 2,288
  • 1
  • 17
  • 41
2
votes
1 answer

Where can I find test vectors for the PRESENT cipher with a 128-bit key?

Where can I find the test vectors for the PRESENT block cipher with a 128-bit key?
2
votes
3 answers

What is the time complexity of the basic components of a symmetric cipher?

I have a very basic knowledge on time complexity and even less on programming, so please bear with me. I am interested to know the time complexity in big-O notation of some of the basic operations in symmetric ciphers. In particular: matrix…
2
votes
2 answers

What affect does the permutation layer have on the avalanche effect?

If the permutation is not well thought out, how will this effect the cipher's avalanche effect. For example, if the permutation in PRESENT was in some way different (just made up without any thought) would this adversely affect the avalanche effect?…
Red Book 1
  • 1,025
  • 10
  • 26
2
votes
1 answer

What does it mean when 1 bit goes into an s-box but two (or more) come out?

I am trying to understand how bits are spread in the PRESENT cipher. The bits that enter the permutation of PRESENT return to their original position after only three rounds. But I am told that in fact the S-boxes also affect how they spread.…
Red Book 1
  • 1,025
  • 10
  • 26
2
votes
1 answer

Why is PRESENT 31 rounds?

I tried a number of different inputs and keys and checked their respective hamming distances after each round. It seems PRESENT has an ideal or near ideal hamming distance (31 to 33) after only a few rounds. Indeed, some of the later rounds have…
Red Book 1
  • 1,025
  • 10
  • 26
1
vote
0 answers

Can we protect PRESENT from the Statistical Saturation Attack if we change the permutation layer to a random permutation layer?

This is continuation-question based on: If PRESENT had different permutations s would that protect it against Statistical Saturation Attack? Can we protect PRESENT from Statistical Saturation Attacks by using: unique perms for each round or just…
Red Book 1
  • 1,025
  • 10
  • 26
1
vote
1 answer

How does the PRESENT cipher's permutation affect all rounds when it repeats after every three rounds?

I heard that the permutation in PRESENT affects all bits after only a few rounds. However, when I looked at it the bits return to their original position after only three rounds. For example, in round-1 bit b1 ---> b16, in round-2 b16 ---> b4, and…
Red Book 1
  • 1,025
  • 10
  • 26
1
vote
0 answers

How to apply linear cryptanalysis to PRESENT?

Can someone help me implement linear cryptanalysis of the PRESENT block cipher? How should I start with 64 bits of plaintext and 80 bits of key?
1
2