Skip to main content

Questions tagged [present]

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

1 vote
1 answer
266 views

I was taking a look at the PRESENT lightweight cipher presented here. You can see an implementation of it in Python here. It is basically a Substitution-Permutation (SP) cipher with ultra-lightweight ...
tur11ng's user avatar
  • 1,002
3 votes
1 answer
1k views

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 ...
pushd0wn's user avatar
0 votes
0 answers
78 views

I am working on a project that requires encrypting messages with different ciphers. I am looking for the following ciphers: PRESENT, CLEFIA, LEA, Hill cipher, Affine cipher, Elliptic Curve ...
NotNotLogic's user avatar
2 votes
1 answer
537 views

the fast implementation of present cipher for 8-bit register uses four 8-bit lookups tables for permutation. Table 3 & 2 are : ...
hardyrama's user avatar
  • 2,318
2 votes
1 answer
684 views

Where can I find the test vectors for the PRESENT block cipher with a 128-bit key?
Madhu Ghattamaneni's user avatar
2 votes
3 answers
1k views

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 ...
Red Book 1's user avatar
  • 1,035
3 votes
1 answer
190 views

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 ...
Red Book 1's user avatar
  • 1,035
4 votes
3 answers
493 views

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. ...
Red Book 1's user avatar
  • 1,035
4 votes
1 answer
439 views

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 ...
Red Book 1's user avatar
  • 1,035
1 vote
0 answers
36 views

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 ...
Red Book 1's user avatar
  • 1,035
4 votes
1 answer
521 views

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: ...
Red Book 1's user avatar
  • 1,035
2 votes
2 answers
428 views

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) ...
Red Book 1's user avatar
  • 1,035
0 votes
1 answer
315 views

Currently I am working on PRESENT block cipher implementation (Hardware) and I am unable to understand the role of round counter in key scheduling part of cipher. Can some share some insight on round ...
kedar Dahivale's user avatar
2 votes
1 answer
203 views

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 ...
Red Book 1's user avatar
  • 1,035
1 vote
1 answer
279 views

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-...
Red Book 1's user avatar
  • 1,035

15 30 50 per page