#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2010

2017

- This year (3)
- Last 5 years (14)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Kevin Atighehchi, A. Enache, Traian Muntean, Gabriel Risterucci
- IACR Cryptology ePrint Archive
- 2010

Recently, cryptanalysts have found collisions on the MD4, MD5, and SHA-0 algorithms; moreover, a method for finding SHA1 collisions with less than the expected calculus complexity has been published.â€¦ (More)

- Kevin Atighehchi, Robert Rolland
- IEEE Transactions on Computers
- 2017

This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) andâ€¦ (More)

- Kevin Atighehchi, Traian Muntean
- AsiaCCS
- 2013

This paper focus on incremental cryptographic schemes that solve the <i>privacy</i> problem introduced by Bellare, Goldreich and Goldwasser. To our knowledge, none of the schemes designed so farâ€¦ (More)

- Kevin Atighehchi, Alexis Bonnecaze
- IACR Cryptology ePrint Archive
- 2016

Discussions are currently underway about the choice of a tree hash mode of operation for a standardization. It appears that a single tree mode cannot address the specificities of all possible usesâ€¦ (More)

- Kevin Atighehchi, Traian Muntean, Sylvain Parlanti, Robert Rolland, Laurent Vallet
- 2010 12th International Symposium on Symbolic andâ€¦
- 2010

This paper describes a new key forwarding protocol for networks messages exchange which guaranties both authentication of participants and forward security. The protocol lies within the framework ofâ€¦ (More)

- Kevin Atighehchi
- ArXiv
- 2016

A recent work shows how we can optimize a tree based mode of operation for a rate-1 hash function where the sizes of input message blocks and digest are the same, subject to the constraint that theâ€¦ (More)

Thanks to a new construction of the so-called Chudnovsky-Chudnovsky multiplication algorithm, we design efficient algorithms for both the exponentiation and the multiplication in finite fields. Theyâ€¦ (More)

- Kevin Atighehchi
- ArXiv
- 2014

The purpose of incremental cryptography is to allow the updating of cryptographic forms of documents undergoing modifications, more efficiently than if we had to recompute them from scratch. Thisâ€¦ (More)

- Kevin Atighehchi
- ArXiv
- 2016

A recent work [2] shows how we can optimize a tree based mode of operation for a rate 1 hash function. In particular, an algorithm and a theorem are presented for selecting a good tree topology inâ€¦ (More)

- Kevin Atighehchi, Alexis Bonnecaze
- IACR Trans. Symmetric Cryptol.
- 2017

Discussions about the choice of a tree hash mode of operation for a standardization have recently been undertaken. It appears that a single tree mode cannot address adequately all possible uses andâ€¦ (More)