The existence of minimal logarithmic signatures for the sporadic Suzuki and simple Suzuki groups

2015 ◽  
Vol 7 (4) ◽  
pp. 535-542 ◽  
Author(s):  
A. R. Rahimipour ◽  
A. R. Ashrafi ◽  
A. Gholami
2019 ◽  
Vol 19 (02) ◽  
pp. 2050036
Author(s):  
Morteza Baniasad Azad ◽  
Behrooz Khosravi

In this paper, we prove that the direct product [Formula: see text], where [Formula: see text] are distinct numbers, is uniquely determined by its complex group algebra. Particularly, we show that the direct product [Formula: see text], where [Formula: see text]’s are distinct odd prime numbers, is uniquely determined by its order and three irreducible character degrees.


2010 ◽  
Vol 132 (4) ◽  
pp. 1113-1152 ◽  
Author(s):  
Petra Hitzelberger ◽  
Linus Kramer ◽  
Richard M. Weiss

2016 ◽  
Vol 28 (2) ◽  
pp. 177-192
Author(s):  
Haibo Hong ◽  
Licheng Wang ◽  
Haseeb Ahmad ◽  
Jun Shao ◽  
Yixian Yang

Radiotekhnika ◽  
2021 ◽  
pp. 106-114
Author(s):  
Y. Kotukh ◽  
T. Okhrimenko ◽  
O. Dyachenko ◽  
N. Rotaneva ◽  
L. Kozina ◽  
...  

Rapid development and advances of quantum computers are contributing to the development of public key cryptosystems based on mathematically complex or difficult problems, as the threat of using quantum algorithms to hack modern traditional cryptosystems is becoming much more real every day. It should be noted that the classical mathematically complex problems of factorization of integers and discrete logarithms are no longer considered complex for quantum calculations. Dozens of cryptosystems were considered and proposed on various complex problems of group theory in the 2000s. One of such complex problems is the problem of the word. One of the first implementations of the cryptosystem based on the word problem was proposed by Magliveras using logarithmic signatures for finite permutation groups and further proposed by Lempken et al. for asymmetric cryptography with random covers. The innovation of this idea is to extend the difficult problem of the word to a large number of groups. The article summarizes the known results of cryptanalysis of the basic structures of the cryptosystem and defines recommendations for ways to improve the cryptographic properties of structures and the use of non-commutative groups as basic structures.


2014 ◽  
Vol 102 (4) ◽  
pp. 301-312 ◽  
Author(s):  
Imke Toborg ◽  
Rebecca Waldecker
Keyword(s):  

1992 ◽  
Vol 40 (3) ◽  
pp. 225-235 ◽  
Author(s):  
Laurie Scott

The purpose of this study was to examine certain effects of designated activities on attention and persevering behaviors of preschool children. Relationships between teacher reinforcement and student attending behavior were also examined. The subjects, eighty 3- to 5-year-old children, were (a) enrolled in individual Suzuki violin lessons, (b) enrolled in individual and group Suzuki violin lessons, (c) enrolled in creative movement classes, (d) enrolled in preschool activities or classes, or (e) not enrolled in any organized preschool activities or classes. Analysis of classroom and lesson videotapes provided information on teacher and student behaviors. Attention and perseverance behaviors were analyzed through observation of videotape recordings of subjects performing two tasks designed by the experimenter. Both Suzuki groups scored higher on all attention task variables than did children in the other groups. Subjects receiving both individual and group Suzuki violin instruction spent significantly more time on the perseverance task than did all other subjects in the creative movement or preschool group. Teachers of subjects receiving both individual and group Suzuki violin instruction demonstrated significantly more teacher approval than did the preschool or creative movement teachers.


2016 ◽  
Vol 44 (9) ◽  
pp. 3927-3932
Author(s):  
Zeinab Akhlaghi ◽  
Maryam Khatami

2014 ◽  
Vol 25 (4) ◽  
pp. 287-296 ◽  
Author(s):  
Haibo Hong ◽  
Licheng Wang ◽  
Yixian Yang ◽  
Haseeb Ahmad

Sign in / Sign up

Export Citation Format

Share Document