Fast Software Encryption

DOI10.1007/b137506zbMath1140.68391DBLPconf/fse/2005OpenAlexW4214882369WikidataQ28000487 ScholiaQ28000487MaRDI QIDQ5473577

Adi Shamir, Alexander Klimov

Publication date: 22 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b137506

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Theory of software (68N99)

Related Items (8)

The p-adic Theory of Automata Functions ⋮ The autocorrelation properties of single cycle polynomial T-functions ⋮ New application methods for word-oriented cryptographic primitives ⋮ T-functions revisited: new criteria for bijectivity/transitivity ⋮ Two classes of sequences derived from single cycle \(T\)-functions ⋮ Cryptographic properties of nonlinear pseudorandom number generators ⋮ Non-standard Attacks against Cryptographic Protocols, with an Example over a Simplified Mutual Authentication Protocol ⋮ New Directions in Cryptanalysis of Self-Synchronizing Stream Ciphers

This page was built for publication: Fast Software Encryption