Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

ElimLin Algorithm Revisited

From MaRDI portal
Publication:4899712
Jump to:navigation, search

DOI10.1007/978-3-642-34047-5_18zbMath1282.94039OpenAlexW1850083534MaRDI QIDQ4899712

Nicolas T. Courtois, Pouyan Sepehrdad, Serge Vaudenay, Petr Sušil

Publication date: 8 January 2013

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34047-5_18


zbMATH Keywords

block ciphersalgebraic cryptanalysissystems of sparse polynomial equations of low degree


Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)


Related Items (2)

FUTURE: a lightweight block cipher using an optimal diffusion matrix ⋮ On conversions from CNF to ANF




This page was built for publication: ElimLin Algorithm Revisited

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4899712&oldid=19282088"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 05:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki