Computational Mathematics

Hyper-bent and generalized hyper-bent functions

Date: 

Friday, 27 July, 2018 - 14:30

Hyper-bent Boolean  functions were introduced in 2001 by Youssef and Gong (and initially proposed by Golomb and Gong in 1999 as a component of S-boxes) to ensure the security of symmetric cryptosystems but no cryptographic attack has been identified till 2016.
Hyper-bent functions have properties still stronger than the well-known bent functions which were already studied by Dillon  and

Post-quantum (semi)-group-based Cryptography

Speaker: 

Delaram Kahrobaei

Date: 

Monday, 8 January, 2018 (All day)

Venue: 

Room M029, DMat-FCUP

Abstract. The National Security Agency (NSA) in August 2015 announced plans to transition to post-quantum algorithms “Currently, Suite B cryptographic algorithms are specified by the National Institute of Standards and Technology (NIST) and are used by NSA’s Information Assurance Directorate in solutions approved for protecting classified and unclassified National Security Systems (NSS).

Spectral Lanczos' tau method for systems of nonlinear integro-differential equations

Speaker: 

Marcelo Trindade

Date: 

Friday, 28 April, 2017 (All day)

Venue: 

13:30, Room M030, DMat-FCUP

In this work an extension of the spectral Lanczos' tau method to systems of nonlinear integro-differential equations is proposed. This extension includes (i) linearization coefficients of orthogonal polynomials products issued from nonlinear terms and (ii) recursive relations to implement matrix inversion whenever a polynomial change of basis is required and (iii) orthogonal polynomial evaluations directly on the orthogonal basis.

Subscribe to RSS - Computational Mathematics