Fast pitch modelling for CS-ACELP coder using fermat number transforms

Madre, G.; Baghious, El Houssaïn; Azou, Stéphane; Burel, Gilles

doi:10.1109/isspit.2003.1341233

Cited by 3 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other topics of research have also been benefited from the utilization of NTT approaches. Just to illustrate some of them, one could cite: (i) solving Toeplitz system of equations [19]; (ii) speech coding problems [20]; and (iii) fast matrix multiplication [21]. Two-dimensional number theoretic transforms were subject to a comprehensive exposition in [22].…”

Section: Introductionmentioning

confidence: 99%

Fragile watermarking using finite field trigonometrical transforms

Cintra

Dimitrov

Oliveira

et al. 2009

Signal Processing: Image Communication

View full text Add to dashboard Cite

Fragile digital watermarking has been applied for authentication and alteration detection in images. Utilizing the cosine and Hartley transforms over finite fields, a new transform domain fragile watermarking scheme is introduced. A watermark is embedded into a host image via a blockwise application of two-dimensional finite field cosine or Hartley transforms. Additionally, the considered finite field transforms are adjusted to be number theoretic transforms, appropriate for error-free calculation. The employed technique can provide invisible fragile watermarking for authentication systems with tamper location capability. It is shown that the choice of the finite field characteristic is pivotal to obtain perceptually invisible watermarked images. It is also shown that the generated watermarked images can be used as publicly available signature data for authentication purposes.

show abstract

Section: Introductionmentioning

confidence: 99%

Fragile watermarking using finite field trigonometrical transforms

Cintra

Dimitrov

Oliveira

et al. 2009

Signal Processing: Image Communication

View full text Add to dashboard Cite

show abstract

Rapid Prototyping IP for Autocorrelation Computation

Sayadi

Atri

Tourki

2007

2007 14th IEEE International Conference on Electronics, Circuits and Systems

View full text Add to dashboard Cite

Elliptic Curve Cryptography for Wireless Sensor Networks Using the Number Theoretic Transform

Gulen

Baktır

2020

Sensors

View full text Add to dashboard Cite

We implement elliptic curve cryptography on the MSP430 which is a commonly used microcontroller in wireless sensor network nodes. We use the number theoretic transform to perform finite field multiplication and squaring as required in elliptic curve scalar point multiplication. We take advantage of the fast Fourier transform for the first time in the literature to speed up the number theoretic transform for an efficient realization of elliptic curve cryptography. Our implementation achieves elliptic curve scalar point multiplication in only 0.65 s and 1.31 s for multiplication of fixed and random points, respectively, and has similar or better timing performance compared to previous works in the literature.

show abstract

Fast pitch modelling for CS-ACELP coder using fermat number transforms

Cited by 3 publications

References 9 publications

Fragile watermarking using finite field trigonometrical transforms

Fragile watermarking using finite field trigonometrical transforms

Rapid Prototyping IP for Autocorrelation Computation

Elliptic Curve Cryptography for Wireless Sensor Networks Using the Number Theoretic Transform

Contact Info

Product

Resources

About