Efficient signature schemes based on birational permutations
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Unbalanced Feistel Networks and Block Cipher Design
Proceedings of the Third International Workshop on Fast Software Encryption
Differential Cryptanalysis of Nimbus
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
A Fast New DES Implementation in Software
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Pioneer: verifying code integrity and enforcing untampered code execution on legacy systems
Proceedings of the twentieth ACM symposium on Operating systems principles
Pseudorandom recursions: small and fast pseudorandom number generators for embedded applications
EURASIP Journal on Embedded Systems
Cryptographic properties of nonlinear pseudorandom number generators
Designs, Codes and Cryptography
Linear Equation on Polynomial Single Cycle T-Functions
Information Security and Cryptology
Algebraic Description and Simultaneous Linear Approximations of Addition in Snow 2.0.
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
Differential cryptanalysis of T-function based stream cipher TSC-4
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Gross product simulation with pooling of linear and nonlinear regression models
Proceedings of the 6th International Workshop on Enterprise & Organizational Modeling and Simulation
SBAP: software-based attestation for peripherals
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
Conqueror: tamper-proof code execution on legacy systems
DIMVA'10 Proceedings of the 7th international conference on Detection of intrusions and malware, and vulnerability assessment
Analysis and improvement of a pseudorandom number generator for EPC Gen2 tags
FC'10 Proceedings of the 14th international conference on Financial cryptograpy and data security
Towards a spectral approach for the design of self-synchronizing stream ciphers
Cryptography and Communications
Fast computation of large distributions and its cryptographic applications
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Linear cryptanalysis of the TSC family of stream ciphers
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Distinguishing attacks on t-functions
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
New applications of t-functions in block ciphers and hash functions
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
A new class of single cycle t-functions
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Two algebraic attacks against the F-FCSRs using the IV mode
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Towards a general RC4-Like keystream generator
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Privacy-friendly synchronized ultralightweight authentication protocols in the storm
Journal of Network and Computer Applications
Cryptanalysis of a particular case of klimov-shamir pseudo-random generator
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Cryptanalysis of t-function-based hash functions
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
MV3: a new word based stream cipher using rapid mixing and revolving buffers
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Impossible differential cryptanalysis of the lightweight block ciphers TEA, XTEA and HIGHT
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Linear weaknesses in t-functions
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
Analysis of differential attacks in ARX constructions
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Light-weight primitive, feather-weight security: a cryptanalytic knock-out
Proceedings of the Workshop on Embedded Systems Security
On the distinctness of modular reductions of primitive sequences over Z/(232-1)
Designs, Codes and Cryptography
Hi-index | 0.00 |
Invertible transformations over n-bit words are essential ingredients in many cryptographic constructions. When n is small (e.g., n = 8) we can compactly represent any such transformation as a lookup table, but when n is large (e.g., n = 64) we usually have to represent it as a composition of simpler operations such as linear mappings, S-P networks, Feistel structures, etc. Since these cryptographic constructions are often implemented in software on standard microprocessors, we are particularly interested in invertible univariate or multivariate transformations which can be implemented as small compositions of basic machine instructions on 32 or 64 bit words. In this paper we introduce a new class of provably invertible mappings which can mix arithmetic operations (negation, addition, subtraction, multiplication) and boolean operations (not, xor, and, or), are highly efficient, and have desirable cryptographic properties. In particular, we show that for any n the mapping x 驴 x + (x2 驴 C) (mod 2n) is a permutation with a single cycle of length 2n iff both the least significant bit and the third least significant bit in the constant C are 1.