Home
last modified time | relevance | path

Searched refs:m_u (Results 126 – 150 of 694) sorted by relevance

12345678910>>...28

/dports/security/cryptopp/cryptopp-8.6.0/
H A Drabin.h71 {m_n = n; m_r = r; m_s = s; m_p = p; m_q = q; m_u = u;} in Initialize()
95 const Integer& GetMultiplicativeInverseOfPrime2ModPrime1() const {return m_u;} in GetMultiplicativeInverseOfPrime2ModPrime1()
99 void SetMultiplicativeInverseOfPrime2ModPrime1(const Integer &u) {m_u = u;} in SetMultiplicativeInverseOfPrime2ModPrime1()
102 Integer m_p, m_q, m_u;
H A Drw.cpp113 m_u = m_q.InverseMod(m_p); in GenerateRandom()
120 m_n = n; m_p = p; m_q = q; m_u = u; in Initialize()
178 m_u.BERDecode(seq); in BERDecode()
190 m_u.DEREncode(seq); in DEREncode()
275 pass = pass && m_u.IsPositive() && m_u < m_p; in Validate()
281 pass = pass && m_u * m_q % m_p == 1; in Validate()
H A Drsa.cpp141 m_u = m_q.InverseMod(m_p); in GenerateRandom()
194 m_u = m_q.InverseMod(m_p); in Initialize()
216 m_u.BERDecode(privateKey); in BERDecodePrivateKey()
231 m_u.DEREncode(privateKey); in DEREncodePrivateKey()
248 Integer y = ModularRoot(re, m_dq, m_dp, m_q, m_p, m_u); in CalculateInverse()
269 pass = pass && m_u.IsPositive() && m_u < m_p; in Validate()
279 pass = pass && m_u * m_q % m_p == 1; in Validate()
/dports/net-p2p/qtum/qtum-mainnet-fastlane-v0.20.3/src/cryptopp/
H A Drabin.h73 {m_n = n; m_r = r; m_s = s; m_p = p; m_q = q; m_u = u;} in Initialize()
97 const Integer& GetMultiplicativeInverseOfPrime2ModPrime1() const {return m_u;} in GetMultiplicativeInverseOfPrime2ModPrime1()
101 void SetMultiplicativeInverseOfPrime2ModPrime1(const Integer &u) {m_u = u;} in SetMultiplicativeInverseOfPrime2ModPrime1()
104 Integer m_p, m_q, m_u;
/dports/emulators/citra-qt5/citra-ac98458e0/externals/cryptopp/cryptopp/
H A Drabin.h71 {m_n = n; m_r = r; m_s = s; m_p = p; m_q = q; m_u = u;} in Initialize()
95 const Integer& GetMultiplicativeInverseOfPrime2ModPrime1() const {return m_u;} in GetMultiplicativeInverseOfPrime2ModPrime1()
99 void SetMultiplicativeInverseOfPrime2ModPrime1(const Integer &u) {m_u = u;} in SetMultiplicativeInverseOfPrime2ModPrime1()
102 Integer m_p, m_q, m_u;
H A Drw.cpp113 m_u = m_q.InverseMod(m_p); in GenerateRandom()
120 m_n = n; m_p = p; m_q = q; m_u = u; in Initialize()
178 m_u.BERDecode(seq); in BERDecode()
190 m_u.DEREncode(seq); in DEREncode()
275 pass = pass && m_u.IsPositive() && m_u < m_p; in Validate()
281 pass = pass && m_u * m_q % m_p == 1; in Validate()
H A Drsa.cpp141 m_u = m_q.InverseMod(m_p); in GenerateRandom()
194 m_u = m_q.InverseMod(m_p); in Initialize()
216 m_u.BERDecode(privateKey); in BERDecodePrivateKey()
231 m_u.DEREncode(privateKey); in DEREncodePrivateKey()
248 Integer y = ModularRoot(re, m_dq, m_dp, m_q, m_p, m_u); in CalculateInverse()
269 pass = pass && m_u.IsPositive() && m_u < m_p; in Validate()
279 pass = pass && m_u * m_q % m_p == 1; in Validate()
/dports/emulators/citra/citra-ac98458e0/externals/cryptopp/cryptopp/
H A Drabin.h71 {m_n = n; m_r = r; m_s = s; m_p = p; m_q = q; m_u = u;} in Initialize()
95 const Integer& GetMultiplicativeInverseOfPrime2ModPrime1() const {return m_u;} in GetMultiplicativeInverseOfPrime2ModPrime1()
99 void SetMultiplicativeInverseOfPrime2ModPrime1(const Integer &u) {m_u = u;} in SetMultiplicativeInverseOfPrime2ModPrime1()
102 Integer m_p, m_q, m_u;
H A Drw.cpp113 m_u = m_q.InverseMod(m_p); in GenerateRandom()
120 m_n = n; m_p = p; m_q = q; m_u = u; in Initialize()
178 m_u.BERDecode(seq); in BERDecode()
190 m_u.DEREncode(seq); in DEREncode()
275 pass = pass && m_u.IsPositive() && m_u < m_p; in Validate()
281 pass = pass && m_u * m_q % m_p == 1; in Validate()
H A Drsa.cpp141 m_u = m_q.InverseMod(m_p); in GenerateRandom()
194 m_u = m_q.InverseMod(m_p); in Initialize()
216 m_u.BERDecode(privateKey); in BERDecodePrivateKey()
231 m_u.DEREncode(privateKey); in DEREncodePrivateKey()
248 Integer y = ModularRoot(re, m_dq, m_dp, m_q, m_p, m_u); in CalculateInverse()
269 pass = pass && m_u.IsPositive() && m_u < m_p; in Validate()
279 pass = pass && m_u * m_q % m_p == 1; in Validate()
/dports/sysutils/fusefs-securefs/securefs-0.12.0/external/cryptopp/
H A Drabin.h71 {m_n = n; m_r = r; m_s = s; m_p = p; m_q = q; m_u = u;} in Initialize()
95 const Integer& GetMultiplicativeInverseOfPrime2ModPrime1() const {return m_u;} in GetMultiplicativeInverseOfPrime2ModPrime1()
99 void SetMultiplicativeInverseOfPrime2ModPrime1(const Integer &u) {m_u = u;} in SetMultiplicativeInverseOfPrime2ModPrime1()
102 Integer m_p, m_q, m_u;
H A Drw.cpp113 m_u = m_q.InverseMod(m_p); in GenerateRandom()
120 m_n = n; m_p = p; m_q = q; m_u = u; in Initialize()
178 m_u.BERDecode(seq); in BERDecode()
190 m_u.DEREncode(seq); in DEREncode()
275 pass = pass && m_u.IsPositive() && m_u < m_p; in Validate()
281 pass = pass && m_u * m_q % m_p == 1; in Validate()
H A Drsa.cpp141 m_u = m_q.InverseMod(m_p);
194 m_u = m_q.InverseMod(m_p);
216 m_u.BERDecode(privateKey);
231 m_u.DEREncode(privateKey);
248 Integer y = ModularRoot(re, m_dq, m_dp, m_q, m_p, m_u);
269 pass = pass && m_u.IsPositive() && m_u < m_p;
279 pass = pass && m_u * m_q % m_p == 1;
/dports/emulators/mess/mame-mame0226/src/devices/cpu/m6809/
H A Dm6809.cpp180 state_add(M6809_U, "U", m_u.w).mask(0xffff); in device_start()
187 m_u.w = 0; in device_start()
201 save_item(NAME(m_u.w)); in device_start()
268 else if (m_reg16 == &m_u) in device_pre_save()
304 set_regop16(m_u); in device_post_load()
508 case 3: result.word_value = m_u.w; break; // U in read_exgtfr_register()
531 case 3: m_u.w = value.word_value; break; // U in write_exgtfr_register()
/dports/emulators/mame/mame-mame0226/src/devices/cpu/m6809/
H A Dm6809.cpp180 state_add(M6809_U, "U", m_u.w).mask(0xffff); in device_start()
187 m_u.w = 0; in device_start()
201 save_item(NAME(m_u.w)); in device_start()
268 else if (m_reg16 == &m_u) in device_pre_save()
304 set_regop16(m_u); in device_post_load()
508 case 3: result.word_value = m_u.w; break; // U in read_exgtfr_register()
531 case 3: m_u.w = value.word_value; break; // U in write_exgtfr_register()
/dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/apbs/include/Eigen/src/SuperLUSupport/
H A DSuperLUSupport.h440 mutable LUMatrixType m_u;
543 return m_u;
579 using Base::m_u;
705 m_u.resize(size,size);
706 m_u.resizeNonZeros(Ustore->nnz);
712 int* Ucol = m_u.outerIndexPtr();
714 Scalar* Uval = m_u.valuePtr();
769 m_u.resizeNonZeros(lastu);
784 for (int j=0; j<m_u.cols(); ++j)
786 if (m_u.outerIndexPtr()[j+1]-m_u.outerIndexPtr()[j] > 0)
[all …]
/dports/math/libmesh/libmesh-1.6.2/contrib/eigen/3.2.9/Eigen/src/SuperLUSupport/
H A DSuperLUSupport.h440 mutable LUMatrixType m_u;
543 return m_u;
579 using Base::m_u;
705 m_u.resize(size,size);
706 m_u.resizeNonZeros(Ustore->nnz);
712 int* Ucol = m_u.outerIndexPtr();
714 Scalar* Uval = m_u.valuePtr();
769 m_u.resizeNonZeros(lastu);
784 for (int j=0; j<m_u.cols(); ++j)
786 if (m_u.outerIndexPtr()[j+1]-m_u.outerIndexPtr()[j] > 0)
[all …]
/dports/graphics/wdune/wdune-1.926/vcglib/eigenlib/Eigen/src/SuperLUSupport/
H A DSuperLUSupport.h440 mutable LUMatrixType m_u;
543 return m_u;
579 using Base::m_u;
705 m_u.resize(size,size);
706 m_u.resizeNonZeros(Ustore->nnz);
712 int* Ucol = m_u.outerIndexPtr();
714 Scalar* Uval = m_u.valuePtr();
769 m_u.resizeNonZeros(lastu);
784 for (int j=0; j<m_u.cols(); ++j)
786 if (m_u.outerIndexPtr()[j+1]-m_u.outerIndexPtr()[j] > 0)
[all …]
/dports/science/smoldyn/smoldyn-2.67/source/NextSubVolume/Eigen/src/SuperLUSupport/
H A DSuperLUSupport.h440 mutable LUMatrixType m_u;
543 return m_u;
579 using Base::m_u;
704 m_u.resize(size,size);
705 m_u.resizeNonZeros(Ustore->nnz);
711 int* Ucol = m_u.outerIndexPtr();
713 Scalar* Uval = m_u.valuePtr();
768 m_u.resizeNonZeros(lastu);
783 for (int j=0; j<m_u.cols(); ++j)
785 if (m_u.outerIndexPtr()[j+1]-m_u.outerIndexPtr()[j] > 0)
[all …]
/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/Eigen3/src/itkeigen/Eigen/src/SuperLUSupport/
H A DSuperLUSupport.h446 mutable LUMatrixType m_u;
552 return m_u;
588 using Base::m_u;
722 m_u.resize(size,size);
723 m_u.resizeNonZeros(Ustore->nnz);
729 int* Ucol = m_u.outerIndexPtr();
731 Scalar* Uval = m_u.valuePtr();
786 m_u.resizeNonZeros(lastu);
801 for (int j=0; j<m_u.cols(); ++j)
803 if (m_u.outerIndexPtr()[j+1]-m_u.outerIndexPtr()[j] > 0)
[all …]
/dports/math/vtk9/VTK-9.1.0/ThirdParty/eigen/vtkeigen/eigen/src/SuperLUSupport/
H A DSuperLUSupport.h446 mutable LUMatrixType m_u;
552 return m_u;
588 using Base::m_u;
722 m_u.resize(size,size);
723 m_u.resizeNonZeros(Ustore->nnz);
729 int* Ucol = m_u.outerIndexPtr();
731 Scalar* Uval = m_u.valuePtr();
786 m_u.resizeNonZeros(lastu);
801 for (int j=0; j<m_u.cols(); ++j)
803 if (m_u.outerIndexPtr()[j+1]-m_u.outerIndexPtr()[j] > 0)
[all …]
/dports/math/pdal/PDAL-2.3.0/vendor/eigen/Eigen/src/SuperLUSupport/
H A DSuperLUSupport.h446 mutable LUMatrixType m_u;
552 return m_u;
588 using Base::m_u;
722 m_u.resize(size,size);
723 m_u.resizeNonZeros(Ustore->nnz);
729 int* Ucol = m_u.outerIndexPtr();
731 Scalar* Uval = m_u.valuePtr();
786 m_u.resizeNonZeros(lastu);
801 for (int j=0; j<m_u.cols(); ++j)
803 if (m_u.outerIndexPtr()[j+1]-m_u.outerIndexPtr()[j] > 0)
[all …]
/dports/graphics/blender/blender-2.91.0/extern/Eigen3/Eigen/src/SuperLUSupport/
H A DSuperLUSupport.h446 mutable LUMatrixType m_u;
552 return m_u;
588 using Base::m_u;
722 m_u.resize(size,size);
723 m_u.resizeNonZeros(Ustore->nnz);
729 int* Ucol = m_u.outerIndexPtr();
731 Scalar* Uval = m_u.valuePtr();
786 m_u.resizeNonZeros(lastu);
801 for (int j=0; j<m_u.cols(); ++j)
803 if (m_u.outerIndexPtr()[j+1]-m_u.outerIndexPtr()[j] > 0)
[all …]
/dports/math/eigen3/eigen-3.3.9/Eigen/src/SuperLUSupport/
H A DSuperLUSupport.h446 mutable LUMatrixType m_u;
552 return m_u;
588 using Base::m_u;
722 m_u.resize(size,size);
723 m_u.resizeNonZeros(Ustore->nnz);
729 int* Ucol = m_u.outerIndexPtr();
731 Scalar* Uval = m_u.valuePtr();
786 m_u.resizeNonZeros(lastu);
801 for (int j=0; j<m_u.cols(); ++j)
803 if (m_u.outerIndexPtr()[j+1]-m_u.outerIndexPtr()[j] > 0)
[all …]
/dports/graphics/appleseed/appleseed-2.1.0-beta/src/thirdparty/bcd/ext/eigen/Eigen/src/SuperLUSupport/
H A DSuperLUSupport.h446 mutable LUMatrixType m_u;
552 return m_u;
588 using Base::m_u;
722 m_u.resize(size,size);
723 m_u.resizeNonZeros(Ustore->nnz);
729 int* Ucol = m_u.outerIndexPtr();
731 Scalar* Uval = m_u.valuePtr();
786 m_u.resizeNonZeros(lastu);
801 for (int j=0; j<m_u.cols(); ++j)
803 if (m_u.outerIndexPtr()[j+1]-m_u.outerIndexPtr()[j] > 0)
[all …]

12345678910>>...28