Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Norton's Theorem01:14

Norton's Theorem

Norton's theorem is a fundamental principle stating that a linear two-terminal circuit can be substituted with an equivalent circuit, which comprises a current source (ⅠN) in parallel with a resistor (RN). Here, ⅠN represents the short-circuit current flowing through the terminals, and RN stands for the input or equivalent resistance at the terminals when all independent sources are deactivated. This implies that the circuit illustrated in Figure (a) can be exchanged with the one depicted in...
Net Change Theorem01:22

Net Change Theorem

The Net Change Theorem is a fundamental principle in calculus that establishes a direct relationship between a function’s rate of change and its accumulated change over an interval. Mathematically, it states that the definite integral of a function's derivative over a given interval [a,b] yields the net change in the original function:This theorem has significant applications in various real-world scenarios, including physics, economics, and engineering. A particularly useful application is in...
Protecting Groups for Aldehydes and Ketones: Introduction01:23

Protecting Groups for Aldehydes and Ketones: Introduction

Protecting groups are compounds that can bind to a specific functional group in the presence of other functional groups to protect them from undesired chemical reactions. These compounds can selectively bind to particular functional groups and advance chemoselective reactions in polyfunctional systems (Figure 1). After the functional group has served its purpose, it is removed by reacting it with specific compounds.
Fundamental Theorem of Algebra01:30

Fundamental Theorem of Algebra

The Fundamental Theorem of Algebra is central to the study of polynomial equations, asserting that every non-constant polynomial with complex coefficients has at least one complex zero. This means that a polynomial of degree n ≥ 1, written as:  with an ≠ 0, has at least one solution in the complex number system. Since the set of real numbers is a subset of complex numbers, this theorem applies equally to polynomials with real coefficients.Building on this result, the Complete Factorization...
Second Uniqueness Theorem01:16

Second Uniqueness Theorem

Consider a region consisting of several individual conductors with a definite charge density in the region between these conductors. The second uniqueness theorem states that if the total charge on each conductor and the charge density in the in-between region are known, then the electric field can be uniquely determined.
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the surface...
Castigliano's Theorem01:18

Castigliano's Theorem

Castigliano's theorem analyzes displacements and rotations in elastic structures. It relates the derivative of elastic strain energy to the applied forces or moments, allowing for the calculation of deformations. The theorem states that the partial derivative of the total strain energy of a system with respect to a specific load results in the displacement at the point where the load is applied. This principle applies to both forces and moments.

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Geometric sieve over number fields for higher moments.

Research in number theory·2023
Same author

Bounds for Coding Theory over Rings.

Entropy (Basel, Switzerland)·2023
See all related articles

Related Experiment Videos

Cryptanalysis of some nonabelian group-based key exchange protocols.

Simran Tinani1, Carlo Matteotti2, Joachim Rosenthal1

  • 1Institute of Mathematics, University of Zurich, Winterthurerstrasse 190, 8057 Zurich, Switzerland.

Journal of Mathematical Cryptology
|June 3, 2026
PubMed
Summary

This study analyzes the conjugacy search problem (CSP) in nonabelian group-based cryptography, offering polynomial-time solutions for polycyclic and matrix groups. Findings enable new cryptanalysis algorithms for these cryptographic schemes.

Keywords:
cryptanalysisgroup-based cryptographypublic key exchange

Related Experiment Videos

Area of Science:

  • Cryptography
  • Computational Group Theory
  • Algebraic Cryptography

Background:

  • Nonabelian group-based cryptography utilizes the conjugacy search problem (CSP) as a one-way function.
  • Polycyclic and matrix groups are key platform groups in this cryptographic domain.
  • Understanding the complexity of CSP in these groups is crucial for cryptographic security.

Purpose of the Study:

  • To analyze the computational complexity of the conjugacy search problem (CSP) in polycyclic and matrix groups.
  • To develop efficient algorithms for solving CSP in specific group settings.
  • To explore the relationship between CSP and other cryptographic problems like the discrete logarithm problem (DLP).

Main Methods:

  • Developed a polynomial-time algorithm for CSP in finite two-generator polycyclic groups.
  • Utilized Jordan decomposition for matrix groups to reduce restricted CSP to multiple DLPs.
  • Investigated restricted CSP in polycyclic groups, relating it to DLP and diophantine equations.

Main Results:

  • Achieved a polynomial-time solution for CSP in finite two-generator polycyclic groups.
  • Showed that a restricted CSP in matrix groups reduces to O(n^2) DLPs over field extensions.
  • Demonstrated that restricted CSP in two-generator polycyclic groups is equivalent to DLP or diophantine equations.

Conclusions:

  • The study provides efficient solutions for CSP in specific nonabelian group settings.
  • The findings facilitate the development of cryptanalysis algorithms for group-based cryptographic schemes.
  • This research contributes to understanding the security foundations of nonabelian group-based cryptography.