A Parallel Efficient Architecture for Large Cryptographically Robust n × k (k>n/2) Mappings

DOI10.1109/TC.2010.136zbMath1366.94519OpenAlexW2140030204MaRDI QIDQ5280613

No author found.

Publication date: 27 July 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2010.136

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Parallel algorithms in computer science (68W10) Distributed systems (68M14)

Related Items (2)

Algebraic construction of near-bent function with application to cryptography ⋮ Algebraic construction of near-bent and APN functions

This page was built for publication: A Parallel Efficient Architecture for Large Cryptographically Robust n × k (k>n/2) Mappings