Representations over Galois ring of a linear recurring sequence of maximal period over Galois field

2007 ◽  
Vol 17 (1) ◽  
Author(s):  
R. V. Bogonatov
Keyword(s):  
Galois Field ◽  
Galois Ring ◽  
Linear Recurring Sequence

Substitution Box on Maximal Cyclic Subgroup of Units of a Galois Ring

2013 ◽  
Vol 68 (8-9) ◽  
pp. 567-572 ◽  
Author(s):  
Tariq Shah ◽  
Attiq Qamar ◽  
Iqtadar Hussain
Keyword(s):  
Cyclic Subgroup ◽  
Multiplicative Group ◽  
Galois Field ◽  
Galois Ring ◽  
Substitution Box ◽  
Majority Logic ◽  
Group Of Units ◽  
Box Structure ◽  
Majority Logic Criterion ◽  
Maximal Cyclic Subgroup

In this paper, we construct a new substitution box (S-box) structure based on the elements of the maximal cyclic subgroup of the multiplicative group of units in a finite Galois ring instead of Galois field. We analyze the potency of the proposed S-box by using the majority logic criterion. Moreover, we illustrate the utility of the projected S-box in watermarking.

scholarly journals True Random Number Generator Based on Fibonacci-Galois Ring Oscillators for FPGA

2021 ◽  
Vol 11 (8) ◽  
pp. 3330
Author(s):  
Pietro Nannipieri ◽  
Stefano Di Matteo ◽  
Luca Baldanzi ◽  
Luca Crocetti ◽  
Jacopo Belli ◽  
...  
Keyword(s):  
Field Programmable Gate Array ◽  
Random Number ◽  
Random Number Generator ◽  
Random Number Generation ◽  
Galois Ring ◽  
Number Generator ◽  
True Random Number Generator ◽  
Number Generation ◽  
Field Programmable ◽  
Gate Array

Random numbers are widely employed in cryptography and security applications. If the generation process is weak, the whole chain of security can be compromised: these weaknesses could be exploited by an attacker to retrieve the information, breaking even the most robust implementation of a cipher. Due to their intrinsic close relationship with analogue parameters of the circuit, True Random Number Generators are usually tailored on specific silicon technology and are not easily scalable on programmable hardware, without affecting their entropy. On the other hand, programmable hardware and programmable System on Chip are gaining large adoption rate, also in security critical application, where high quality random number generation is mandatory. The work presented herein describes the design and the validation of a digital True Random Number Generator for cryptographically secure applications on Field Programmable Gate Array. After a preliminary study of literature and standards specifying requirements for random number generation, the design flow is illustrated, from specifications definition to the synthesis phase. Several solutions have been studied to assess their performances on a Field Programmable Gate Array device, with the aim to select the highest performance architecture. The proposed designs have been tested and validated, employing official test suites released by NIST standardization body, assessing the independence from the place and route and the randomness degree of the generated output. An architecture derived from the Fibonacci-Galois Ring Oscillator has been selected and synthesized on Intel Stratix IV, supporting throughput up to 400 Mbps. The achieved entropy in the best configuration is greater than 0.995.

scholarly journals Normal Bases on Galois Ring Extensions

Symmetry ◽  
2018 ◽  
Vol 10 (12) ◽  
pp. 702
Author(s):  
Aixian Zhang ◽  
Keqin Feng
Keyword(s):  
Signal Processing ◽  
Finite Field ◽  
Block Cipher ◽  
Field Extension ◽  
Galois Ring ◽  
Normal Basis ◽  
Galois Rings ◽  
Ring Extension ◽  
Galois Fields ◽  
Normal Bases

Normal bases are widely used in applications of Galois fields and Galois rings in areas such as coding, encryption symmetric algorithms (block cipher), signal processing, and so on. In this paper, we study the normal bases for Galois ring extension R / Z p r , where R = GR ( p r , n ) . We present a criterion on the normal basis for R / Z p r and reduce this problem to one of finite field extension R ¯ / Z ¯ p r = F q / F p ( q = p n ) by Theorem 1. We determine all optimal normal bases for Galois ring extension.

scholarly journals Modular invariant models of leptons at level 7

2020 ◽  
Vol 2020 (8) ◽  
Author(s):  
Gui-Jun Ding ◽  
Stephen F. King ◽  
Cai-Chang Li ◽  
Ye-Ling Zhou
Keyword(s):  
Modular Forms ◽  
Galois Field ◽  
Special Linear Group ◽  
Type I ◽  
Time Level ◽  
Projective Special Linear Group ◽  
Modular Invariant ◽  
Seesaw Mechanism ◽  
Linearly Independent ◽  
First Time

Abstract We consider for the first time level 7 modular invariant flavour models where the lepton mixing originates from the breaking of modular symmetry and couplings responsible for lepton masses are modular forms. The latter are decomposed into irreducible multiplets of the finite modular group Γ7, which is isomorphic to PSL(2, Z7), the projective special linear group of two dimensional matrices over the finite Galois field of seven elements, containing 168 elements, sometimes written as PSL2(7) or Σ(168). At weight 2, there are 26 linearly independent modular forms, organised into a triplet, a septet and two octets of Γ7. A full list of modular forms up to weight 8 are provided. Assuming the absence of flavons, the simplest modular-invariant models based on Γ7 are constructed, in which neutrinos gain masses via either the Weinberg operator or the type-I seesaw mechanism, and their predictions compared to experiment.

scholarly journals A Technique for Securing Multiple Digital Images Based on 2D Linear Congruential Generator, Silver Ratio, and Galois Field

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Abdul Gaffar ◽  
Anand B. Joshi ◽  
Sonali Singh ◽  
Vishnu Narayan Mishra ◽  
Hamurabi Gamboa Rosales ◽  
...  
Keyword(s):  
Digital Images ◽  
Galois Field ◽  
Congruential Generator ◽  
Linear Congruential Generator ◽  
Linear Congruential
Sign in / Sign up

Export Citation Format

Share Document