[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Das et al., 2010 - Google Patents

Generating cryptographically suitable non-linear maximum length cellular automata

Das et al., 2010

Document ID
5392096669710633091
Author
Das S
Roy Chowdhury D
Publication year
Publication venue
International Conference on Cellular Automata

External Links

Snippet

Non-linearity as well as randomness are essential for cryptographic applications. The Linear Cellular Automata (CA), particularly maximum length CA, are well known for generating excellent random sequences. However, till date, adequate research has not been done to …
Continue reading at link.springer.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/725—Finite field arithmetic over elliptic curves
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators
    • G06F7/582—Pseudo-random number generators
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
    • G06F2207/7219—Countermeasures against side channel or fault attacks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation

Similar Documents

Publication Publication Date Title
Dubrova A list of maximum-period NLFSRs
Rajba et al. Research of time characteristics of search methods of inverse element by the module
Moore Predicting nonlinear cellular automata quickly by decomposing them into linear ones
Yang et al. Design space exploration of the lightweight stream cipher WG-8 for FPGAs and ASICs
US8023649B2 (en) Method and apparatus for cellular automata based generation of pseudorandom sequences with controllable period
Xu et al. A Strong Key Expansion Algorithm Based on Nondegenerate 2D Chaotic Map Over GF (2 n)
Das et al. Generating cryptographically suitable non-linear maximum length cellular automata
Biasse et al. A framework for reducing the overhead of the quantum oracle for use with Grover’s algorithm with applications to cryptanalysis of SIKE
Ghosh et al. A scalable method for constructing non-linear cellular automata with period 2 n− 1
Bakoev Fast bitwise implementation of the algebraic normal form transform
Rønjom et al. Attacking the filter generator over GF (2 m)
Das et al. Cryptographically Suitable Maximum Length Cellular Automata.
Kuznetsov et al. Non-Binary Cryptographic Functions for Symmetric Ciphers
Kryvyi et al. Partitioning a set of vectors with nonnegative integer coordinates using logical hardware
Dalai et al. Reducing the number of homogeneous linear equations in finding annihilators
Miroschnyk et al. Practical methods for de Bruijn sequences generation using non-linear feedback shift registers
Lakra et al. Carpenter: a cellular automata based resilient pentavalent stream cipher
Martin et al. Pseudo-random sequences generated by cellular automata
Mandal et al. Cryptographic D-morphic analysis and fast implementations of composited de Bruijn sequences
John et al. On the design of stream ciphers with Cellular Automata having radius= 2
Khairullin et al. On cryptographic properties of some lightweight algorithms and its application to the construction of S-boxes
Karmakar et al. Leakage squeezing using cellular automata
Bessalov et al. 3-and 5-isogenies of supersingular Edwards curves
Sule A Complete algorithm for local inversion of maps: Application to Cryptanalysis
Caballero-Gil et al. Using linear hybrid cellular automata to attack the shrinking generator