The following pages link to François Arnault (Q662172):
Displaying 15 items.
- A matrix approach for FCSR automata (Q662175) (← links)
- Construction of self-dual normal bases and their complexity (Q765817) (← links)
- Constructing Carmichael numbers which are strong pseudoprimes to several bases (Q1911938) (← links)
- A complete set of multidimensional Bell inequalities (Q2901545) (← links)
- Multidimensional Bell Inequalities and Quantum Cryptography (Q2947060) (← links)
- The Rabin-Monier theorem for Lucas pseudoprimes (Q3127342) (← links)
- Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm (Q3546499) (← links)
- Correction to “Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm” [May 04 910-917] (Q3604666) (← links)
- Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators (Q3604736) (← links)
- A New Approach for FCSRs (Q3651275) (← links)
- Rabin-Miller Primality Test: Composite Numbers Which Pass It (Q4325735) (← links)
- (Q4417389) (← links)
- Revisiting LFSRs for Cryptographic Applications (Q5272226) (← links)
- X-FCSR – A New Software Oriented Stream Cipher Based Upon FCSRs (Q5458221) (← links)
- Fast Software Encryption (Q5473581) (← links)
