Description
A very deep problem with the Mersenne and Fibonacci sequences asks if there are infinitely many prime terms. Bang and Carmichael have studied the simpler problem which asks when the terms have primitive divisors. In my seminar I study the analogous questions for elliptic divisibility sequences.
Next sessions
-
CryptoVerif: a computationally-sound security protocol verifier
Speaker : Bruno Blanchet - Inria
CryptoVerif is a security protocol verifier sound in the computational model of cryptography. It produces proofs by sequences of games, like those done manually by cryptographers. It has an automatic proof strategy and can also be guided by the user. It provides a generic method for specifying security assumptions on many cryptographic primitives, and can prove secrecy, authentication, and[…]-
Cryptography
-