Orthogonal matrix and its application in Bloom's threshold scheme

DOI10.1007/s00200-018-0365-zzbMath1412.65023OpenAlexW2868651202WikidataQ129565085 ScholiaQ129565085MaRDI QIDQ2631929

Ahmed Mameri, Amar Aïssani

Publication date: 16 May 2019

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-018-0365-z

zbMATH Keywords

cryptographyorthogonalizationmatrixsecret sharing

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Cryptography (94A60) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Authentication, digital signatures and secret sharing (94A62) Orthogonalization in numerical linear algebra (65F25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerics of Gram-Schmidt orthogonalization
• A linear time matrix key agreement protocol over small finite fields
• On the inversion of the Vandermonde matrix
• How to share a secret
• Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
• Orthogonal Matrices Over Finite Fields
• Solution of Vandermonde systems of equations

This page was built for publication: Orthogonal matrix and its application in Bloom's threshold scheme