## Abstract

We describe a rather surprising, yet powerful, combination of two famous number theoretic techniques: bounds of exponential sums and lattice reduction algorithms. This combination has led to a number of cryptographic applications, helping to make rigorous several heuristic approaches and provides a two edge sword to defend and attack. It can be used prove important security results arid also to create powerful attacks. The examples of the first group include results about the bit security of the Diffie-Hellman key exchange system, of the Shamir message passing scheme and of the XTR and LUC cryptosystems. The examples of the second group include attacks on the Digital Signature Scheme and its modifications which are provably insecure under certain conditions.

Original language | English |
---|---|

Title of host publication | Finite fields with applications to coding theory, cryptography and related areas |

Editors | Gary L Mullen, Henning Stichtenoth, Horacio TapiaRecillas |

Place of Publication | Berlin; New York |

Publisher | Springer, Springer Nature |

Pages | 286-298 |

Number of pages | 13 |

ISBN (Print) | 3540439617 |

Publication status | Published - 2002 |

Event | 6th International Conference on Finite Fields and Applications (Fq6) - OAXACA, Mexico Duration: 21 May 2001 → 26 May 2001 |

### Conference

Conference | 6th International Conference on Finite Fields and Applications (Fq6) |
---|---|

Country | Mexico |

City | OAXACA |

Period | 21/05/01 → 26/05/01 |

## Keywords

- SECURITY
- SYSTEM